Sparse, Continuous Policy Representations for Uniform Online Bin Packing via Regression of Interpolants

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-319-55453-2_13
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer International Publishing

Related search

The Optimal Absolute Ratio for Online Bin Packing

Journal of Computer and System Sciences
Computer NetworksApplied MathematicsCommunicationsComputational TheoryMathematicsTheoretical Computer Science
2019English

Online Bin Packing With Resource Augmentation

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Online Bin Packing With Cardinality Constraints

SIAM Journal on Discrete Mathematics
Mathematics
2006English

Perfect Packing Theorems and the Average-Case Behavior of Optimal and Online Bin Packing

SIAM Review
Computational MathematicsApplied MathematicsTheoretical Computer Science
2002English

Bin Packing With Queues

Journal of Applied Probability
MathematicsStatisticsUncertaintyProbability
2008English

Online Sparse Multi-Output Gaussian Process Regression and Learning

IEEE Transactions on Signal and Information Processing over Networks
Computer NetworksInformation SystemsSignal ProcessingCommunications
2019English

Modified Strip Packing Heuristics for the Rectangular Variable-Sized Bin Packing Problem

ORiON
2010English

Probabilistic Analysis of Algorithms for Dual Bin Packing Problems

Journal of Algorithms
1991English

SAR Image Filtering via Learned Dictionaries and Sparse Representations

2008English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy