Parallel
Search Space ... the final frontier
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 ...Related Reading
More Insights
INFO-LINK
To upload an avatar photo, first complete your Disqus profile. | View the list of supported HTML tags you can use to style comments. | Please read our commenting policy. | |