##
CSCE 421/821, Fall 2012, Glossary 7

**Assigned: Wednesday, Nov 14**

**Due: Monday, Nov 19.**

**Note: **Glossaries are optional but they allow you improve
your grade. Also, you are responsible for knowing the exact
definition of the terms in a glossary at any point in time, including
during a quiz.

Search your textbook, notes, the web, or the library to
define/describe the following. It is very important to list all your
references.

** Local Search**

- Breakout method (in local search)
- ERA
- Genetic algorithms
- Greedy local search
- Hill climbing
- Least commitment principal
- Limited discrepancy search
- Random walk
- Restart strategy
- Simulated annealing
- Tabu search
** Other**

- Binary or 2-way branching (in a search tree)
- Bipartite Graph
- Definition of a Bipartite Graph
- A maximal matching in a bipartite graph
- A free edge in a matching in a bipartite graph
- A free vertex in a matching in a bipartite graph
- A vital edge in a bipartite graph

- Box Consistency (for continuous domains CSPs)
- Generalized Arc Consistency
- k-way branching (in a search tree)
- Simple path in a graph
- Strongly connected component in a directed graph
- Value graph of an all-diff contraint

Berthe Y. Choueiry