Online searching

Operations Research

Volumn 49, Issue 4, 2001, Pages 501-515

  Jaillet, Patrick ^b   Stafford, Matthew ^b  

^a The University of Texas at Austin   (United States)

^b NONE

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; MARKOV PROCESSES; OPERATIONS RESEARCH; PROBABILISTIC LOGICS;

MARKOV DECISION PROCESSES;

ONLINE SEARCHING;

EID: 0034751527     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.49.4.501.11227     Document Type: Article

References (18)

1. Competitive online algorithms, overview
2. Combinatorial online optimization in practice
3. Searching in the plane
4. A minimization problem
5. An optimal on-line algorithm for metrical task systems
6. An alternative solution to the 'lost at sea' problem
7. The minimax path in a search for a circle in the plane
8. Minimal length curves that are not embeddable in an open planar set: The problem of a lost swimmer with a compass
9. An optimal search pattern
10. Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem
11. Competitive snoopy caching
12. Competitive algorithms for on-line problems
13. Shortest paths without a map
14. Amortized efficiency of list update and paging rules