Sciweavers

53 search results - page 3 / 11
» A Filtering Algorithm for Constraints of Difference in CSPs
Sort
View
CSR
2010
Springer
13 years 11 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
2004
Springer
13 years 10 months ago
Concurrent Dynamic Backtracking for Distributed CSPs
A distributed concurrent search algorithm for distributed constraint satisfaction problems (DisCSPs) is presented. Concurrent search algorithms are composed of multiple search proc...
Roie Zivan, Amnon Meisels
CP
1995
Springer
13 years 10 months ago
Dynamic Variable Ordering in CSPs
Abstract. We investigate the dynamic variable ordering (DVO) technique commonly used in conjunction with tree-search algorithms for solving constraint satisfaction problems. We fi...
Fahiem Bacchus, Paul van Run
CP
2006
Springer
13 years 10 months ago
Boosting Open CSPs
In previous work, a new approach called Open CSP (OCSP) was defined as a way of integrate information gathering and problem solving. Instead of collecting all variable values befor...
Santiago Macho González, Carlos Ansó...
AI
2002
Springer
13 years 6 months ago
Multi-agent oriented constraint satisfaction
This paper presents a multi-agent oriented method for solving CSPs (Constraint Satisfaction Problems). In this method, distributed agents represent variables and a two-dimensional...
Jiming Liu, Han Jing, Yuan Yan Tang