๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Random heuristic search: applications to GAs and functions of unitation

โœ Scribed by Michael D. Vose; Jonathan E. Rowe

Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
256 KB
Volume
186
Category
Article
ISSN
0045-7825

No coin nor oath required. For personal study only.

โœฆ Synopsis

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 application by presenting both ยฎne-grained and coarse-grained models for a genetic algorithm applied to functions of unitation. Particular emphasis is given to the interrelationships between the models.

๐Ÿ“œ SIMILAR VOLUMES

Applications of parallel processing tech
Applications of parallel processing technologies in heuristic search planning: methodologies and experiments
โœ Tu Huy Phan; Enrico Pontelli; Tran Cao Son; Son Thanh To ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 356 KB

## Abstract The goal of this paper is to investigate the application of parallel programming techniques to boost the performance of heuristic searchโ€based planning systems in various aspects. It shows that an appropriate parallelization of a sequential planning system often brings gain in performan

Synthesizers and Their Application to th
Synthesizers and Their Application to the Parallel Construction of Pseudo-Random Functions
โœ Moni Naor; Omer Reingold ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 346 KB

A pseudo-random function is a fundamental cryptographic primitive that is essential for encryption, identification, and authentication. We present a new cryptographic primitive called pseudo-random synthesizer and show how to use it in order to get a parallel construction of a pseudo-random function