23413 search results - page 4435 / 4683 » or 2005 |
209
click to vote
CP
2005
Springer
16 years 25 days ago
2005
Springer
Abstract. Most CSP algorithms are based on refinements and extensions of backtracking, and employ one of two simple “branching schemes”: 2-way branching or d-way branching, fo...
189
click to vote
CP
2005
Springer
16 years 25 days ago
2005
Springer
Abstract. In recent years, dynamic local search (DLS) clause weighting algorithms have emerged as the local search state-of-the-art for solving propositional satisfiability proble...
173
click to vote
CP
2005
Springer
16 years 25 days ago
2005
Springer
Constrained path problems have to do with finding paths in graphs subject to constraints. One way of constraining the graph is by enforcing reachability on nodes. For instance, i...
182
click to vote
CPAIOR
2005
Springer
16 years 25 days ago
2005
Springer
The Employee Timetabling Problem (ETP) is a general class of problems widely encountered in service organizations (such as call centers for instance). Given a set of activities, a ...
193
click to vote
CPAIOR
2005
Springer
16 years 25 days ago
2005
Springer
We describe the problem of scheduling astronomy observations for the Stratospheric Observatory for Infrared Astronomy, an airborne telescope. The problem requires maximizing the nu...