Two measures of difficulty (*)
AbstractThe 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.
Download InfoTo our knowledge, this item is not available for download. To find whether it is available, there are three options:
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
Bibliographic InfoArticle provided by Springer in its journal Economic Theory.
Volume (Year): 8 (1996)
Issue (Month): 2 ()
Note: Received: October 31, 1994; revised version December 7, 1994
Contact details of provider:
Web page: http://link.springer.de/link/service/journals/00199/index.htm
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
This item has more than 25 citations. To prevent cluttering this page, these citations are listed on a separate page. reading list or among the top items on IDEAS.Access and download statisticsgeneral information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Guenther Eichhorn) or (Christopher F Baum).
If references are entirely missing, you can add them using this form.