scientific article
From MaRDI portal
Publication:2913809
DOI10.4086/toc.2012.v008a002zbMath1253.68068OpenAlexW4253784538MaRDI QIDQ2913809
No author found.
Publication date: 27 September 2012
Published in: Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4086/toc.2012.v008a002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27)
Related Items (6)
Energy-Efficient Algorithms for Non-preemptive Speed-Scaling ⋮ Mechanism design for aggregating energy consumption and quality of service in speed scaling scheduling ⋮ Scheduling under dynamic speed-scaling for minimizing weighted completion time and energy consumption ⋮ A fully polynomial-time approximation scheme for speed scaling with a sleep state ⋮ Race to idle ⋮ On multi-processor speed scaling with migration
This page was built for publication:
