Sciweavers

1480 search results - page 24 / 296
» Ants can solve constraint satisfaction problems
Sort
View
IJCAI
1993
14 years 7 days 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
FOCS
2009
IEEE
14 years 5 months ago
Constraint Satisfaction Problems of Bounded Width
We provide a full characterization of applicability of The Local Consistency Checking algorithm to solving the non-uniform Constraint Satisfaction Problems. This settles the conje...
Libor Barto, Marcin Kozik
AI
2007
Springer
14 years 5 months ago
Multiagent Constraint Satisfaction with Multiply Sectioned Constraint Networks
Abstract. Variables and constraints in problem domains are often distributed. These distributed constraint satisfaction problems (DCSPs) lend themselves to multiagent solutions. Mo...
Yang Xiang, Wanling Zhang
ECAI
2008
Springer
14 years 21 days ago
The Impact of Constraint Programming
Constraint satisfaction problems (CSPs) are ubiquitous in many real-world contexts. However, modeling a problem as a CSP can be very challenging, usually requiring considerable ex...
Pascal Van Hentenryck
CP
2003
Springer
14 years 4 months ago
Solving Finite Domain Constraint Hierarchies by Local Consistency and Tree Search
We provide a reformulation of the constraint hierarchies (CHs) framework based on the notion of error indicators. Adapting the generalized view of local consistency in semiring-ba...
Stefano Bistarelli, Philippe Codognet, Kin Chuen H...