3415 search results - page 254 / 683 » Lower bounds on kernelization |
193
click to vote
FOCS
2006
IEEE
16 years 22 days ago
2006
IEEE
How much can randomness help computation? Motivated by this general question and by volume computation, one of the few instances where randomness provably helps, we analyze a noti...
195
click to vote
ISPAN
2005
IEEE
16 years 8 days ago
2005
IEEE
We define a family of Distributed Hash Table systems whose aim is to combine routing efficiency of the randomized networks — i.e. average path length O(log n/ log log n) vs. t...
186
click to vote
WIOPT
2005
IEEE
16 years 7 days ago
2005
IEEE
In this paper we consider the problem of searching for a node or an object (i.e., piece of data, file, etc.) in a large wireless network. We consider the class of controlled flo...
157
click to vote
COCOON
2005
Springer
16 years 6 days ago
2005
Springer
Abstract. We investigate the online exploration problem of a shortsighted mobile robot moving in an unknown cellular room without obstacles. The robot has a very limited sensor; it...
157
Voted
SIGECOM
2004
ACM
16 years 3 days ago
2004
ACM
For the problem of online real-time scheduling of jobs on a single processor, previous work presents matching upper and lower bounds on the competitive ratio that can be achieved ...