1068 search results - page 5 / 214 » On Space Bounded Server Algorithms |
ICALP
2011
Springer
12 years 11 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...
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
An experimental form of Modulation (Reinterpretation) of the Search Space is presented. This modulation is developed as a mathematical method that can be implemented directly into...
STOC
2006
ACM
14 years 7 months ago
2006
ACM
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
STACS
2000
Springer
13 years 11 months ago
2000
Springer
The k-server problem is one of the most fundamental online problems. The problem is to schedule k mobile servers to visit a sequence of points in a metric space with minimum total...
SIGCOMM
1996
ACM
13 years 11 months ago
1996
ACM
Hierarchical Packet Fair Queueing (H-PFQ)algorithms have the potential to simultaneously support guaranteed realtime service, rate-adaptive best-eort, and controlled linksharing s...