Analytical Results on the BFS vs. DFS Algorithm Selection Problem. Part I: Tree Search.
Tom EverittMarcus HutterPublished in: Australasian Conference on Artificial Intelligence (2015)
Keyphrases
- depth first search
- tree search
- breadth first search
- np hard
- computational complexity
- dynamic programming
- alpha beta
- particle swarm optimization
- graph search
- memory efficient
- monte carlo
- learning algorithm
- cost function
- ant colony optimization
- hill climbing
- evolutionary algorithm
- search space
- optimal solution
- objective function