261 search results - page 22 / 53 » A randomized polynomial-time simplex algorithm for linear pr... |
ICCAD
1999
IEEE
15 years 4 months ago
1999
IEEE
We present optimal solutions to the test scheduling problem for core-based systems. We show that test scheduling is equivalent to the m-processor open-shop scheduling problem and ...
104
click to vote
COCO
2004
Springer
15 years 3 months ago
2004
Springer
We initiate the study of the computational complexity of the covering radius problem for point lattices, and approximation versions of the problem for both lattices and linear cod...
MANSCI
2008
14 years 11 months ago
2008
We study an iterative cutting-plane algorithm on an integer program, for minimizing the staffing costs of a multiskill call center subject to service-level requirements which are e...
ACTAC
2007
14 years 12 months ago
2007
An o-line scheduling algorithm considers resource, precedence, and synchronisation requirements of a task graph, and generates a schedule guaranteeing its timing requirements. Th...
119
click to vote
CPAIOR
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...