Stopping rules in k-adaptive global random search algorithms

Author： Zhigljavsky Anatoly   Hamilton Emily  

Publisher： Springer Publishing Company

ISSN： 0925-5001

Source： Journal of Global Optimization, Vol.48, Iss.1, 2010-09, pp. : 87-97

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Approximation Algorithms for k-hurdle Problems

By Dean Brian   Griffis Adam   Parekh Ojas   Whitley Adam  

Algorithmica, Vol. 59, Iss. 1, 2011-01 ,pp. : 81-93

Springer Publishing Company

Access to resources Recommend Favorite

Stopping and restarting strategy for stochastic sequential search in global optimization

By Zabinsky Zelda   Bulger David   Khompatraporn Charoenchai  

Journal of Global Optimization, Vol. 46, Iss. 2, 2010-02 ,pp. : 273-286

Springer Publishing Company

Access to resources Recommend Favorite

Stochastic Local Search Algorithms for Graph Set T-colouring and Frequency Assignment

By Chiarandini Marco   Stützle Thomas  

Constraints, Vol. 12, Iss. 3, 2007-09 ,pp. : 371-403

Springer Publishing Company

Access to resources Recommend Favorite

Heuristic Algorithms and Scatter Search for the Cardinality Constrained P‖Cmax Problem

By Dell'Amico Mauro   Iori Manuel   Martello Silvano  

Journal of Heuristics, Vol. 10, Iss. 2, 2004-03 ,pp. : 169-204

Springer Publishing Company

Access to resources Recommend Favorite

A Central Limit Theorem for the Number of Degree- k Vertices in Random Maps

By Drmota Michael  

Algorithmica, Vol. 66, Iss. 4, 2013-08 ,pp. : 741-761

Springer Publishing Company

Access to resources Recommend Favorite