2924 search results - page 159 / 585 » Lower Bounds in Distributed Computing |
128
click to vote
ICALP
2011
Springer
14 years 4 months ago
2011
Springer
Competitive analysis is the established tool for measuring the output quality of algorithms that work in an online environment. Recently, the model of advice complexity has been in...
123
Voted
EUC
2007
Springer
15 years 7 months ago
2007
Springer
Networked embedded systems present unique challenges for system designers composing distributed applications with dyanmic, real-time, and resilience requirements. We consider the ...
105
Voted
ESORICS
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. Many theoretical PIR (Private Information Retrieval) constructions have been proposed in the past years. Though information theoretically secure, most of them are impract...
127
Voted
CDC
2010
IEEE
14 years 7 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...
101
Voted
DCC
2008
IEEE
16 years 11 days ago
2008
IEEE
We present improved lower bounds on the sizes of small maximal partial ovoids in the classical hermitian polar spaces, and improved upper bounds on the sizes of large maximal part...