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

  1. Breakout method (in local search)
  2. ERA
  3. Genetic algorithms
  4. Greedy local search
  5. Hill climbing
  6. Least commitment principal
  7. Limited discrepancy search
  8. Random walk
  9. Restart strategy
  10. Simulated annealing
  11. Tabu search

    12. Other

  12. Binary or 2-way branching (in a search tree)
  13. Bipartite Graph
    1. Definition of a Bipartite Graph
    2. A maximal matching in a bipartite graph
    3. A free edge in a matching in a bipartite graph
    4. A free vertex in a matching in a bipartite graph
    5. A vital edge in a bipartite graph
  14. Box Consistency (for continuous domains CSPs)
  15. Generalized Arc Consistency
  16. k-way branching (in a search tree)
  17. Simple path in a graph
  18. Strongly connected component in a directed graph
  19. Value graph of an all-diff contraint

Berthe Y. Choueiry