Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Antamoshkin, Alexander | Semenkin, Eugene
Affiliations: Siberian Aerospace Academy, P.O.Box 486, Krasnoyarsk, Russia-660014. E-mail: ant@iea.krasnoyarsk.su
Abstract: This work is a continuation of our previous papers devoted to exploration of the regular search procedures efficiency in binary search spaces. Here we formulate the problem in a rather general form as a problem of optimization of an unimodal pseudoboolean function given implicitly and obtain analitical estimates of the expected time of a minimum point search for procedures of direct local search. These estimates are polinomial for the case of weakly nonmonotone functions and exponential for the general case of arbitrary unimodal functions. We hope that the proposed result will be usefull first of all for practical applications.
Keywords: unimodal pseudoboolean functions, local search techniques, convergence analysis
DOI: 10.3233/INF-1998-9302
Journal: Informatica, vol. 9, no. 3, pp. 279-296, 1998
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl