Pages that link to "Item:Q899309"

The following pages link to Query-competitive algorithms for cheapest set problems under uncertainty (Q899309):

Displaying 11 items.

• Online makespan minimization with budgeted uncertainty (Q832833) (← links)
• Scheduling with a processing time oracle (Q2109845) (← links)
• A robust optimization approach with probe-able uncertainty (Q2239954) (← links)
• Optimal path discovery problem with homogeneous knowledge (Q2300623) (← links)
• Query-competitive sorting with uncertainty (Q2663045) (← links)
• Round-competitive algorithms for uncertainty problems with parallel queries (Q2684483) (← links)
• Algorithms for Queryable Uncertainty (Q4632163) (← links)
• The Minimum Cost Query Problem on Matroids with Uncertainty Areas. (Q5091242) (← links)
• Query-Competitive Sorting with Uncertainty. (Q5092365) (← links)
• Randomization Helps Computing a Minimum Spanning Tree under Uncertainty (Q5283242) (← links)
• Query minimization under stochastic uncertainty (Q5925528) (← links)