NP/NP complete and AI-complete problems are problems with huge or even infinite search or state spaces. The search or state space is a graph (or other representation) that contains all of the possible states (including the initial and goal states of the problem) of the domain of the initial problem. An example of a huge search space is all the nodes on the Internet ...

March 04, 2009
URL:http://www.drdobbs.com/parallel/search-space-the-final-frontier/228800361

Terms of Service | Privacy Statement | Copyright © 2024 UBM Tech, All rights reserved.