Sciweavers

72 search results - page 11 / 15
» Approximating Semidefinite Packing Programs
Sort
View
CORR
2010
Springer
97views Education» more  CORR 2010»
13 years 9 months ago
Bin Packing via Discrepancy of Permutations
A well studied special case of bin packing is the 3-partition problem, where n items of size > 1 4 have to be packed in a minimum number of bins of capacity one. The famous Kar...
Friedrich Eisenbrand, Dömötör P&aac...
ESA
2003
Springer
90views Algorithms» more  ESA 2003»
14 years 2 months ago
Packing a Trunk
We report on a project with a German car manufacturer. The task is to compute (approximate) solutions to a specific large-scale packing problem. Given a polyhedral model of a car ...
Friedrich Eisenbrand, Stefan Funke, Joachim Reiche...
TWC
2010
13 years 4 months ago
Superimposed training designs for spatially correlated MIMO-OFDM systems
Only one asymptotic training design for a special case of channel correlation was proposed in the literature for spatially correlated multiple-input multiple-output with orthogonal...
Nguyen Nam Tran, Hoang Duong Tuan, Ha H. Nguyen
AIPS
2004
13 years 11 months ago
Optimal Rectangle Packing: New Results
We present new results on the problem of finding an enclosing rectangle of minimum area that will contain a given a set of rectangles. Many simple scheduling tasks can be modelled...
Richard E. Korf
AAAI
2006
13 years 11 months ago
Compact, Convex Upper Bound Iteration for Approximate POMDP Planning
Partially observable Markov decision processes (POMDPs) are an intuitive and general way to model sequential decision making problems under uncertainty. Unfortunately, even approx...
Tao Wang, Pascal Poupart, Michael H. Bowling, Dale...