2084 search results - page 284 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
ESA
2003
Springer
15 years 3 months ago
2003
Springer
We propose a new complexity measure for movement of objects, the smoothed motion complexity. Many applications are based on algorithms dealing with moving objects, but usually data...
JPDC
2007
14 years 9 months ago
2007
In a distributed heterogeneous computing system, the resources have different capabilities and tasks have different requirements. To maximize the performance of the system, it is ...
ISAAC
2009
Springer
15 years 4 months ago
2009
Springer
The problem of maintaining geometric structures for points in motion has been well studied over the years. Much theoretical work to date has been based on the assumption that point...
DIALM
2010
ACM
14 years 11 months ago
2010
ACM
In this paper we introduce the regional consecutive leader election (RCLE) problem, which extends the classic leader election problem to the ever-changing environment of mobile ad-...
LCN
2006
IEEE
15 years 3 months ago
2006
IEEE
— In this paper, we present a distributed computing framework designed to support higher quality of service and fault tolerance for processing deadline-driven tasks in a P2P envi...