2084 search results - page 300 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
145
click to vote
CDC
2010
IEEE
14 years 9 months ago
2010
IEEE
Abstract-- In this paper we consider the problem of monitoring a known set of stationary features (or locations of interest) in an environment. To observe a feature, a robot must v...
124
Voted
FOCS
1999
IEEE
15 years 6 months ago
1999
IEEE
This paper connects two fundamental ideas from theoretical computer science: hard-core set construction, a type of hardness amplification from computational complexity, and boosti...
121
Voted
UAI
2003
15 years 3 months ago
2003
This paper introduces improved methodology to triangulate dynamic graphical models and dynamic Bayesian networks (DBNs). In this approach, a standard DBN template can be modified...
109
click to vote
WADS
2007
Springer
15 years 8 months ago
2007
Springer
In the faulty-memory RAM model, the content of memory cells can get corrupted at any time during the execution of an algorithm, and a constant number of uncorruptible registers are...
122
click to vote
COMCOM
2004
15 years 2 months ago
2004
In the emerging high-speed packet-switched networks, fair packet scheduling algorithms in switches and routers will form an important component of the mechanisms that seek to sati...