Survey on Heuristic Search Techniques to Solve Artificial Intelligence Problems
Main Article Content
Artificial intelligence (AI) is an area of computer science that highlights the creation of machines that are intelligent, also they work and react like humans. Since AI problems are complex and cannot be solved with direct techniques we resort to heuristic search techniques. Heuristic search technique is any approach to problem solving, learning, or discovery which uses a practical methodology which is not guaranteed to be optimal or perfect, but it is sufficient for the immediate goals. This paper surveys some of the heuristic techniques which is used for searching an optimal solution among multiprocessor environment, followed by and method which enhances the search by doing a search in bidirection and also a method for task scheduling in multiprocessor environment. The paper also discuses about how heuristic is used to solve binary quadratic program and also how it is used in 3G (3rd Generation) Universal Mobile Telecommunication System (UMTS) network.
How to Cite
, R. K. S. A. T. P. S. M. S. “Survey on Heuristic Search Techniques to Solve Artificial Intelligence Problems”. International Journal on Recent and Innovation Trends in Computing and Communication, vol. 3, no. 5, May 2015, pp. 2903-5, doi:10.17762/ijritcc.v3i5.4359.