Searching in an unknown environment: an optimal randomized algorithm for the cow-path problem
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Optimal constructions of hybrid algorithms
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
Journal of the ACM (JACM)
Lower bounds in on-line geometric searching
Computational Geometry: Theory and Applications
Online Parallel Heuristics and Robot Searching under the Competitive Framework
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Real-Time Problem-Solving with Contract Algorithms
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Scheduling contract algorithms on multiple processors
Eighteenth national conference on Artificial intelligence
Contract algorithms and robots on rays: unifying two scheduling problems
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Optimal scheduling of contract algorithms with soft deadlines
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
Interruptible algorithms for multi-problem solving
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
| Hi-index | 0.00 |
A contract algorithm is an algorithm which is given, as part of the input, a specified amount of allowable computation time. The algorithm must then compute a solution within the alloted time. An interruptible algorithm, in contrast, can be interrupted at an arbitrary point in time and must produce a solution. It is known that contract algorithms can simulate interruptible algorithms using iterative deepening techniques. This simulation is done at a penalty in the performance of the solution, as measured by the so-called acceleration ratio. In this paper we give matching (i.e. optimal) upper and lower bounds for the acceleration ratio under this simulation. This resolves an open conjecture of Bernstein et al. [IJCAI 2003] who gave an ingenious optimal schedule under the restricted setting of round robin and length-increasing processor schedules, but whose optimality in the general unrestricted case remained open.