Sciweavers

7 search results - page 1 / 2
» A New Approach to Distributed Task Assignment using Lagrangi...
Sort
View
AAAI
2006
13 years 6 months ago
A New Approach to Distributed Task Assignment using Lagrangian Decomposition and Distributed Constraint Satisfaction
We present a new formulation of distributed task assignment, called Generalized Mutual Assignment Problem (GMAP), which is derived from an NP-hard combinatorial optimization probl...
Katsutoshi Hirayama
CP
2001
Springer
13 years 9 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...
AAAI
1994
13 years 5 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
CP
2007
Springer
13 years 10 months ago
Scheduling Conditional Task Graphs
The increasing levels of system integration in Multi-Processor System-on-Chips (MPSoCs) emphasize the need for new design flows for efficient mapping of multi-task applications o...
Michele Lombardi, Michela Milano
AAAI
2000
13 years 5 months ago
Asynchronous Search with Aggregations
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...
Marius-Calin Silaghi, Djamila Sam-Haroud, Boi Falt...