Sciweavers

980 search results - page 25 / 196
» Decentralized Constraint Satisfaction
Sort
View
FLAIRS
2004
14 years 11 months ago
CSAA: A Distributed Ant Algorithm Framework for Constraint Satisfaction
In this paper the distributed Constraint Satisfaction Ant Algorithm (CSAA) framework is presented. It uses an ant-based system for the distributed solving of constraint satisfacti...
Koenraad Mertens, Tom Holvoet
CIE
2007
Springer
15 years 4 months ago
Computational Complexity of Constraint Satisfaction
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
Heribert Vollmer
AAAI
1994
14 years 11 months ago
Solution Reuse in Dynamic Constraint Satisfaction Problems
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
Gérard Verfaillie, Thomas Schiex
APIN
2006
109views more  APIN 2006»
14 years 10 months ago
Visual analogy: Viewing analogical retrieval and mapping as constraint satisfaction problems
The core issue of analogical reasoning is the transfer of relational knowledge from a source case to a target problem. Visual analogical reasoning pertains to problems containing ...
Patrick W. Yaner, Ashok K. Goel
ICALP
2007
Springer
15 years 4 months ago
Universal Algebra and Hardness Results for Constraint Satisfaction Problems
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
Benoit Larose, Pascal Tesson