Sciweavers

428 search results - page 7 / 86
» An asynchronous complete method for distributed constraint o...
Sort
View
JETAI
2008
93views more  JETAI 2008»
13 years 7 months ago
The message management asynchronous backtracking algorithm
: This paper shows how the Asynchronous Backtracking (Yokoo et al., 1998) algorithm, a well known distributed constraint satisfaction algorithm, produces unnecessary messages and i...
Hong Jiang, José M. Vidal
AAAI
2008
13 years 10 months ago
Anytime Local Search for Distributed Constraint Optimization
Most former studies of Distributed Constraint Optimization Problems (DisCOPs) search considered only complete search algorithms, which are practical only for relatively small prob...
Roie Zivan
SIMPRA
1998
99views more  SIMPRA 1998»
13 years 7 months ago
Rollback overhead reduction methods for time warp distributed simulation
Parallel discrete event simulation is a useful technique to improve performance of sequential discrete event simulation. We consider the Time Warp algorithm for asynchronous distr...
Simonetta Balsamo, C. Manconi
ICC
2009
IEEE
135views Communications» more  ICC 2009»
14 years 2 months ago
Completion Time Minimization and Robust Power Control in Wireless Packet Networks
A wireless packet network is considered in which each user transmits a stream of packets to its destination. The transmit power of each user interferes with the transmission of al...
Chris T. K. Ng, Muriel Médard, Asuman E. Oz...
FLAIRS
2004
13 years 9 months ago
Dynamic Agent-Ordering and Nogood-Repairing in Distributed Constraint Satisfaction Problems
The distributed constraint satisfaction problem (CSP) is a general formalization used to represent problems in distributed multi-agent systems. To deal with realistic problems, mu...
Lingzhong Zhou, John Thornton, Abdul Sattar