Sciweavers

2354 search results - page 109 / 471
» Assignment Problems
Sort
View
WAOA
2004
Springer
127views Algorithms» more  WAOA 2004»
15 years 7 months ago
Better Bounds for Minimizing SONET ADMs
SONET add-drop multiplexers (ADMs) are the dominant cost factor in SONET /WDM rings. The number of SONET ADMs required by a set of traffic streams is determined by the routing and...
Leah Epstein, Asaf Levin
255
Voted
SWARM
2012
SPRINGER
329views Optimization» more  SWARM 2012»
13 years 9 months ago
A critical analysis of parameter adaptation in ant colony optimization
Applying parameter adaptation means operating on parameters of an algorithm while it is tackling an instance. For ant colony optimization, several parameter adaptation methods have...
Paola Pellegrini, Thomas Stützle, Mauro Birat...
109
Voted
CAV
2009
Springer
182views Hardware» more  CAV 2009»
15 years 9 months ago
Generalizing DPLL to Richer Logics
The DPLL approach to the Boolean satisfiability problem (SAT) is a combination of search for a satisfying assignment and logical deduction, in which each process guides the other....
Kenneth L. McMillan, Andreas Kuehlmann, Mooly Sagi...
108
Voted
COR
2010
127views more  COR 2010»
15 years 2 months ago
Discrepancy search for the flexible job shop scheduling problem
The Flexible Job Shop scheduling Problem (FJSP) is a generalization of the classical Job Shop Problem in which each operation must be processed on a given machine chosen among a f...
Abir Ben Hmida, Mohamed Haouari, Marie-José...
JAIR
2007
141views more  JAIR 2007»
15 years 2 months ago
Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...
Alex S. Fukunaga, Richard E. Korf