Finding solutions to NP problems: philosophical differences between quantum and evolutionary search algorithms.
Garrison W. GreenwoodPublished in: CEC (2001)
Keyphrases
- search algorithm
- np complete
- search methods
- similar problems
- benchmark problems
- statistically significant
- efficient solutions
- path finding
- partial solutions
- solving constraint satisfaction problems
- stochastic local search algorithms
- computational issues
- practical solutions
- optimal or near optimal
- specific problems
- optimal solution
- approximate solutions
- genetic algorithm
- search problems
- search heuristics
- heuristic methods
- genetic search
- combinatorial search
- combinatorial problems
- evolutionary computation
- np hard
- artificial intelligence