Sciweavers

161
Voted
CP
1995
Springer
15 years 4 months ago
Asynchronous Weak-commitment Search for Solving Distributed Constraint Satisfaction Problems
A distributed constraint satisfaction problem (Distributed CSP) is a CSP in which variables and constraints are distributed among multiple automated agents, and various application...
Makoto Yokoo
CP
1995
Springer
15 years 4 months ago
Integrating Constraints in an Object-Based Knowledge Representation System
Object-based knowledge representation systems bene t from the declarative power of the object formalism for modeling, organizing and storing large amounts of knowledge. They also ...
Jérôme Gensel
100
Voted
CP
1995
Springer
15 years 4 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
1995
Springer
15 years 4 months ago
Optimization-based Heuristics for Maximal Constraint Satisfaction
We present a new heuristic approach for maximal constraint satisfaction of overconstrained problems (MAX-CSP). This approach is based on a formulation of CSP as an optimization pro...
Javier Larrosa, Pedro Meseguer
CP
1995
Springer
15 years 4 months ago
On the Forward Checking Algorithm
The forward checking algorithm for solving constraint satisfaction problems is a popular and successful alternative to backtracking. However, its successhas largely been determined...
Fahiem Bacchus, Adam J. Grove
Artificial Intelligence
Top of PageReset Settings