Share Email Print
cover

Proceedings Paper

Refinement of fast wavelet-based algorithms for linear initial value problems
Author(s): Stanley Osher; A. Jiang; Bjorn Engquist
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

It is commonly acknowledged that there is a tradeoff between schedule quality and schedule robustness. In general terms, schedules that are of high quality tend to be of low robustness, and schedules that are robust tend to be of low quality. To better manage the robustness/quality tradeoff, we have developed an algorithm that implements what we call 'Just-in-Case' scheduling; this algorithm explicitly considers the way in which scheduled actions might fail and how such failures can impact the executability of a schedule. 'Just-in-Case' scheduling is able to build schedules that are robust and of high quality. The 'Just- In-Case' algorithm is motivated in this paper by a specific telescope scheduling problem, and the paper presents the results of an experiment, carried out using real telescope scheduling data, that illustrates the performance improvement one can expect from using it.

Paper Details

Date Published: 15 March 1994
PDF: 4 pages
Proc. SPIE 2242, Wavelet Applications, (15 March 1994); doi: 10.1117/12.170021
Show Author Affiliations
Stanley Osher, Univ. of California/Los Angeles (United States)
A. Jiang, Univ. of California/Los Angeles (United States)
Bjorn Engquist, Univ. of California/Los Angeles (United States)


Published in SPIE Proceedings Vol. 2242:
Wavelet Applications
Harold H. Szu, Editor(s)

© SPIE. Terms of Use
Back to Top