Sciweavers

151 search results - page 10 / 31
» Online Square Packing
Sort
View
AIPS
2003
14 years 11 months ago
Optimal Rectangle Packing: Initial Results
Given a set of rectangles with fixed orientations, we want to find an enclosing rectangle of minimum area that contains them all with no overlap. Many simple scheduling tasks ca...
Richard E. Korf
SIAMJO
2008
175views more  SIAMJO 2008»
14 years 9 months ago
On Bin Packing with Conflicts
Abstract. We consider the offline and online versions of a bin packing problem called bin packing with conflicts. Given a set of items V = {1, 2, . . . , n} with sizes s1, s2 . . ....
Leah Epstein, Asaf Levin
ICALP
2005
Springer
15 years 3 months ago
Dynamic Bin Packing of Unit Fractions Items
This paper studies the dynamic bin packing problem, in which items arrive and depart at arbitrary time. We want to pack a sequence of unit fractions items (i.e., items with sizes ...
Wun-Tat Chan, Tak Wah Lam, Prudence W. H. Wong
COCOON
2006
Springer
15 years 1 months ago
The Class Constrained Bin Packing Problem with Applications to Video-on-Demand
In this paper we present approximation results for the class constrained bin packing problem that has applications to Video-on-Demand Systems. In this problem we are given bins of...
E. C. Xavier, Flávio Keidi Miyazawa
76
Voted
IJON
2006
65views more  IJON 2006»
14 years 9 months ago
On-line estimation of the final prediction error via recursive least-squares method
This paper starting from the very first principle presents a derivation of an equation estimating of the final prediction error for a neural network under the recursive least squa...
John Sum, Kevin Ho