Sciweavers

660 search results - page 39 / 132
» Hybrid CSP Solving
Sort
View
MICAI
2004
Springer
14 years 3 months ago
Evaluation-Based Semiring Meta-constraints
Abstract. Classical constraint satisfaction problems (CSPs) provide an expressive formalism for describing and solving many real-world problems. However, classical CSPs prove to be...
Jerome Kelleher, Barry O'Sullivan
CSR
2010
Springer
14 years 2 months ago
Comparing Two Stochastic Local Search Algorithms for Constraint Satisfaction Problems
Abstract. In this survey we compare the similarities, differences and the complexities of two very different approaches to solve a general constraint satisfaction probblems (CSP). ...
Uwe Schöning
CP
2001
Springer
14 years 2 months ago
Partially Ordered Constraint Optimization Problems
The Constraint Problems usually addressed fall into one of two models: the Constraint Satisfaction Problem (CSP) and the Constraint Optimization Problem (COP). However, in many rea...
Marco Gavanelli
FLAIRS
2007
14 years 6 days ago
Maintaining Arc-Consistency over Mutex Relations in Planning Graphs during Search
We deal with the search process of the GraphPlan algorithm in this paper. We concentrate on a problem of finding supports for a sub-goal which arises during the search. We model t...
Pavel Surynek, Roman Barták
AAAI
2010
13 years 11 months ago
A First Practical Algorithm for High Levels of Relational Consistency
Consistency properties and algorithms for achieving them are at the heart of the success of Constraint Programming. In this paper, we study the relational consistency property R(,...
Shant Karakashian, Robert J. Woodward, Christopher...