Abstract
The problem of generating a random sample over a level set, called Uniform Covering, is considered. A variant is discussed of an algorithm known as Pure Adaptive Search which is a global optimisation ideal with a desirable complexity. The algorithm of Uniform Covering by Probabilistic Rejection is discussed as an approach to the practical realisation of PAS. Consequences for the complexity and practical performance in comparison to other algorithms are illustrated.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
