Finding Optimal Algorithm in Artificial Intelligence
Journal: International Journal of Computer Science and Mobile Computing - IJCSMC (Vol.10, No. 7)Publication Date: 2021-07-30
Authors : I.Parvin Begum; I.Shahina Begam;
Page : 84-90
Keywords : Artificial Intelligence; path finding; blind search algorithm; working strategy; Uniform Cost Search;
Abstract
Present days many artificial intelligence search algorithms are plays a important to figure out the problem of shortest path finding. The paper presents the detailed study of heuristic search and blind search techniques. The paper focus additional in the direction of blind search strategies such as Breadth First Search, Depth First Search, and Uniform Cost Search and informed explore strategies like A*, and Best First Search. The paper consist of effective of search procedure, their qualities, and demerits, where these algorithms are applicable, also at last comparison of search techniques based on complexity, optimality and completeness are presented in tabular structure.
Other Latest Articles
- Modern Features of Risk Management in the Context of Strategic Development of the Enterprise
- Current Issues of Decentralization Reform and Administrative-Territorial Device
- Conceptual Principles of Realization and Improvement of Export Strategy of Zaporizhia Region
- Conceptual Principles of Realization and Improvement of Export Strategy of Zaporizhia Region
- Applying of Regional Benchmarking in the Smart Prioritization Process
Last modified: 2021-08-11 18:17:30