A Comparative Study of Searching and Optimization Techniques in Artificial Intelligence
DOI:
https://doi.org/10.32628/CSEIT2062167Keywords:
Artificial Intelligence, Complexity, Optimization, SearchingAbstract
Solving a problem mean looking for a solution, which is best among others. Finding a solution to a problem in Computer Science and Artificial Intelligence is often thought as a process of search through the space of possible solutions. On the other hand in Engineering and Mathematics it is thought as a process of optimization i.e. to find a best solution or an optimal solution for a problem. These reduce search space and improve its efficiency. At each and every step of search,it select which have the least futility. In this paper ,We categorize the different AI search and optimization techniques in a tabular form on the basis of their merits and demerits to make it easy to choose a technique for a particular problem.
References
- Ashwani chandel,Manu Sood,” Searching and Optimization Techniques in Artificial Intelligence: A Comparative Study & Complexity Analysis”,International Journal of Advanced Research in Computer Engineering & Technology (IJARCET) Volume 3 Issue 3, March 2014.
- DonavalliVenkataVidya Deepthi, M.Ganesh Babu,Konda Sreenu,” Comparison of Different Optimization Techniques in Artificial Intelligence”, International Journal of Advanced Research Trends in Engineering and Technology (IJARTET) Vol. 4, Special Issue 21, August 2017
- D.W. Patterson, “ Introduction to Artificial Intelligence and Expert Systems”, PHI Learning Private Limited, 2009.
- S. Russel and P.Norvig,” Artificial Intelligence a Modern Approach”, A book on Artificial Intelligence and Algorithms‖, 2006.R.E. Korf,”Scientific Paper on Artificial Intelligence Search Algorithms”, University of California Los Angeles, June 1999.
Downloads
Published
Issue
Section
License
Copyright (c) IJSRCSEIT
This work is licensed under a Creative Commons Attribution 4.0 International License.