167 search results - page 16 / 34 » A Genetic Local Search Algorithm for Random Binary Constrain... |
130
Voted
CP
2001
Springer
15 years 7 months ago
2001
Springer
Non-binary constraint satisfaction problems (CSPs) can be solved in two different ways. We can either translate the problem into an equivalent binary one and solve it using well-e...
119
Voted
EOR
2010
15 years 2 months ago
2010
This study investigates an optimization-based heuristic for the Robotic Cell Problem. This problem arises in automated cells and is a complex ow shop problem with a single transpo...
125
Voted
CSCLP
2004
Springer
15 years 8 months ago
2004
Springer
We propose an improved restart strategy for randomized backtrack search, and evaluate its performance by comparing to other heuristic and stochastic search techniques for solving r...
133
Voted
TEC
2010
14 years 9 months ago
2010
Nurse rostering is a difficult search problem with many constraints. In the literature, a number of approaches have been investigated including penalty function methods to tackle t...
110
Voted
RECOMB
2004
Springer
16 years 3 months ago
2004
Springer
In this paper we describe an algorithm for the localization of structured models, i.e. sequences of (simple) motifs and distance constraints. It basically combines standard patter...