Sciweavers

150 search results - page 21 / 30
» Hybrid Constraint Tightening for Solving Hybrid Scheduling P...
Sort
View
CORR
2008
Springer
153views Education» more  CORR 2008»
13 years 8 months ago
Decomposition Techniques for Subgraph Matching
In the constraint programming framework, state-of-the-art static and dynamic decomposition techniques are hard to apply to problems with complete initial constraint graphs. For suc...
Stéphane Zampelli, Martin Mann, Yves Devill...
ICC
2007
IEEE
14 years 2 months ago
Hybrid Power/Overlap Allocation Scheme for a Multirate Overlapped Optical CDMA System
– This paper addresses the problem of resource allocation in a multiservice optical network based on an Overlapped-CDMA system. A joint transmission power and overlapping coeffic...
Robert Raad, Elie Inaty, Paul Fortier, Hossam M. H...
CORR
2008
Springer
95views Education» more  CORR 2008»
13 years 8 months ago
An Indirect Genetic Algorithm for a Nurse Scheduling Problem
This paper describes a Genetic Algorithms approach to a manpower-scheduling problem arising at a major UK hospital. Although Genetic Algorithms have been successfully used for sim...
Uwe Aickelin, Kathryn A. Dowsland
HM
2007
Springer
120views Optimization» more  HM 2007»
14 years 2 months ago
On the Combination of Constraint Programming and Stochastic Search: The Sudoku Case
Sudoku is a notorious logic-based puzzle that is popular with puzzle enthusiasts the world over. From a computational perspective, Sudoku is also a problem that belongs to the set ...
Rhydian Lewis
WEA
2010
Springer
250views Algorithms» more  WEA 2010»
14 years 1 months ago
Randomized Rounding for Routing and Covering Problems: Experiments and Improvements
We investigate how the recently developed different approaches to generate randomized roundings satisfying disjoint cardinality constraints behave when used in two classical algori...
Benjamin Doerr, Marvin Künnemann, Magnus Wahl...