Publication View

1 References (2008)

Abstract
Build algorithms using a ‘random ’ element so as gain improved performance. For some cases, improved performance is very dramatic, moving from intractable to tractable. Often however, there is some loss in the reliability of results: either no result at all may be produced, or an incorrect result may be returned, or, for numerical results, an approximate answer may be produced. Because of the random element, different runs may produce different results and therefore the reliability of results may be improved with multiple runs.

Publication details
Download http://citeseerx.ist.psu.edu/viewdoc/summary?doi=?doi=10.1.1.128.8397
Source http://www.cs.man.ac.uk/~david/courses/advalgorithms/probabilistic.pdf
Contributors CiteSeerX
Repository CiteSeerX - Scientific Literature Digital Library and Search Engine (United States)
Type text
Language English