On-line parallel heuristics, processor scheduling and robot searching under the competitive framework
From MaRDI portal
Publication:1884992
DOI10.1016/j.tcs.2003.08.001zbMath1070.68134OpenAlexW2051092461MaRDI QIDQ1884992
Alejandro López-Ortiz, Sven Schuierer
Publication date: 27 October 2004
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2003.08.001
Searching and sorting (68P10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Machine vision and scene understanding (68T45) Artificial intelligence for robotics (68T40)
Related Items
Online makespan minimization with parallel schedules ⋮ Further connections between contract-scheduling and ray-searching problems ⋮ Multi-processor search and scheduling problems with setup cost ⋮ Competitive search in a network ⋮ Best-of-both-worlds analysis of online search ⋮ Weighted online search ⋮ Search Games: A Review ⋮ Online search with a hint ⋮ Parallel online algorithms for the bin packing problem ⋮ Online algorithms for searching and exploration in the plane ⋮ Multi-target ray searching problems ⋮ The expanding search ratio of a graph ⋮ Infinite linear programming and online searching with turn cost ⋮ Unnamed Item ⋮ Wireless evacuation on \(m\) rays with \(k\) searchers ⋮ Ranking hypotheses to minimize the search cost in probabilistic inference models ⋮ Graph exploration by a finite automaton ⋮ Two-agent tree evacuation
Cites Work
- Searching in the plane
- Search games
- Walking an unknown street with bounded detour
- Parallel searching in the plane
- Generalized streets revisited
- Efficient strategies for robot navigation in unknown environment
- Lower bounds in on-line geometric searching
- The ultimate strategy to search on \(m\) rays?
- Unnamed Item
- Unnamed Item
- Unnamed Item
