Published June 1996
| Version Campus-Access Only
Journal Article
Two measures of difficulty
Creators
Abstract
The paper constructs two measures of difficulty for functions defined over binary strings. The first of these measures,cover size, captures the difficulty of solving a problem in parallel. The second measure,ascent size, captures the difficulty of solving a problem sequentially. We show how these measures can help us to better understand the performance of genetic algorithms and simulated annealing, two widely used search algorithms. We also show how disparities in these two measures may shed light on the organizational structure of firms.
Additional Information
© 1996 Springer-Verlag. This paper has benefited from comments by seminar participants the NBER\CEME Decentralization Conference, UC-Irvine, and UC-San Diego. The author would like to thank Stan Reiter for his guidance and for his many suggestions in helping refine the concepts developed in this paper. Art Devany, Gordon Green, Jim Jordan, Nick Vriend, and an anonymous referee made helpful comments on earlier versions of this paper.External Files
Files attached to this record are restricted to users connected to the Caltech campus network:
- sswp 927 - published - sswp927_-_published.pdf
Additional details
Identifiers
- Eprint ID
- 80647
- DOI
- 10.1007/BF01211821
- Resolver ID
- CaltechAUTHORS:20170821-135134067
Related works
- Describes
- 10.1007/BF01211821 (DOI)
- http://resolver.caltech.edu/CaltechAUTHORS:20170818-133754197 (URL)
Dates
- Created
-
2017-08-21Created from EPrint's datestamp field
- Updated
-
2021-11-15Created from EPrint's last_modified field