A Connectionist Machine for Genetic Hillclimbing: 28 (The Springer International Series in Engineering and Computer Science, 28) - Softcover
Synopsis
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.
"synopsis" may belong to another edition of this title.
Review
` It is a good source for those interested in a concrete application of Boltzmann machines or (at several places) thoughtful treatise on their potential impact on the broader fields of artificial intelligence and machine learning. '
B.P. Buckles, Computing Reviews, January 1989
"About this title" may belong to another edition of this title.
Other Popular Editions of the Same Title
Search results for A Connectionist Machine for Genetic Hillclimbing: 28...
Stock Image
A Connectionist Machine for Genetic Hillclimbing (eng)
Print on DemandSeller: Brook Bookstore On Demand, Napoli, NA, Italy
Seller rating 3 out of 5 stars
Condition: new. Questo è un articolo print on demand. Seller Inventory # HLXDQDVMAX
Buy New
£ 76.69
£ 4.75 shipping
Ships from Italy to U.S.A.
Ships from Italy to U.S.A.
Quantity: Over 20 available
Stock Image
A Connectionist Machine for Genetic Hillclimbing (The Springer International Series in Engineering and Computer Science)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In. Seller Inventory # ria9781461291923_new
Buy New
£ 96.88
£ 11.98 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: Over 20 available
Stock Image
A Connectionist Machine for Genetic Hillclimbing (The Springer International Series in Engineering and Computer Science)
Seller: Chiron Media, Wallingford, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: New. Seller Inventory # 6666-IUK-9781461291923
Buy New
£ 94.74
£ 15.49 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 10 available
Seller Image
A Connectionist Machine for Genetic Hillclimbing
Published by
Springer, Chapman And Hall/CRC Okt 2011, 2011
ISBN 10: 1461291925
ISBN 13: 9781461291923
New
Taschenbuch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - 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. 280 pp. Englisch. Seller Inventory # 9781461291923
Seller Image
A Connectionist Machine for Genetic Hillclimbing
Print on DemandSeller: moluna, Greven, Germany
Seller rating 5 out of 5 stars
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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. Seller Inventory # 4191721
Buy New
£ 82.05
£ 42.29 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: Over 20 available
Stock Image
A Connectionist Machine for Genetic Hillclimbing
Seller: Books Puddle, New York, NY, U.S.A.
Seller rating 4 out of 5 stars
Condition: New. pp. 280. Seller Inventory # 2697793505
Stock Image
A Connectionist Machine for Genetic Hillclimbing
Print on DemandSeller: Majestic Books, Hounslow, United Kingdom
Seller rating 4 out of 5 stars
Condition: New. Print on Demand pp. 280 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam. Seller Inventory # 94603838
Buy New
£ 128.48
£ 6.50 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 4 available
Stock Image
A Connectionist Machine for Genetic Hillclimbing
Print on DemandSeller: Biblios, Frankfurt am main, HESSE, Germany
Seller rating 4 out of 5 stars
Condition: New. PRINT ON DEMAND pp. 280. Seller Inventory # 1897793515
Seller Image
A Connectionist Machine for Genetic Hillclimbing
Seller: preigu, Osnabrück, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. A Connectionist Machine for Genetic Hillclimbing | David Ackley | Taschenbuch | xiv | Englisch | 2011 | Springer | EAN 9781461291923 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. Seller Inventory # 105629569
Seller Image
A Connectionist Machine for Genetic Hillclimbing
Published by
Springer, Springer Okt 2011, 2011
ISBN 10: 1461291925
ISBN 13: 9781461291923
New
Taschenbuch
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. 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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 280 pp. Englisch. Seller Inventory # 9781461291923