The following pages link to Parallel searching in the plane (Q1903637):
Displaying 34 items.
- Parallel searching of multidimensional cubes (Q685702) (← links)
- Agent searching in a tree and the optimality of iterative deepening (Q1341670) (← links)
- Parallel searching in generalized Monge arrays (Q1386363) (← links)
- Evacuating two robots from multiple unknown exits in a circle (Q1686109) (← links)
- Linear search by a pair of distinct-speed robots (Q1755792) (← links)
- On-line parallel heuristics, processor scheduling and robot searching under the competitive framework (Q1884992) (← links)
- Search on a line with faulty robots (Q2010608) (← links)
- Makespan trade-offs for visiting triangle edges (extended abstract) (Q2115869) (← links)
- Graph exploration by energy-sharing mobile agents (Q2117723) (← links)
- Evacuating equilateral triangles and squares in the face-to-face model (Q2206722) (← links)
- Treasure evacuation with one robot on a disk (Q2220826) (← links)
- Priority evacuation from a disk: the case of \(n = 1,2,3\) (Q2285157) (← links)
- Group search of the plane with faulty robots (Q2326387) (← links)
- Energy-optimal broadcast and exploration in a tree using mobile agents (Q2330122) (← links)
- Optimal Distributed Searching in the Plane with and Without Uncertainty (Q2803811) (← links)
- Linear Search by a Pair of Distinct-Speed Robots (Q2835026) (← links)
- Communication Problems for Mobile Agents Exchanging Energy (Q2835031) (← links)
- Evacuating an Equilateral Triangle in the Face-to-Face Model (Q3300807) (← links)
- Treasure hunt with barely communicating agents (Q3300812) (← links)
- God save the queen (Q3305734) (← links)
- Piled-Slab Searches (Q3392053) (← links)
- Parallel line search (Q3407630) (← links)
- Energy-Optimal Broadcast in a Tree with Mobile Agents (Q5056056) (← links)
- Competitive Searching for a Line on a Line Arrangement. (Q5091041) (← links)
- Linear rendezvous with asymmetric clocks (Q5091103) (← links)
- Energy Consumption of Group Search on a Line (Q5092340) (← links)
- Exploration of High-Dimensional Grids by Finite Automata (Q5092342) (← links)
- Improved Lower Bounds for Shoreline Search (Q5100947) (← links)
- Wireless evacuation on \(m\) rays with \(k\) searchers (Q5919422) (← links)
- Parallel searching on \(m\) rays (Q5943313) (← links)
- A nearly tight lower bound for the \(d\)-dimensional cow-path problem (Q6161449) (← links)
- Exploration of High-Dimensional Grids by Finite State Machines (Q6492093) (← links)
- Competitive searching over terrains (Q6547937) (← links)
- Overcoming probabilistic faults in disoriented linear search (Q6614002) (← links)
