𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Worst-case performance of critical path type algorithms

✍ Scribed by G. Singh; Y. Zinder

Book ID
111205711
Publisher
John Wiley and Sons
Year
2000
Tongue
English
Weight
339 KB
Volume
7
Category
Article
ISSN
0969-6016

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Worst-case performance of critical path
Worst-case performance of critical path type algorithms
✍ G. Singh; Y. Zinder πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 343 KB

The critical path method remains one of the most popular approaches in practical scheduling. Being developed for the makespan problem this method can also be generalized to the maximum lateness problem. For the unit execution time task system and parallel processors this generalization is known as t

Worst-case performance of approximation
Worst-case performance of approximation algorithms for tool management problems
✍ Yves Crama; Joris van de Klundert πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 122 KB πŸ‘ 2 views

Since the introduction of flexible manufacturing systems, researchers have investigated various planning and scheduling problems faced by the users of such systems. Several of these problems are not encountered in more classical production settings, and so-called tool management problems appear to b

A New Algorithm and Worst Case Complexit
A New Algorithm and Worst Case Complexity for Feynman–Kac Path Integration
✍ Leszek Plaskota; Grzegorz W. Wasilkowski; Henryk WoΕΊniakowski πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 121 KB

We study algorithms for approximation of Feynman-Kac path integrals in the worst case setting. The algorithms use a finite number of samples of the initial condition and potential functions. We present a new algorithm and an explicit bound on its cost to compute an Ξ΅-approximation to the Feynman-Kac