225 search results - page 12 / 45 » Dynamic Agent Ordering in Distributed Constraint Satisfactio... |
85
Voted
AAAI
2000
14 years 11 months ago
2000
Many problem-solving tasks can be formalized as constraint satisfaction problems (CSPs). In a multi-agent setting, information about constraints and variables may belong to differ...
90
Voted
SAC
1994
ACM
15 years 1 months ago
1994
ACM
An extension of Me parallel constraint logic programming language ElipSys is presented. This extension is directed towards the development of multi-agent systems which have to dea...
AAAI
1994
14 years 11 months ago
1994
We describe a method for learning formulas in firstorder logic using a brute-force, smallest-first search. The method is exceedingly simple. It generates all irreducible well-form...
AAAI
2007
14 years 12 months ago
2007
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 ...
105
click to vote
AAAI
2006
14 years 11 months ago
2006
We present a new efficient algorithm for obtaining utilitarian optimal solutions to Disjunctive Temporal Problems with Preferences (DTPPs). The previous state-of-the-art system ac...