167 search results - page 28 / 34 » A Genetic Local Search Algorithm for Random Binary Constrain... |
109
Voted
SETN
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. In order to obtain a solution to a constraint satisfaction problem, constructive methods iteratively extend a consistent partial assignment until all problem variables ar...
146
Voted
CORR
2010
Springer
14 years 9 months ago
2010
Springer
This paper extends the analogies employed in the development of quantum-inspired evolutionary algorithms by proposing quantum-inspired Hadamard walks, called QHW. A novel quantum-...
124
Voted
AI
1998
Springer
15 years 7 months ago
1998
Springer
Abstract. The general timetabling problem is an assignment of activities to xed time intervals, adhering to a prede ned set of resource availabilities. Timetabling problems are di ...
135
Voted
ECP
1997
Springer
15 years 7 months ago
1997
Springer
We provide a reconstruction of Blum and Furst’s Graphplan algorithm, and use the reconstruction to extend and improve the original algorithm in several ways. In our reconstructi...
102
Voted
CP
2003
Springer
15 years 8 months ago
2003
Springer
Arc consistency plays a central role in solving Constraint Satisfaction Problems. This is the reason why many algorithms have been proposed to establish it. Recently, an algorithm ...