2084 search results - page 120 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
157
click to vote
INFOCOM
2000
IEEE
15 years 9 months ago
2000
IEEE
—This paper considers the design of handoff rerouting algorithms for reducing the overall session cost in personal communication systems (PCS). Most modern communication systems ...
132
click to vote
DSN
2007
IEEE
15 years 11 months ago
2007
IEEE
The success of sensor-driven applications is reliant on whether a steady stream of data can be provided by the underlying system. This need, however, poses great challenges to sen...
131
click to vote
GECCO
2007
Springer
15 years 11 months ago
2007
Springer
We analyze the performance of evolutionary algorithms on various matroid optimization problems that encompass a vast number of efficiently solvable as well as NP-hard combinatoria...
125
click to vote
ICDT
2005
ACM
15 years 10 months ago
2005
ACM
A common technique for improving performance for database query retrieval is to decluster the database among multiple disks so that retrievals can be parallelized. In this paper we...
166
click to vote
COLT
2001
Springer
15 years 9 months ago
2001
Springer
The Kushilevitz-Mansour (KM) algorithm is an algorithm that finds all the “large” Fourier coefficients of a Boolean function. It is the main tool for learning decision trees ...