9780898382365 - A Connectionist Machine for Genetic Hillclimbing (The Springer International Series in Engineering and Computer Science, 28, Band 28) von Ackley, David (7 Ergebnisse)

Hardcover. Zustand: Bon. Ancien livre de bibliothèque. Traces d'usure sur la couverture. Petite(s) trace(s) de pliure sur la couverture. Salissures sur la tranche. Edition 1987. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Good. Former library book. Signs of wear on the cover. Slightly creased cover. Stains on the edge. Edition 1987. Ammareal gives back up to 15% of this item's net price to charity organizations.

Hardcover. Zustand: Très bon. Ancien livre de bibliothèque. Légères traces d'usure sur la couverture. Salissures sur la tranche. Edition 1987. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Very good. Former library book. Slight signs of wear on the cover. Stains on the edge. Edition 1987. Ammareal gives back up to 15% of this item's net price to charity organizations.

Hardcover. Ex-library with stamp and library-signature. GOOD condition, some traces of use. Ancien Exemplaire de bibliothèque avec signature et cachet. BON état, quelques traces d'usure. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. C 398 9780898382365 Sprache: Englisch Gewicht in Gramm: 1150.

Zustand: New. In.

Zustand: New. Series: The Springer International Series in Engineering and Computer Science. Num Pages: 260 pages, biography. BIC Classification: UYQ. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly. Dimension: 234 x 156 x 17. Weight in Grams: 1260. . 1987. Hardback. . . . . Books ship from the US and Ireland.

Gebunden. Zustand: New. In the black box function optimization problem, a search strategy is required to find an extremal point of a function without knowing the structure of the function or the range of possible function values. Solving such problems efficiently requires two ab.

Buch. Zustand: Neu. Neuware - In the 'black box function optimization' problem, a search strategy is required to find an extremal point of a function without knowing the structure of the function or the range of possible function values. Solving such problems efficiently requires two abilities. On the one hand, a strategy must be capable of learning while searching: It must gather global information about the space and concentrate the search in the most promising regions. On the other hand, a strategy must be capable of sustained exploration: If a search of the most promising region does not uncover a satisfactory point, the strategy must redirect its efforts into other regions of the space. This dissertation describes a connectionist learning machine that produces a search strategy called stochastic iterated genetic hillclimb ing (SIGH). Viewed over a short period of time, SIGH displays a coarse-to-fine searching strategy, like simulated annealing and genetic algorithms. However, in SIGH the convergence process is reversible. The connectionist implementation makes it possible to diverge the search after it has converged, and to recover coarse-grained informa tion about the space that was suppressed during convergence. The successful optimization of a complex function by SIGH usually in volves a series of such converge/diverge cycles.