[New England
      Complex Systems Institute]
[Home] [Research] [Education] [Current Section: Activities & Events] [Community] [News] [The Complex World] [About Complex Systems] [About NECSI]
International Conference on Complex Systems (ICCS2006)

An Empirical Study of Search Algorithms Applied to Reconstructability Analysis

Mark Wierman
Computer Science at Creighton University

Mary Dobransky
Systems Science at Binghmaton University

     Full text: PDF
     Last modified: November 20, 2006

Abstract
Reconstruction analysis (RA) is a problem whose search space explodes as a function of n, where n the number of variables in the base system. The total number of solutions is on the order of 2^2^n. This paper will show that exhaustive methods can search a space on the order of 2^n^2. Since this is still a computationally complex problem for reasonable values of n, heuristic methods are the only reasonable answer to practical application of RA. This paper discusses the application of both heuristic and exhaustive optimization techniques to the problem of reconstruction analysis for various values of n. Methods applied include genetic algorithms, simulated annealing, random search, bottom up search and top down search.




Conference Home   |   Conference Topics   |   Application to Attend
Submit Abstract/Paper   |   Accommodation and Travel   |   Information for Participants


Maintained by NECSI Webmaster    Copyright © 2000-2005 New England Complex Systems Institute. All rights reserved.