✦ LIBER ✦

Performance Bounds of Algorithms for Scheduling Advertisements on a Web Page

✍ Scribed by Milind Dawande; Subodha Kumar; Chelliah Sriskandarajah

Book ID: 111538893
Publisher: Springer US
Year: 2003
Tongue: English
Weight: 201 KB
Volume: 6
Category: Article
ISSN: 1094-6136
DOI: 10.1023/a:1024060710627

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Scheduling Advertisements on a Web Page:

Scheduling Advertisements on a Web Page: New and Improved Approximation Algorithms

✍ Milind Dawande; Subodha Kumar; Chelliah Sriskandarajah 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 306 KB

A lower bound for randomized on-line sch

A lower bound for randomized on-line scheduling algorithms

✍ Bo Chen; André van Vliet; Gerhard J. Woeginger 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 293 KB

Probabilistic Bounds on the Performance

Probabilistic Bounds on the Performance of List Scheduling

✍ Bruno, John L.; Downey, Peter J. 📂 Article 📅 1986 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 807 KB

A throughput-driven scheduling algorithm

A throughput-driven scheduling algorithm of differentiated service for web cluster

✍ Yan Cai-rong; Shen Jun-yi; Pen Qin-ke; Wan Yong-quan 📂 Article 📅 2006 🏛 Wuhan University 🌐 English ⚖ 435 KB

On the performance of bee algorithms for

On the performance of bee algorithms for resource-constrained project scheduling problem

✍ Koorush Ziarati; Reza Akbari; Vahid Zeighami 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 742 KB

The impact of approximate evaluation on

The impact of approximate evaluation on the performance of search algorithms for warehouse scheduling

✍ Watson, J. P. (author);Rana, S. (author);Whitley, L. D. (author);Howe, A. E. (au 📂 Article 📅 1999 🏛 Springer Netherlands 🌐 English ⚖ 254 KB 👁 2 views

The Coors warehouse scheduling problem involves finding a permutation of customer orders that minimizes the average time that customers' orders spend at the loading docks while at the same time minimizing the running average inventory, Search-based solutions require fast objective functions. Thus, a