Sciweavers

2814 search results - page 5 / 563
» Competitive Analysis of Distributed Algorithms
Sort
View
ISAAC
2000
Springer
113views Algorithms» more  ISAAC 2000»
14 years 4 days ago
A New Competitive Analysis of Randomized Caching
Ching Law, Charles E. Leiserson
INFOCOM
2000
IEEE
14 years 29 days ago
Efficient Handoff Rerouting Algorithms: A Competitive On-Line Algorithmic Approach
—This paper considers the design of handoff rerouting algorithms for reducing the overall session cost in personal communication systems (PCS). Most modern communication systems ...
Yigal Bejerano, Israel Cidon, Joseph Naor
ESA
2008
Springer
80views Algorithms» more  ESA 2008»
13 years 10 months ago
Randomized Competitive Analysis for Two-Server Problems
We prove that there exits a randomized online algorithm for the 2-server 3-point problem whose
Wolfgang W. Bein, Kazuo Iwama, Jun Kawahara
HCW
1998
IEEE
14 years 25 days ago
Dynamic, Competitive Scheduling of Multiple DAGs in a Distributed Heterogeneous Environment
With the advent of large scale heterogeneous environments, there is a need for matching and scheduling algorithms which can allow multiple DAG-structured applications to share the...
Michael A. Iverson, Füsun Özgüner
DSD
2008
IEEE
166views Hardware» more  DSD 2008»
14 years 3 months ago
Pearson - based Analysis of Positioning Error Distribution in Wireless Sensor Networks
Abstract—In two recent contributions [1], [2], we have provided a comparative analysis of various optimization algorithms, which can be used for atomic location estimation, and s...
Stefano Tennina, Marco Di Renzo, Fabio Graziosi, F...