Pages that link to "Item:Q4252268"
From MaRDI portal
The following pages link to Page replacement for general caching problems (Q4252268):
Displaying 33 items.
- (\(1+\varepsilon \))-competitive algorithm for online OVSF code assignment with resource augmentation (Q386436) (← links)
- Shape rectangularization problems in intensity-modulated radiation therapy (Q534786) (← links)
- Caching is hard -- even in the fault model (Q692624) (← links)
- A universal online caching algorithm based on pattern matching (Q848635) (← links)
- The tool switching problem revisited (Q881565) (← links)
- A simple proof of optimality for the MIN cache replacement policy (Q894469) (← links)
- Resource augmented semi-online bounded space bin packing (Q967321) (← links)
- Dynamic programming based algorithms for set multicover and multiset multicover problems (Q974740) (← links)
- Caching documents with variable sizes and fetching costs: an LP-based approach (Q1348944) (← links)
- A unified analysis of paging and caching (Q1386377) (← links)
- Applying extra-resource analysis to load balancing. (Q1588056) (← links)
- On-line file caching (Q1601028) (← links)
- Page replacement with multi-size pages and applications to web caching (Q1601029) (← links)
- Combining request scheduling with web caching (Q1887085) (← links)
- Competitive caching of query results in search engines (Q1887088) (← links)
- Flexible resource allocation to interval jobs (Q1999968) (← links)
- Paging with request sets (Q2272199) (← links)
- Online file caching with rejection penalties (Q2346958) (← links)
- Fast primal-dual distributed algorithms for scheduling and matching problems (Q2377143) (← links)
- Optimizing bandwidth allocation in elastic optical networks with application to scheduling (Q2407946) (← links)
- General caching is hard: even with small pages (Q2408914) (← links)
- Calculating lower bounds for caching problems (Q2460920) (← links)
- Approximations for generalized unsplittable flow on paths with application to power systems optimization (Q2678593) (← links)
- Fixed-parameter algorithms for unsplittable flow cover (Q2701069) (← links)
- Web caching using access statistics (Q2768320) (← links)
- Minimizing Cache Usage in Paging (Q2848921) (← links)
- Randomized competitive algorithms for generalized caching (Q2903523) (← links)
- On Variants of File Caching (Q3012805) (← links)
- Nearly Optimal Competitive Online Replacement Policies (Q4385163) (← links)
- (Q4527039) (← links)
- (Q5743509) (← links)
- New results on web caching with request reordering (Q5961978) (← links)
- Integer optimization models and algorithms for the multi-period non-shareable resource allocation problem (Q6572832) (← links)
