C. Stein and J. Wein. Personal communication, May 1996. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Efficient Resource Scheduling in Multiprocessors - Chakrabarti (1996) (1 citation) (Correct)
....at most a 1 times the optimal makespan, and WACT at most a 2 times the optimal WACT, of the given set. Note that the two optimal schedules are in general different. Theorem 4.5.2 For any scheduling problem, there exists a (2; 2) schedule. The constants have since been improved to (2; 1:8) [108]. However, note that the proof is not constructive, since we need the optimal schedules for makespan and WACT for the construction. How can we get constructive polynomial time computable (a 1 ; a 2 ) schedules for small constants a 1 and a 2 Hall et al. suggest a framework to achieve small a 2 ....
C. Stein and J. Wein. Personal communication, May 1996.
Using Interval Graphs for Solving Map Assembly Problems - Randall (1997) (Correct)
....which is of great use in isolating the effects of particular kinds of noise on the algorithms. In this thesis, a simulator developed by Lincoln Stein at the Whitehead Institute MIT Centre for Genome Research and extended by Eric Harley at the University of Toronto was used to generate data sets (Harley and Stein, 1996). This simulator produces STS style adjacency data by building up a set of chromosomes, and randomly assigning them genetic properties in a way that models those found in real chromosomes. The chromosomes are split up into YACs, noise is added to the data, and STS adjacency data is generated from ....
E. Harley and L.D. Stein, Personal communication, (1996).
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC