717 search results - page 48 / 144 » Weak-Commitment Search for Solving Constraint Satisfaction P... |
CP
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Constraint Programming is a proven successful technique, but it requires skill in modeling problems, and knowledge on how algorithms interact with models. What can be a g...
CP
1999
Springer
15 years 2 months ago
1999
Springer
A lot of work in constraint satisfaction has been focused on finding solutions to difficult problems. Many real life problems however, while not extremely complicated, have a huge...
ECAL
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. This paper proposes a computational model for solving optimisation problems that mimics the principle of evolutionary transitions in individual complexity. More specific...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
Abstract. We describe decomposition during search (DDS), an integration of And/Or tree search into propagation-based constraint solvers. The presented search algorithm dynamically ...
DAM
2000
14 years 9 months ago
2000
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...