2084 search results - page 252 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
179
click to vote
AAAI
1992
15 years 8 months ago
1992
It is often useful for a robot to construct a spatial representation of its environment from experiments and observations, in other words, to learn a map of its environment by exp...
172
click to vote
IUI
2009
ACM
16 years 3 months ago
2009
ACM
The TaskTracer system allows knowledge workers to define a set of activities that characterize their desktop work. It then associates with each user-defined activity the set of ...
194
click to vote
PODC
2003
ACM
16 years 4 days ago
2003
ACM
We investigate issues related to the probe complexity of quorum systems and their implementation in a dynamic environment. Our contribution is twofold. The first regards the algo...
169
Voted
SPAA
2003
ACM
16 years 3 days ago
2003
ACM
We develop an algorithm for parallel disk sorting, whose I/O cost approaches the lower bound and that guarantees almost perfect overlap between I/O and computation. Previous algor...
180
click to vote
IPPS
2000
IEEE
15 years 11 months ago
2000
IEEE
In this paper, we study the problem of on demand minimum length packet scheduling in single-hop multichannel systems. Examples of these systems are those centered around switching...