348 search results - page 3 / 70 » Search Ordering Heuristics for Restarts-Based Constraint Sol... |
CP
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. The paper presents a new look-ahead scheme for backtracking search for solving constraint satisfaction problems. This look-ahead scheme computes a heuristic for value ord...
AMAI
2004
Springer
13 years 10 months ago
2004
Springer
This paper presents new look-ahead schemes for backtracking search when solving constraint satisfaction problems. The look-ahead schemes compute a heuristic for value ordering and...
CP
2005
Springer
13 years 10 months ago
2005
Springer
A search algorithm based on non-binary forward checking (nFC) is used to solve the car-sequencing problem. The choice of value ordering heuristics having a dramatic effect on solu...
IBERAMIA
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. In constraint satisfaction, a general rule is to tackle the hardest part of a search problem first. In this paper, we introduce a parameter (τ) that measures the constr...
AIMSA
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. The problem of curriculum-based course timetabling is studied in this work. In addition to formally defining the problem, we present a hybrid solution algorithm (Adaptiv...