CSCE 476/876, Spring 2009, Glossary 4
Assigned: Monday, Feb 9, 2009.
Due: Monday, Feb 16, 2009.
Note: Glossaries are optional but help you improve your grade.
- g(n), h(n), f(n), C* (4 points)
- A* search
- Admissible heuristic
- Backtracking search
- Belief State
- Best-first search
- Bidirectional search
- Blind search
- Breadth-first search
- Coercion
- Consistency (as a property of the h function)
- Contengincy problem
- Contours
- Depth-first search
- Depth-limited search
- Diameter (of a graph). Look in graph theory.
- Domination (of two functions)
- Effective branching factor
- Exploration problem
- Greedy algorithm
- Heuristic function
- Heuristic search
- Informed search
- Iterative-Deepening search
- Iterative-Lengthening search
- Knowledge acquisition
- Manhattan distance
- Monotonicity (as a property of the h function)
- Optimally efficient
- Pathmax equation (not in your books)
- Predecessors
- Pruning
- Relaxed problem
- Sensorless problem
- Straight-line distance
- Triangle inequality
- Uniform-cost search
- Uninformed search
Berthe Y. Choueiry
choueiry@cse.unl.edu