The following pages link to (Q4228507):
Displaying 15 items.
- Static strategies for worksharing with unrecoverable interruptions (Q372951) (← links)
- Online maximum \(k\)-coverage (Q442204) (← links)
- Static worksharing strategies for heterogeneous computers with unrecoverable interruptions (Q645850) (← links)
- Competitive strategy for on-line leasing of depreciable equipment (Q646109) (← links)
- Optimizing the reliability of streaming applications under throughput constraints (Q656066) (← links)
- Atomic congestion games: fast, myopic and concurrent (Q987399) (← links)
- Competitive analysis of the online inventory problem (Q992666) (← links)
- Sharing video on demand (Q1399105) (← links)
- Scheduling multicasts on unit-capacity trees and meshes. (Q1401961) (← links)
- Delayed information and action in on-line algorithms (Q1854463) (← links)
- Online budgeted maximum coverage (Q1979466) (← links)
- Reliability of task graph schedules with transient and fail-stop failures: complexity and algorithms (Q2434302) (← links)
- Approximating the online set multicover problems via randomized winnowing (Q2481951) (← links)
- Randomized Online Algorithms for Set Cover Leasing Problems (Q2942379) (← links)
- (Q5874472) (← links)
