Approximately locating an invisible agent in a graph with relative distance queries (Q1637147)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Approximately locating an invisible agent in a graph with relative distance queries |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximately locating an invisible agent in a graph with relative distance queries |
scientific article |
Statements
Approximately locating an invisible agent in a graph with relative distance queries (English)
0 references
7 June 2018
0 references
pursuit and evasion game
0 references
0.7681019902229309
0 references
0.7645151019096375
0 references
0.7575798630714417
0 references
0.756975531578064
0 references
0.7449514269828796
0 references
