793 search results - page 1 / 159 » Optimal Projective Algorithms for the List Update Problem |
ICALP
2000
Springer
15 years 2 months ago
2000
Springer
The list update problem is a classical online problem, with an optimal competi
ALGORITHMICA
1998
14 years 10 months ago
1998
We consider the problem of dynamic reorganization of a linear list, where requests for the elements are generated randomly with fixed, unknown probabilities. The objective is to ...
MFCS
1994
Springer
15 years 2 months ago
1994
Springer
We consider the question of lookahead in the list update problem: What improvement can be achieved in terms of competitiveness if an on-line algorithm sees not only the present re...
63
Voted
ALGORITHMICA
1998
14 years 10 months ago
1998
We study the performance of the Timestamp(0) (TS(0)) algorithm for self-organizing sequential search on discrete memoryless sources. We demonstrate that TS(0) is better than Move-...
CDC
2010
IEEE
14 years 5 months ago
2010
IEEE
In this paper we study the constrained consensus problem, i.e. the problem of reaching a common point from the estimates generated by multiple agents that are constrained to lie in...