Peter Damaschke  Home/Search
Context
Related
| cs.chalmers.se/~ptr/wheelj.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.chalmers.se/~ptr/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Suppose that a player can make progress on n jobs, and her goal is to complete a target job among them, as soon as possible. Unfortunately she does not know what the target job is, perhaps not even if the target exists. This is a typical situation in searching and testing. Depending on the player's prior knowledge and optimization goals, this gives rise to various optimization problems in the framework of game theory and, sometimes, competitive analysis. Continuing earlier work on this... (Update)
Active bibliography (related documents): More All
0.8: Scheduling Search Procedures - Damaschke (2004) (Correct)
0.5: Journal of Machine Learning Research 7 (2006).. - Probabilistic.. (Correct)
0.2: Server Scheduling in the L_p Norm: A Rising Tide Lifts All.. - Bansal, Pruhs (2003) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ damaschke-scheduling,
author = "Peter Damaschke",
title = "Scheduling Search Procedures: The Wheel of Fortune",
url = "citeseer.ist.psu.edu/740086.html" }
Citations (may not include all citations):280 Online Computation and Competitive Analysis (context) - Borodin, El-Yaniv - 1998
66 Beyond competitive analysis - Koutsoupias, Papadimitriou - 2000
35 Searching an unknown environment: an optimal randomized algo.. - Kao, Reif et al. - 1996
31 Information and Computation (context) - Baeza-Yates, Culberson et al. - 1993
25 Theoretical Computer Science (context) - Motwani, Phillips et al. - 1994
13 A survey of the search theory literature (context) - Benkoski, Monticino et al. - 1991
11 Preemptive scheduling in overloaded systems - Chrobak, Epstein et al. - 2002
6 Non-clairvoyant scheduling for minimizing mean slowdown (context) - Bansal, Dhamdhere et al. - 2003
6 The ultimate strategy to search on m rays (context) - opez-Ortiz, Schuierer - 1998
6 Game Theory: Analysis of Con ict (context) - Myerson - 1991
2 Online parallel heuristics and robot searching under the com.. (context) - opez-Ortiz, Schuierer - 2002
2 Scheduling search procedures - Damaschke - 2004
1 Division of War Research (context) - Koopman, screening et al. - 1946
1 Principles of search theory (context) - Frost - 1999
1 The theory of search: optimal distribution of search e ort (context) - Charnes, Cooper - 1958
1 the optimality of a simple strategy for searching graphs (context) - Gal - 2001
1 AAAI-97 Workshop on On-Line Search (context) - Kao, Littman et al. - 1997
1 Complexity of searching an immobile hider in a graph - Stengel, Werchner - 1997
1 Scheduling to minimize max ow time: Oine and online algorit.. (context) - Mastrolilli - 2003
1 ithms", 5th ACM-SIAM Symposium on Discrete Algorithms (context) - Kao, Ma et al. - 1994
1 Compatibility of Land SAR procedures with search theory (context) - Cooper, Frost et al. - 2003
Documents on the same site (http://www.cs.chalmers.se/~ptr/): More
Nearly Optimal Strategies for Special Cases of On-line Capital.. - Damaschke (Correct)
On Queuing Lengths in On-Line Switching - Damaschke, Zhou (Correct)
Randomized vs. Deterministic Distance Query Strategies for Point .. - Damaschke (2005) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC