Sciweavers

36 search results - page 2 / 8
» Dynamic Prioritization of Complex Agents in Distributed Cons...
Sort
View
CP
1995
Springer
15 years 6 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
ECAI
2004
Springer
15 years 8 months ago
Improving Asynchronous Backtracking for Dealing with Complex Local Problems
Distributed constraint satisfaction, in its most general acceptation, involves a collection of agents solving local constraint satisfaction subproblems, and a communication protoco...
Arnold Maestre, Christian Bessière
AAAI
1994
15 years 4 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
GLOBECOM
2009
IEEE
15 years 10 months 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
CP
2001
Springer
15 years 7 months ago
A Dynamic Distributed Constraint Satisfaction Approach to Resource Allocation
Abstract. In distributed resource allocation a set of agents must assign their resources to a set of tasks. This problem arises in many real-world domains such as disaster rescue, ...
Pragnesh Jay Modi, Hyuckchul Jung, Milind Tambe, W...