Sciweavers

225 search results - page 5 / 45
» Dynamic Agent Ordering in Distributed Constraint Satisfactio...
Sort
View
JAIR
2006
131views more  JAIR 2006»
15 years 5 months ago
Asynchronous Partial Overlay: A New Algorithm for Solving Distributed Constraint Satisfaction Problems
Distributed Constraint Satisfaction (DCSP) has long been considered an important problem in multi-agent systems research. This is because many real-world problems can be represent...
Roger Mailler, Victor R. Lesser
137
Voted
AAAI
1996
15 years 6 months ago
Agent Cooperation Can Compensate For Agent Ignorance in Constraint Satisfaction
A team of constraint agents with diverse viewpoints canfind a solution to a constraint satisfaction problem (CSP) whenthe individual agents have an incomplete viewof the problem.I...
Peggy S. Eaton, Eugene C. Freuder
CEEMAS
2005
Springer
15 years 10 months ago
On Communication in Solving Distributed Constraint Satisfaction Problems
Abstract. Distributed Constraint Satisfaction Problems (DCSP) is a general framework for multi-agent coordination and conflict resolution. In most DCSP algorithms, inter-agent com...
Hyuckchul Jung, Milind Tambe
GLOBECOM
2009
IEEE
16 years 12 hour ago
A Distributed Constraint Satisfaction Problem for Virtual Device Composition in Mobile Ad Hoc Networks
— The dynamic composition of systems of networked appliances, or virtual devices, enables users to generate complex strong specific systems. Current prominent MANET-based composi...
Eric Karmouch, Amiya Nayak
AAAI
1990
15 years 6 months ago
Some Applications of Graph Bandwidth to Constraint Satisfaction Problems
Bandwidth is a fundamental concept in graph theory which has some surprising applications to a class of AI search problems. Graph bandwidth provides a link between the syntactic s...
Ramin Zabih