The following pages link to Searching in the plane (Q690242):
Displaying 50 items.
- Search for the wreckage of Air France Flight AF 447 (Q254380) (← links)
- Convergecast and broadcast by power-aware mobile agents (Q261352) (← links)
- Optimal search for parameters in Monte Carlo simulation for derivative pricing (Q321025) (← links)
- Learning heuristic functions for large state spaces (Q420796) (← links)
- Searching for an axis-parallel shoreline (Q443717) (← links)
- Online algorithms for searching and exploration in the plane (Q465662) (← links)
- A randomized \(O(\log^2k)\)-competitive algorithm for metric bipartite matching (Q476428) (← links)
- Infinite linear programming and online searching with turn cost (Q515543) (← links)
- Agent search in uniform b-ary trees: Multiple goals and unequal costs (Q671265) (← links)
- A competitive analysis of algorithms for searching unknown scenes (Q685600) (← links)
- On-line path planning in an unknown polygonal environment (Q707338) (← links)
- An improved online evacuation strategy from a convex region on grid networks (Q724733) (← links)
- On the approximation of shortest escape paths (Q827333) (← links)
- Bike assisted evacuation on a line (Q831791) (← links)
- Scheduling search procedures: The wheel of fortune (Q880568) (← links)
- Strategies for parallel unaware cleaners (Q896136) (← links)
- The beachcombers' problem: walking and searching with mobile robots (Q896140) (← links)
- How many ants does it take to find the food? (Q896147) (← links)
- Optimal online-list batch scheduling (Q990939) (← links)
- Classifying the multi robot path finding problem into a quadratic competitive complexity class (Q1022454) (← links)
- Ranking hypotheses to minimize the search cost in probabilistic inference models (Q1025988) (← links)
- How to find a point on a line within a fixed distance (Q1289022) (← links)
- An improved approximation ratio for the minimum latency problem (Q1290636) (← links)
- Autonomous search for mines (Q1296038) (← links)
- Agent searching in a tree and the optimality of iterative deepening (Q1341670) (← links)
- Searching with mobile agents in networks with liars. (Q1422406) (← links)
- Flood search under the California split rule. (Q1426720) (← links)
- Searching and on-line recognition of star-shaped polygons. (Q1427863) (← links)
- A general framework for searching on a line (Q1676358) (← links)
- Evacuating two robots from multiple unknown exits in a circle (Q1686109) (← links)
- Online buffer management for transmitting packets with processing cycles (Q1708032) (← links)
- The expanding search ratio of a graph (Q1741496) (← links)
- Linear search by a pair of distinct-speed robots (Q1755792) (← links)
- Online matching on a line (Q1770389) (← links)
- Reaching a target in the plane with no information (Q1799599) (← links)
- Optimal robot localization in trees (Q1854481) (← links)
- The power of a pebble: Exploring and mapping directed graphs (Q1854539) (← links)
- A correction to: ``Agent searching in a tree and the optimality of iterative deepening'' (Q1855235) (← links)
- On-line parallel heuristics, processor scheduling and robot searching under the competitive framework (Q1884992) (← links)
- Competitive online routing in geometric graphs (Q1887089) (← links)
- The weighted 2-server problem (Q1887090) (← links)
- Parallel searching in the plane (Q1903637) (← links)
- Competitive distributed decision-making (Q1920425) (← links)
- Online graph exploration: New results on old and new algorithms (Q1929219) (← links)
- Lower bounds for searching robots, some faulty (Q1981629) (← links)
- Search on a line with faulty robots (Q2010608) (← links)
- Advice complexity of treasure hunt in geometric terrains (Q2051769) (← links)
- Weighted group search on a line \& implications to the priority evacuation problem (Q2098167) (← links)
- Graph exploration by energy-sharing mobile agents (Q2117723) (← links)
- Pebble guided near optimal treasure hunt in anonymous graphs (Q2117728) (← links)
