Pages that link to "Item:Q814917"
From MaRDI portal
The following pages link to Efficient update strategies for geometric computing with uncertainty (Q814917):
Displaying 19 items.
- The update complexity of selection and related problems (Q315536) (← links)
- Preprocessing imprecise points for Delaunay triangulation: simplified and extended (Q644800) (← links)
- Scheduling with testing on multiple identical parallel machines (Q832831) (← links)
- Query-competitive algorithms for cheapest set problems under uncertainty (Q899309) (← links)
- Scheduling with a processing time oracle (Q2109845) (← links)
- Explorable uncertainty in scheduling with non-uniform testing times (Q2117694) (← links)
- Optimal path discovery problem with homogeneous knowledge (Q2300623) (← links)
- Convex hulls under uncertainty (Q2408916) (← links)
- Query-competitive sorting with uncertainty (Q2663045) (← links)
- Round-competitive algorithms for uncertainty problems with parallel queries (Q2684483) (← links)
- Minimizing co-location potential of moving entities (Q2829447) (← links)
- Verification Problem of Maximal Points under Uncertainty (Q2870019) (← links)
- Delaunay Triangulation of Imprecise Points Simplified and Extended (Q3183447) (← 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)
- Query minimization under stochastic uncertainty (Q5925528) (← links)
- Approximation Algorithms for Multiprocessor Scheduling with Testing to Minimize the Total Job Completion Time (Q6492085) (← links)
- Minimizing the size of the uncertainty regions for centers of moving entities (Q6547939) (← links)
