✦ LIBER ✦

Competitive Analysis of Scheduling Algorithms for

✍ Scribed by Wojciech Jawor; Marek Chrobak; Christoph Dürr

Publisher: Springer
Year: 2007
Tongue: English
Weight: 470 KB
Volume: 51
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-007-9053-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Competitive Algorithms for Due Date Sche

Competitive Algorithms for Due Date Scheduling

✍ Nikhil Bansal; Ho-Leung Chan; Kirk Pruhs 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 350 KB

Competitive genetic algorithms for the o

Competitive genetic algorithms for the open-shop scheduling problem

✍ Christian Prins 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 170 KB

A competitive genetic algorithm for reso

A competitive genetic algorithm for resource-constrained project scheduling

✍ Sönke Hartmann 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 100 KB 👁 2 views

Competitive analysis of randomized pagin

Competitive analysis of randomized paging algorithms

✍ Dimitris Achlioptas; Marek Chrobak; John Noga 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 130 KB

The paging problem is deÿned as follows: we are given a two-level memory system, in which one level is a fast memory, called cache, capable of holding k items, and the second level is an unbounded but slow memory. At each given time step, a request to an item is issued. Given a request to an item p,

Competitive analysis of preemptive singl

Competitive analysis of preemptive single-machine scheduling

✍ René Sitters 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 204 KB

Competitive Analysis of On-Line Disk Sch

Competitive Analysis of On-Line Disk Scheduling

✍ Tzuoo-Hawn Yeh; Cheng-Ming Kuo; Chin-Laung Lei; Hsu-Chun Yen 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 215 KB