The complexity of problems is often too high for people or organizations, having to solve them, to do so in an optimal way. In order to cope with such problems, either the search space has to be decomposed, or it has to be searched by random trial and error processes. Kauffman´s NK model offers a way to depict such problem space decompositions and the search for solutions in them. However, papers on the effect of different decompositions on solution quality come to differing conclusions as to the advantages or disadvantages of incorrect modularization assumptions. The current paper thus examines the results of more empirically based search strategies. Some trade offs become visible, but the sometimes observed initial advantage of a too deep modularization could not be confirmed.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.