Optimal Online Algorithms on Two Hierarchical Machines With Resource Augmentation

Discrete Mathematics, Algorithms and Applications - Singapore
doi 10.1142/s1793830912500127
Full Text
Abstract

Available in full text

Date
Authors
Publisher

World Scientific Pub Co Pte Lt

Related search

Optimal On-Line Algorithms to Minimize Makespan on Two Machines With Resource Augmentation

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Online Bin Packing With Resource Augmentation

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Optimal Time-Critical Scheduling via Resource Augmentation

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
2002English

Lagrangian Duality in Online Scheduling With Resource Augmentation and Speed Scaling

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

The Hierarchical Model for Load Balancing on Two Machines

Journal of Combinatorial Optimization
ControlOptimizationCombinatoricsApplied MathematicsDiscrete MathematicsComputer Science ApplicationsMathematicsComputational Theory
2007English

Online Scheduling With a Buffer on Related Machines

Journal of Combinatorial Optimization
ControlOptimizationCombinatoricsApplied MathematicsDiscrete MathematicsComputer Science ApplicationsMathematicsComputational Theory
2008English

Gradient-Free Online Resource Allocation Algorithms for Dynamic Wireless Networks

2019English

Optimal Reliability-Based Design Using Support Vector Machines and Artificial Life Algorithms

2007English

Online Algorithms With Stochastic Input

ACM SIGecom Exchanges
2011English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy