2084 search results - page 309 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
ALT
1999
Springer
15 years 2 months ago
1999
Springer
We introduce a new model for learning in the presence of noise, which we call the Nasty Noise model. This model generalizes previously considered models of learning with noise. Th...
ALGORITHMICA
2004
14 years 9 months ago
2004
We consider the problem of scheduling dynamically arriving jobs in a non-clairvoyant setting, that is, when the size of a job in remains unknown until the job finishes execution. ...
ICNP
2009
IEEE
14 years 7 months ago
2009
IEEE
Abstract--Recent technological advances have motivated largescale deployment of RFID systems. RFID readers are often static and carefully deployed in a planned manner. However, the...
SIROCCO
2007
14 years 11 months ago
2007
We consider the problem of periodic exploration of all nodes in undirected graphs by using a nite state automaton called later a robot. The robot, using a constant number of state...
101
click to vote
SODA
2003
ACM
14 years 11 months ago
2003
ACM
The natural relaxation for the Group Steiner Tree problem, as well as for its generalization, the Directed Steiner Tree problem, is a flow-based linear programming relaxation. We...