VOSS
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Randomization is of paramount importance in practical applications and randomized algorithms are used widely, for example in co-ordinating distributed computer networks, ...
COCO
2009
Springer
13 years 11 months ago
2009
Springer
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...
INFOCOM
2009
IEEE
13 years 11 months ago
2009
IEEE
—We study the distributed desynchronization problem for graphs with arbitrary topology. Motivated by the severe computational limitations of sensor networks, we present a randomi...
ICRA
2009
IEEE
13 years 11 months ago
2009
IEEE
— We suggest a new navigation approach to mobile robots, within a nonlinear model predictive control framework where a navigation function is used as a control Lyapunov function....
Lecture Notes
"This is a standard senior-level algorithms class required of every computer science undergraduate and graduate student at the University of Illinois."