Competitive snoopy caching
From MaRDI portal
Publication:1103391
Cited in
(only showing first 100 items - show all)- Bounds for scheduling jobs on grid processors
- Competitive strategy for on-line leasing of depreciable equipment
- The relative worst-order ratio applied to paging
- Preemptive multiprocessor scheduling with rejection
- Online edge coloring of paths and trees with a fixed number of colors
- Randomized competitive algorithms for the list update problem
- The advice complexity of a class of hard online problems
- The optimal structure of algorithms for \(\alpha\)-paging
- Scheduling jobs on grid processors
- Comparing online algorithms for bin packing problems
- Online bounded analysis
- Rent or buy problems with a fixed time horizon
- Online ordering policies for a two-product, multi-period stationary newsvendor problem
- Paging with connections: FIFO strikes again
- Optimal randomized algorithm for a generalized ski-rental with interest rate
- An improved lower bound for load balancing of tasks with unknown duration
- The working set algorithm has competitive ratio less than two
- An optimal online algorithm for scheduling two machines with release times
- On the Bahncard problem
- The maximum resource bin packing problem
- Ramsey-type theorems for metric spaces with applications to online problems
- On the best possible competitive ratio for the multislope ski-rental problem
- Paging more than one page
- Risk-reward models for on-line leasing of depreciable equipment
- On-line scheduling with hard deadlines
- Competitive randomized algorithms for nonuniform problems
- A theoretical comparison of LRU and LRU-K
- The Frequent Items Problem in Online Streaming Under Various Performance Measures
- Paging with request sets
- Online multi-coloring on the path revisited
- Ski rental with two general options
- \textsc{OnlineMin}: a fast strongly competitive randomized paging algorithm
- Outperforming LRU via competitive analysis on parametrized inputs for paging
- Probability-free solutions to the non-stationary newsvendor problem
- The work function algorithm for the paging problem
- Preemptive on-line scheduling for two uniform processors
- Competitive analysis of the online inventory problem
- Better bounds on online unit clustering
- Competitive analysis for online leasing problem with compound interest rate
- Weighted Online Problems with Advice
- MOCA: A multiprocessor on-line competitive algorithm for real-time system scheduling
- Measuring the problem-relevant information in input
- Online stochastic optimization under time constraints
- Clever or smart: strategies for the online target date assignment problem
- Weighted online problems with advice
- The CNN problem and other \(k\)-server variants
- Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost
- Randomized online interval scheduling
- Online Vehicle Routing Problems: A Survey
- Competitive algorithms for the weighted server problem
- Efficient offline algorithms for the bicriteria \(k\)-server problem and online applications
- On multi-threaded metrical task systems
- On-line algorithms for locating checkpoints
- More on weighted servers or FIFO is better than LRU.
- A new measure for the study of on-line algorithms
- Competitive \(k\)-server algorithms
- Online traveling salesman problem with deadlines and service flexibility
- Relative interval analysis of paging algorithms on access graphs
- The \(k\)-server problem
- Scheduling in the dark
- Online algorithms with advice: the tape model
- Online \(L(2,1)\)-coloring problem on paths with restricted size of memory
- Price fluctuations: to buy or to rent
- Uniform multipaging reduces to paging
- Comparing first-fit and next-fit for online edge coloring
- Online traveling salesman problems with service flexibility
- Stochastization of weighted automata
- List factoring and relative worst order analysis
- Online Bin Covering: Expectations vs. Guarantees
- On the power of randomization in on-line algorithms
- Online bin covering: expectations vs. guarantees
- On-line algorithms for 2-coloring hypergraphs via chip games
- Competitive distributed file allocation.
- Online Dual Edge Coloring of Paths and Trees
- Group parking permit problems
- Online paging and file caching with expiration times
- The fast algorithm for online \(k\)-server problem on trees
- Online search for a hyperplane in high-dimensional Euclidean space
- ON THE k-TRUCK SCHEDULING PROBLEM
- Online file caching with rejection penalties
- Online multi-coloring with advice
- The weighted list update problem and the lazy adversary
- An optimization-driven dynamic vehicle routing algorithm for on-demand meal delivery using drones
- Connection caching: Model and algorithms.
- Two-sided online bipartite matching and vertex cover: beating the greedy algorithm
- Exact distributional analysis of online algorithms with lookahead
- Methods for message routing in parallel machines
- Multi-priority online scheduling with cancellations
- On bin packing with clustering and bin packing with delays
- Engineering efficient paging algorithms
- Machine learning advised algorithms for the ski rental problem with a discount
- Quantum online streaming algorithms with logarithmic memory
- Optimal online edge coloring of planar graphs with advice
- Competitive distributed decision-making
- Applying ``peeling onion approach for competitive analysis in online scheduling with rejection
- Randomized strategies for non-additive 3-slope ski rental
- Tight bounds for restricted grid scheduling
- On multi-threaded Paging
- Online failure diagnosis in interdependent networks
- Online scheduling problems with flexible release dates: applications to infrastructure restoration
This page was built for publication: Competitive snoopy caching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1103391)
