scientific article; zbMATH DE number 1232130
From MaRDI portal
Publication:4223058
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of computing (68Q99) Nonnumerical algorithms (68W05) Markov and semi-Markov decision processes (90C40) Applications of game theory (91A80) Portfolio theory (91G10)
Recommendations
Cited in
(only showing first 100 items - show all)- Dynamic TCP acknowledgment with sliding window
- Data aggregation in sensor networks: Balancing communication and delay costs
- On dynamic bin packing: An improved lower bound and resource augmentation analysis
- Online scheduling on two uniform machines to minimize the makespan
- A survey on metaheuristics for stochastic combinatorial optimization
- New lower and upper bounds for the competitive ratio of transmission protocols
- A note on online strip packing
- Online interval scheduling: Randomized and multiprocessor cases
- Online search with time-varying price bounds
- Online scheduling to minimize modified total tardiness with an availability constraint
- The Canadian Traveller Problem and its competitive analysis
- Two-stage flexible-choice problems under uncertainty
- An optimal online algorithm for single machine scheduling with bounded delivery times
- On-line integrated production-distribution scheduling problems with capacitated deliveries
- Optimal algorithms for page migration in dynamic networks
- A tight lower bound for job scheduling with cancellation
- Online algorithms. The state of the art
- Competitive video on demand schedulers for popular movies
- More on randomized on-line algorithms for caching.
- News from the online traveling repairman.
- On-line stream merging in a general setting.
- Nearly optimal strategies for special cases of on-line capital investment.
- Optimal aggregation algorithms for middleware.
- Connection caching: Model and algorithms.
- Preemptive scheduling in overloaded systems.
- Dynamic spectrum allocation: the impotency of duration notification.
- Minmax regret solutions for minimax optimization problems with uncertainty
- Stack-up algorithms for palletizing at delivery industry
- On-line scheduling revisited
- On-line and off-line preemptive two-machine job shop scheduling
- The power of \(\alpha\)-points in preemptive single machine scheduling.
- On-line scheduling with precedence constraints
- Trackless online algorithms for the server problem
- Limited bookmark randomized online algorithms for the paging problem
- Online strategies for backups
- Randomized algorithms for on-line scheduling problems: How low can't you go?
- Online-bounded analysis
- Minimum cost perfect matching with delays for two sources
- Competitive analysis of online revenue management with hierarchical resources
- Evaluating the quality of online optimization algorithms by discrete event simulation
- Online algorithms with advice for the dual bin packing problem
- Online spatio-temporal matching in stochastic and dynamic domains
- Online scheduling problems with flexible release dates: applications to infrastructure restoration
- The Steiner traveling salesman problem with online advanced edge blockages
- Dynamic bin packing with unit fraction items revisited
- On the additive constant of the k-server work function algorithm
- A primal-dual online algorithm for the k-server problem on weighted HSTs
- Improved lower bounds for online scheduling to minimize total stretch
- Time traps in supply chains: is optimal still good enough?
- Automated competitive analysis of real-time scheduling with graph games
- Online edge coloring of paths and trees with a fixed number of colors
- Scheduling on parallel identical machines with late work criterion: offline and online cases
- Online interval scheduling with a bounded number of failures
- A risk-reward model with compound interest rate for non-additive two-option ski rental
- A unified framework for stochastic optimization
- Online in-time service problem with minimal server assignment
- The \(k\)-server problem with advice in \(d\) dimensions and on the sphere
- Online dominating set
- Tight bounds for double coverage against weak adversaries
- An algorithm with performance guarantee for the online container relocation problem
- Competitive algorithms for multistage online scheduling
- The \(k\)-resource problem in uniform metric spaces
- Online matching on a line
- A tighter extra-resource analysis of online deadline scheduling
- Analysis of adaptive cost functions for dynamic update policies for QoS routing in hierarchical networks
- Priority algorithms for makespan minimization in the subset model.
- More on random walks, electrical networks, and the harmonic \(k\)-server algorithm.
- Off-line temporary tasks assignment.
- The 3-server problem in the plane.
- Two short notes on the on-line travelling salesman: handling times and lookahead.
- On randomization in on-line computation.
- Delayed information and action in on-line algorithms
- Online variable sized covering
- A general decomposition theorem for the k-server problem
- The Bancomat problem: An example of resource allocation in a partitionable asynchronous system
- Call control with \(k\) rejections
- Average stretch without migration
- Online scheduling with partial job values: does timesharing or randomization help?
- Improved competitive algorithms for online scheduling with partial job values
- Competitive analysis of incentive compatible on-line auctions
- Online storage systems and transportation problems with applications. Optimization models and mathematical solutions.
- Harmonic buffer management policy for shared memory switches
- New results for online page replication
- Competitive caching of query results in search engines
- Competitive online routing in geometric graphs
- The weighted 2-server problem
- On the competitive ratio of the work function algorithm for the k-server problem
- The CNN problem and other k-server variants
- Online graph exploration: New results on old and new algorithms
- Online clustering with variable sized clusters
- A risk-reward model for the on-line leasing of depreciable equipment
- Ronald Graham: laying the foundations of online optimization
- List factoring and relative worst order analysis
- Online parallel machine scheduling to maximize the number of early jobs
- Online stochastic optimization under time constraints
- Online node- and edge-deletion problems with advice
- On the advice complexity of the online dominating set problem
- A universal randomized packet scheduling algorithm
- Punctual definability on structures
- Relative utility bounds for empirically optimal portfolios
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4223058)
