Sciweavers

566 search results - page 5 / 114
» Solution Reuse in Dynamic Constraint Satisfaction Problems
Sort
View
AAAI
2007
14 years 11 months ago
Transposition Tables for Constraint Satisfaction
In this paper, a state-based approach for the Constraint Satisfaction Problem (CSP) is proposed. The key novelty is an original use of state memorization during search to prevent ...
Christophe Lecoutre, Lakhdar Sais, Sébastie...
IJCAI
1993
14 years 10 months ago
Using Inferred Disjunctive Constraints To Decompose Constraint Satisfaction Problems
Constraint satisfaction problems involve finding values for problem variables that satisfy constraints on what combinations of values are permitted. They have applications in many...
Eugene C. Freuder, Paul D. Hubbe
89
Voted
AIR
2005
111views more  AIR 2005»
14 years 9 months ago
An Arc-Consistency Algorithm for Dynamic and Distributed Constraint Satisfaction Problems
Abstract. This paper presents the new DDAC4 algorithm for dynamic arc consistency enforcement in distributed Constraint Satisfaction Problems. The algorithm is an adaptation of the...
Georg Ringwelski
IJCAI
2003
14 years 10 months ago
Splitting the atom: A new approach to Neighbourhood Interchangeability in Constraint Satisfaction Problems
We investigate interchangeability of values in CSPs, based on an approach where a single value in the domain of a variable can be treated as a combination of “sub-values”. An ...
James Bowen, Chavalit Likitvivatanavong
AUSAI
2003
Springer
15 years 2 months ago
Dynamic Agent Ordering in Distributed Constraint Satisfaction Problems
The distributed constraint satisfaction problem (CSP) is a general formalisation used to represent problems in distributed multiagent systems. To deal with realistic problems, mult...
Lingzhong Zhou, John Thornton, Abdul Sattar