Refinement of fast wavelet-based algorithms for linear initial value problems

Details Refinement of fast wavelet-based algorithms for linear initial value problems Refinement of fast wavelet-based algorithms for linear initial value problems

Mar 1994

adsabs.harvard.edu/cgi-bin/nph-data_query?bibcode=1994spie.2242...10o&link_type=abstract

Proc. SPIE Vol. 2242, p. 10-13, Wavelet Applications, Harold H. Szu; Ed.

Statistics

Applications

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Refinement of fast wavelet-based algorithms for linear initial value problems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Refinement of fast wavelet-based algorithms for linear initial value problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Refinement of fast wavelet-based algorithms for linear initial value problems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-1587711