✦ LIBER ✦

Random heuristic search

✍ Scribed by Michael D. Vose

Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 257 KB
Volume: 229
Category: Article
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(99)00120-6

No coin nor oath required. For personal study only.

✦ Synopsis

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 speciÿc examples are included for illustrative purposes, but the theory's basic structure, as opposed to applications, remains the focus.

📜 SIMILAR VOLUMES

Random heuristic search: applications to

Random heuristic search: applications to GAs and functions of unitation

✍ Michael D. Vose; Jonathan E. Rowe 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 256 KB

Describing a wide range of search methods at various levels of detail, the theory of random heuristic search speaks of their qualitative and quantitative aspects. This paper begins by outlining the theory, reviewing some of the more basic principles and results, and then goes on to illustrate its ap

Heuristic search through islands

✍ P.P. Chakrabarti; S. Ghose; S.C. DeSarkar 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 336 KB

A heuristic search strategy via islands is suggested to significantly decrease the number of nodes expanded. Algorithm I, which searches through a set of island nodes ("island set"), is presented assuming that the island set contains at least one node on an optimal cost path. This algorithm is shown

Breadth-first heuristic search

✍ Rong Zhou; Eric A. Hansen 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 202 KB

Heuristic search in restricted memory

✍ P.P. Chakrabarti; S. Ghose; A. Acharya; S.C. de Sarkar 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 979 KB

Thts paper presents heurlsttc search algortthms whtch work wtthm memory constramts These algortthms, MA\* (for ordinary graphs) and MAO\* (for AND~OR graphs) guarantee admtsstble soluttons wlthm spectfied memory hmltattons (above the rnmtmum requtred) The memory versus node expanstons tradeoff ts an

Hierarchy and statistical heuristic sear

Hierarchy and statistical heuristic search

✍ Bo Zhang; Ling Zhang 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 400 KB

Heuristic search in artificial intellige

Heuristic search in artificial intelligence

✍ Weixiong Zhang; Rina Dechter; Richard E. Korf 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 41 KB