Sciweavers

53 search results - page 2 / 11
» A Filtering Algorithm for Constraints of Difference in CSPs
Sort
View
SAC
2010
ACM
14 years 9 days ago
Relational consistency by constraint filtering
In this paper, we propose a new algorithm for enforcing relational consistency on every set of k constraints of a finite Constraint Satisfaction Problem (CSP). This algorithm ope...
Shant Karakashian, Robert J. Woodward, Berthe Y. C...
ICTAI
2007
IEEE
13 years 11 months ago
Strong Inverse Consistencies for Non-Binary CSPs
Domain filtering local consistencies, such as inverse consistencies, that only delete values and do not add new constraints are particularly useful in Constraint Programming. Alt...
Kostas Stergiou
CP
2009
Springer
14 years 6 months ago
Evaluation of Length-Lex Set Variables
This paper presents the first experimental evaluation of the length-lex domain for set variables. The implementation is based on bound-consistency algorithms proposed in earlier wo...
Justin Yip, Pascal Van Hentenryck
CP
2005
Springer
13 years 11 months ago
Dynamic Ordering for Asynchronous Backtracking on DisCSPs
An algorithm that performs asynchronous backtracking on distributed CSPs, with dynamic ordering of agents is proposed, ABT DO. Agents propose reorderings of lower priority agents a...
Roie Zivan, Amnon Meisels
FLAIRS
2004
13 years 6 months ago
Concurrent Backtrack Search on DisCSPs
A distributed search algorithm for solving distributed constraint satisfaction problems (DisCSPs) is presented. The proposed algorithm is composed of multiple search processes (SP...
Roie Zivan, Amnon Meisels