A competitive analysis of nearest neighbor based algorithms for searching unknown scenes (Q5096778): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3796804 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Navigating in Unfamiliar Geometric Terrain / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3138958 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A competitive analysis of algorithms for searching unknown scenes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Lower Bounds for Randomized <i>k</i>-Server and Motion-Planning Algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An Analysis of Several Heuristics for the Traveling Salesman Problem / rank | |||
Normal rank |
Latest revision as of 21:43, 29 July 2024
scientific article; zbMATH DE number 7573027
Language | Label | Description | Also known as |
---|---|---|---|
English | A competitive analysis of nearest neighbor based algorithms for searching unknown scenes |
scientific article; zbMATH DE number 7573027 |
Statements
A competitive analysis of nearest neighbor based algorithms for searching unknown scenes (English)
0 references
18 August 2022
0 references