Pages that link to "Item:Q2543566"
From MaRDI portal
The following pages link to Yet more on the linear search problem (Q2543566):
Displayed 32 items.
- Online algorithms for searching and exploration in the plane (Q465662) (← links)
- Infinite linear programming and online searching with turn cost (Q515543) (← links)
- Multiplicative linear search for a Brownian target motion (Q646171) (← links)
- Optimal multiplicative generalized linear search plan for a discrete random walker (Q896731) (← links)
- Search for an immobile entity on a network (Q933506) (← links)
- Network search games with immobile hider, without a designated searcher starting point (Q933761) (← links)
- Optimal search paths for random variables (Q1053598) (← links)
- The linear search problem rides again (Q1084757) (← links)
- Hide and seek in a subset of the real line (Q1244177) (← links)
- Star search -- a different show (Q1261911) (← links)
- New algorithms for related machines with temporary jobs. (Q1588054) (← links)
- The expanding search ratio of a graph (Q1741496) (← links)
- Generalizations in the linear search problem (Q1895083) (← links)
- Searching for multiple objects in multiple locations (Q1999403) (← links)
- Search on a line with faulty robots (Q2010608) (← links)
- Competitive search in a network (Q2184175) (← links)
- Son of the linear search problem (Q2266666) (← links)
- Search for an immobile hider on a stochastic network (Q2286995) (← links)
- Rendezvous in planar environments with obstacles and unknown initial distance (Q2321296) (← links)
- Multi-processor search and scheduling problems with setup cost (Q2398209) (← links)
- Multi-target ray searching problems (Q2453158) (← links)
- Online searching with turn cost (Q2503358) (← links)
- A general search game (Q2558250) (← links)
- Search Games: A Review (Q2961390) (← links)
- Better Upper Bounds for Searching on a Line with Byzantine Robots (Q3297827) (← links)
- Rendezvous search when marks are left at the starting points (Q4330236) (← links)
- LOWER BOUNDS FOR STREETS AND GENERALIZED STREETS (Q4682162) (← links)
- On the minimality of search paths under absolutely continuous univariate distributions (Q4735029) (← links)
- Searching for the Random Walking microorganism cells (Q5193353) (← links)
- Collaboration Without Communication: Evacuating Two Robots from a Disk (Q5283360) (← links)
- Wireless evacuation on \(m\) rays with \(k\) searchers (Q5919422) (← links)
- Lower bounds in on-line geometric searching (Q5931368) (← links)