Sciweavers

711 search results - page 61 / 143
» Amalgams of Constraint Satisfaction Problems
Sort
View
FLAIRS
2007
15 years 6 months ago
Search Ordering Heuristics for Restarts-Based Constraint Solving
Constraint Satisfaction Problems are ubiquitous in Artificial Intelligence. Over the past decade significant advances have been made in terms of the size of problem instance tha...
Margarita Razgon, Barry O'Sullivan, Gregory M. Pro...
ECP
1997
Springer
88views Robotics» more  ECP 1997»
15 years 8 months ago
A Time and Resource Problem for Planning Architectures
This paper concerns the problem of resource reasoning in planning. It defines formally a constraint satisfaction problem, the Time and Resource Problem (T RP), in which resource r...
Amedeo Cesta, Cristiano Stella
125
Voted
AI
2005
Springer
15 years 4 months ago
The distributed breakout algorithms
We present a new series of distributed constraint satisfaction algorithms, the distributed breakout algorithms, which is inspired by local search algorithms for solving the constr...
Katsutoshi Hirayama, Makoto Yokoo
CP
2005
Springer
15 years 6 months ago
Evolving Variable-Ordering Heuristics for Constrained Optimisation
In this paper we present and evaluate an evolutionary approach for learning new constraint satisfaction algorithms, specifically for MAX-SAT optimisation problems. Our approach of...
Stuart Bain, John Thornton, Abdul Sattar
136
Voted
AIPS
2009
15 years 5 months ago
Extended Goals for Composing Services
The ability to automatically compose Web Services is critical for realising more complex functionalities. Several proposals to use automated planning to deal with the problem of s...
Eirini Kaldeli, Alexander Lazovik, Marco Aiello