Pages that link to "Item:Q675058"

The following pages link to Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem (Q675058):

Displaying 50 items.

• Online algorithms for searching and exploration in the plane (Q465662) (← links)
• Infinite linear programming and online searching with turn cost (Q515543) (← links)
• Incremental facility location problem and its competitive algorithms (Q604759) (← links)
• Bike assisted evacuation on a line (Q831791) (← links)
• Scheduling search procedures: The wheel of fortune (Q880568) (← links)
• The beachcombers' problem: walking and searching with mobile robots (Q896140) (← links)
• Online minimization knapsack problem (Q897874) (← links)
• On the two-dimensional cow search problem (Q987818) (← links)
• Ranking hypotheses to minimize the search cost in probabilistic inference models (Q1025988) (← links)
• Flood search under the California split rule. (Q1426720) (← links)
• New algorithms for related machines with temporary jobs. (Q1588054) (← links)
• Event-driven optimal control for a robotic exploration, pick-up and delivery problem (Q1730345) (← links)
• The expanding search ratio of a graph (Q1741496) (← links)
• How unsplittable-flow-covering helps scheduling with job-dependent cost functions (Q1751090) (← links)
• Linear search by a pair of distinct-speed robots (Q1755792) (← links)
• Lower bounds for searching robots, some faulty (Q1981629) (← links)
• Weighted group search on a line \& implications to the priority evacuation problem (Q2098167) (← links)
• Pebble guided near optimal treasure hunt in anonymous graphs (Q2117728) (← links)
• Further connections between contract-scheduling and ray-searching problems (Q2142675) (← links)
• Evacuating from \(\ell_p\) unit disks in the wireless model (extended abstract) (Q2148885) (← links)
• Deterministic treasure hunt in the plane with angular hints (Q2205634) (← links)
• Treasure evacuation with one robot on a disk (Q2220826) (← links)
• Searching for a non-adversarial, uncooperative agent on a cycle (Q2285151) (← links)
• Greedy metric minimum online matchings with random arrivals (Q2294274) (← links)
• Rendezvous in planar environments with obstacles and unknown initial distance (Q2321296) (← links)
• Multi-processor search and scheduling problems with setup cost (Q2398209) (← links)
• The ANTS problem (Q2401118) (← links)
• A \(o(n)\)-competitive deterministic algorithm for online matching on a line (Q2415368) (← links)
• Multi-target ray searching problems (Q2453158) (← links)
• Incremental medians via online bidding (Q2482726) (← links)
• Online searching with turn cost (Q2503358) (← links)
• Online search for a hyperplane in high-dimensional Euclidean space (Q2671802) (← links)
• Pebble guided optimal treasure hunt in anonymous graphs (Q2672573) (← links)
• Evacuating from \(\ell_p\) unit disks in the wireless model (Q2680178) (← links)
• Search Games: A Review (Q2961390) (← links)
• Better Upper Bounds for Searching on a Line with Byzantine Robots (Q3297827) (← links)
• A $$o(n)$$-Competitive Deterministic Algorithm for Online Matching on a Line (Q3453279) (← links)
• Treasure Hunt with Advice (Q3460725) (← links)
• (Q5090453) (← links)
• (Q5091040) (← 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)
• Best-of-both-worlds analysis of online search (Q6066770) (← links)
• Impact of knowledge on the cost of treasure hunt in trees (Q6087562) (← links)
• Weighted online search (Q6133641) (← links)
• A nearly tight lower bound for the \(d\)-dimensional cow-path problem (Q6161449) (← links)
• Optimal circle search despite the presence of faulty robots (Q6161451) (← links)
• Extreme statistics of superdiffusive Lévy flights and every other Lévy subordinate Brownian motion (Q6166003) (← links)
• Algorithms for \(p\)-Faulty Search on a half-line (Q6174824) (← links)