Sciweavers

1986 search results - page 327 / 398
» constraints 2006
Sort
View
APPROX
2006
Springer
124views Algorithms» more  APPROX 2006»
14 years 1 months ago
Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
The data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. It is modeled by a transfer graph, wher...
Rajiv Gandhi, Julián Mestre
ATAL
2006
Springer
14 years 1 months ago
Adaptive distributed resource allocation and diagnostics using cooperative information-sharing strategies
A major challenge in efficiently solving distributed resource allocation problems is to cope with the dynamic state changes that characterise such systems. An effective solution t...
Partha Sarathi Dutta, Nicholas R. Jennings, Luc Mo...
ATAL
2006
Springer
14 years 1 months ago
Balancing the needs of players and spectators in agent-based commentary systems
We describe an agent-based commentary system for computer games which produces real-time and post-game commentary for spectators. Our system adopts an embodied approach in which r...
Dan Fielding, Brian Logan, Steve Benford
ATAL
2006
Springer
14 years 1 months ago
Distributed Lagrangean relaxation protocol for the generalized mutual assignment problem
Abstract. The generalized assignment problem (GAP) is a typical NP-hard problem and has been studied for many years mainly in the operations research community. The goal of the GAP...
Katsutoshi Hirayama
ATAL
2006
Springer
14 years 1 months ago
Specifying and resolving preferences among agent interaction patterns
A strength of commitment protocols is that they enable agents to act flexibly, thereby enabling them to accommodate varying local policies and respond to exceptions. A consequent ...
Ashok U. Mallya, Munindar P. Singh