Abstract
The development in the previous chapter identified two capabilities that a search strategy needs if it is to satisfy hidden strong constraints with reasonable efficiency: Learning while searching, and sustained exploration. In this chapter, these are presumed to be desirable goals for search strategies, and are used to motivate the proposed model. This is a fairly long chapter, and it covers a lot of material before actually getting to the formal definition of SIGH, so it may be useful to preview the path of the exposition.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1987 Kluwer Academic Publishers
About this chapter
Cite this chapter
Ackley, D.H. (1987). The model. In: A Connectionist Machine for Genetic Hillclimbing. The Kluwer International Series in Engineering and Computer Science, vol 28. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-1997-9_2
Download citation
DOI: https://doi.org/10.1007/978-1-4613-1997-9_2
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4612-9192-3
Online ISBN: 978-1-4613-1997-9
eBook Packages: Springer Book Archive