Pages that link to "Item:Q1884992"

The following pages link to On-line parallel heuristics, processor scheduling and robot searching under the competitive framework (Q1884992):

Displaying 18 items.

• Online algorithms for searching and exploration in the plane (Q465662) (← links)
• Infinite linear programming and online searching with turn cost (Q515543) (← links)
• Ranking hypotheses to minimize the search cost in probabilistic inference models (Q1025988) (← links)
• The expanding search ratio of a graph (Q1741496) (← links)
• Two-agent tree evacuation (Q2117727) (← links)
• Further connections between contract-scheduling and ray-searching problems (Q2142675) (← links)
• Competitive search in a network (Q2184175) (← links)
• Online makespan minimization with parallel schedules (Q2362356) (← links)
• Multi-processor search and scheduling problems with setup cost (Q2398209) (← links)
• Multi-target ray searching problems (Q2453158) (← links)
• Graph exploration by a finite automaton (Q2575752) (← links)
• Parallel online algorithms for the bin packing problem (Q2700390) (← links)
• Search Games: A Review (Q2961390) (← links)
• (Q5090453) (← links)
• Wireless evacuation on \(m\) rays with \(k\) searchers (Q5919422) (← links)
• Best-of-both-worlds analysis of online search (Q6066770) (← links)
• Weighted online search (Q6133641) (← links)
• Online search with a hint (Q6186319) (← links)