Sciweavers

70 search results - page 12 / 14
» Multi-Token Distributed Mutual Exclusion Algorithm
Sort
View
AI
2008
Springer
13 years 5 months ago
Alternating-offers bargaining with one-sided uncertain deadlines: an efficient algorithm
In the arena of automated negotiations we focus on the principal negotiation protocol in bilateral settings, i.e. the alternatingoffers protocol. In the scientific community it is...
Nicola Gatti, Francesco Di Giunta, Stefano Marino
ICRA
2007
IEEE
124views Robotics» more  ICRA 2007»
14 years 1 days ago
Sensor-Based Dynamic Assignment in Distributed Motion Planning
— Distributed motion planning of multiple agents raises fundamental and novel problems in control theory and robotics. Recently, one such great challenge has been the development...
Michael M. Zavlanos, George J. Pappas
IJCM
2002
92views more  IJCM 2002»
13 years 5 months ago
Random-tree Diameter and the Diameter-constrained MST
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to...
Ayman Abdalla, Narsingh Deo
ICDCS
2006
IEEE
13 years 11 months ago
Computing in the Presence of Timing Failures
Timing failures refer to a situation where the environment in which a system operates does not behave as expected regarding the timing assumptions, that is, the timing constraints...
Gadi Taubenfeld
PPOPP
2005
ACM
13 years 11 months ago
Revocable locks for non-blocking programming
In this paper we present a new form of revocable lock that streamlines the construction of higher level concurrency abstractions such as atomic multi-word heap updates. The key id...
Tim Harris, Keir Fraser