The following pages link to (Q4252337):
Displaying 13 items.
- Decomposition algorithms for data placement problem based on Lagrangian relaxation and randomized rounding (Q490221) (← links)
- Serving content with unknown demand: the high-dimensional regime (Q747721) (← links)
- Online hierarchical cooperative caching (Q863196) (← links)
- Joint object placement and node dimensioning for internet content distribution (Q1029097) (← links)
- Mistreatment-resilient distributed caching (Q2372091) (← links)
- Cache placement in sensor networks under an update cost constraint (Q2466007) (← links)
- Placement algorithms for hierarchical cooperative caching (Q2709801) (← links)
- Bandwidth constrained placement in a WAN (Q2787675) (← links)
- Hierarchical Coded Caching (Q2976772) (← links)
- Allocating Objects in a Network of Caches: Centralized and Decentralized Analyses (Q3117773) (← links)
- Growing Half-Balls: Minimizing Storage and Communication Costs in Content Delivery Networks (Q4578010) (← links)
- The hardness of cache conscious data placement (Q5178901) (← links)
- A tight bound on approximating arbitrary metrics by tree metrics (Q5917578) (← links)
