scientific article
From MaRDI portal
Publication:3977465
zbMath0796.68042MaRDI QIDQ3977465
No author found.
Publication date: 25 June 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
schedulingmotion planningpagingcaching\(k\)-server problemon-line problemscompetitive algorithmstask systemstwo headed disks
Graph theory (including graph drawing) in computer science (68R10) Deterministic scheduling theory in operations research (90B35) Parallel algorithms in computer science (68W10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (30)
Competitive algorithms for the weighted server problem ⋮ Serving Online Requests with Mobile Servers ⋮ An online trading problem with an increasing number of available products ⋮ Competitive distributed decision-making ⋮ The relative worst-order ratio applied to paging ⋮ A Technique to Obtain Hardness Results for Randomized Online Algorithms – A Survey ⋮ An approximation algorithm for stacking up bins from a conveyer onto pallets ⋮ A new strongly competitive group testing algorithm with small sequentiality ⋮ A comparison of performance measures for online algorithms ⋮ The \(k\)-server problem with advice in \(d\) dimensions and on the sphere ⋮ A randomized competitive group testing procedure ⋮ On the advice complexity of the \(k\)-server problem under sparse metrics ⋮ On-line resource management with applications to routing and scheduling ⋮ Amortized analysis of some disk scheduling algorithms: SSTF, SCAN, and \(N\)-step SCAN ⋮ Dynamic work hour optimization for casual workers ⋮ On convex body chasing ⋮ Metrical service systems with multiple servers ⋮ Competitive analysis for the on-line truck transportation problem ⋮ Scheduling in the dark ⋮ A new upper bound on the work function algorithm for the \(k\)-server problem ⋮ Online \(k\)-taxi via double coverage and time-reverse primal-dual ⋮ Online \(k\)-taxi via double coverage and time-reverse primal-dual ⋮ Stochastic dominance and the bijective ratio of online algorithms ⋮ Distributed near-optimal matching ⋮ A formula for incorporating weights into scoring rules ⋮ Competitive Algorithms for Layered Graph Traversal ⋮ Competitive group testing ⋮ Randomized competitive algorithms for the list update problem ⋮ A new measure for the study of on-line algorithms ⋮ A strongly competitive randomized paging algorithm
This page was built for publication:
