scientific article; zbMATH DE number 1951564
From MaRDI portal
Publication:4413802
zbMath1023.68103MaRDI QIDQ4413802
Publication date: 21 July 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2598/25980264.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Artificial intelligence for robotics (68T40)
Related Items
Further connections between contract-scheduling and ray-searching problems ⋮ Weighted online search ⋮ Search Games: A Review ⋮ Online search with a hint ⋮ Online algorithms for searching and exploration in the plane ⋮ Multi-target ray searching problems ⋮ Lower bounds for searching robots, some faulty ⋮ The expanding search ratio of a graph ⋮ Infinite linear programming and online searching with turn cost ⋮ Wireless evacuation on \(m\) rays with \(k\) searchers
