Richard E. Korf
(3 articles)
1959
Heuristic Search Techniques
Methods used in AI to find solutions or make decisions more efficiently by using rules of thumb or informed guesses to guide the search process.
Generality: 878
1970
Admissible Heuristic
A heuristic is considered admissible if it never overestimates the cost of reaching the goal in search algorithms, ensuring an optimal solution.
Generality: 575
1976
CSPs
Constraint Satisfaction Problems
Constraint Satisfaction Problems
Mathematical problems defined by a set of variables, a domain of values for each variable, and a set of constraints specifying allowable combinations of values.
Generality: 800