DOIONLINE 
DOIONLINE Publish In |
International Journal of Advance Computational Engineering and Networking (IJACEN)-IJACEN |
 Journal Home Volume Issue |
||||||||
Issue |
Volume-3, Issue-6 ( Jun, 2015 ) | |||||||||
Paper Title |
Synthesis Of Selected Tree Searching Algorithms | |||||||||
Author Name |
Parag Bhalchandra, Santosh Khamitkar, Pawan Wasnik | |||||||||
Affilition |
Assistant Professor at School of Computational Sciences, S.R.T.M. University, Nanded, MS, 431606, India 3 Research Scholar and purusing his M.Phil course in Computer Science from School of Computational Sciences, S.R.T.M. University, Nanded, MS, 431606, India | |||||||||
Pages |
42-47 | |||||||||
Abstract |
The intention of this paper is two folds, one to review selected tree search algorithms / search strategies that can be applied to a problem space and the second objective is to stimulate to implement recent developments in the complexity behavior of search strategies. The algorithms discussed here apply in general to both brute force and heuristic searches over tree spaces. Keywords- Trees Search, Asymptotic Complexity, Brute Force, Heuristics Algorithms | |||||||||
| View Paper | ||||||||||
