id: 01454202
dt: j
an: 01454202
au: Vose, M.D.
ti: Random heuristic search.
so: Theor. Comput. Sci. 229, No.1-2, 103-142 (1999).
py: 1999
pu: Elsevier Science Publishers, Amsterdam
la: EN
cc: 
ut: random heuristic search; modeling evolutionary algorithms; degenerate royal
    road functions
ci: 
li: doi:10.1016/S0304-3975(99)00120-6
ab: Summary: There is a developing theory of growing power which, at its
    current stage of development (indeed, for a number of years now),
    speaks to qualitative and quantitative aspects of search strategies.
    Although it has been specialized and applied to genetic algorithms, its
    implications and applicability are far more general. This paper deals
    with the broad outlines of the theory, introducing basic principles and
    results rather than analyzing or specializing to particular algorithms.
    A few specific examples are included for illustrative purposes, but the
    theory’s basic structure, as opposed to applications, remains the
    focus.
rv: