No CrossRef data available.
Article contents
A note on continuous search algorithms
Published online by Cambridge University Press: 14 July 2016
Abstract
Continuous random search methods with an average complexity given by O(log(1/ε)) for ε → 0 where ε is a given accuracy were presented in a recent paper. In this article an example of an O(log log(1/ε)) method is presented and illustrated.
- Type
- Short Communications
- Information
- Copyright
- Copyright © Applied Probability Trust 1987
Footnotes
Supported by NSERC of Canada under grants A8196 and A4850.