Sciweavers

1274 search results - page 80 / 255
» The Geometry of Coin-Weighing Problems
Sort
View
APPROX
2009
Springer
118views Algorithms» more  APPROX 2009»
14 years 5 months ago
Hellinger Strikes Back: A Note on the Multi-party Information Complexity of AND
The AND problem on t bits is a promise decision problem where either at most one bit of the input is set to 1 (NO instance) or all t bits are set to 1 (YES instance). In this note...
T. S. Jayram
CPAIOR
2009
Springer
14 years 5 months ago
Sequencing and Counting with the multicost-regular Constraint
This paper introduces a global constraint encapsulating a regular constraint together with several cumulative costs. It is motivated in the context of personnel scheduling problems...
Julien Menana, Sophie Demassey
CEC
2007
IEEE
14 years 5 months ago
The application of evolutionary multi-criteria optimization to dynamic molecular alignment
— This study introduces the multi-criteria approach to the optimization of dynamic molecular alignment by shaped femtosecond laser pulses, which has been considered so far only a...
Ofer M. Shir, Michael Emmerich, Thomas Bäck, ...
ICCTA
2007
IEEE
14 years 5 months ago
Covering a Set of Points in a Plane Using Two Parallel Rectangles
We consider the problem of finding two parallel rectangles, in arbitrary orientation, covering a given set of n points in a plane, such that the area of the larger rectangle is m...
Chandan Saha, Sandip Das
COMPGEOM
2006
ACM
14 years 5 months ago
Minimum-cost load-balancing partitions
We consider the problem of balancing the load among m service-providing facilities, while keeping the total cost low. Let R be the underlying demand region, and let p1, . . . , pm...
Boris Aronov, Paz Carmi, Matthew J. Katz