Pages that link to "Item:Q675058"
From MaRDI portal
The following pages link to Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem (Q675058):
Displaying 16 items.
- Time-energy tradeoffs for evacuation by two robots in the wireless model (Q5919064) (← links)
- Online facility assignment (Q5919330) (← links)
- Wireless evacuation on \(m\) rays with \(k\) searchers (Q5919422) (← links)
- The ultimate strategy to search on \(m\) rays? (Q5941439) (← links)
- Best-of-both-worlds analysis of online search (Q6066770) (← links)
- Almost-Optimal Deterministic Treasure Hunt in Unweighted Graphs (Q6075758) (← 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)
- Online search with a hint (Q6186319) (← links)
- Evacuation of equilateral triangles by mobile agents of limited communication range (Q6536151) (← links)
- Optimal circle search despite the presence of faulty robots (Q6536163) (← links)
- Overcoming probabilistic faults in disoriented linear search (Q6614002) (← links)