CSCE 421/821, Fall 2014, Glossary 7

Assigned: Friday, Nov 21
Due: Monday, Dec 1
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.

Not all the terms below were discussed in class. Please refer to your textbook and other references.

    Search

  1. Binary or 2-way branching (in a search tree)
  2. k-way branching (in a search tree)
  3. Generalized Arc Consistency

    4. GAC Algorithm for AllDiff

  4. Definition of a Bipartite Graph
  5. A maximal matching in a bipartite graph
  6. A free edge in a matching in a bipartite graph
  7. A free vertex in a matching in a bipartite graph
  8. A vital edge in a bipartite graph
  9. Strongly connected component in a directed graph
  10. Value graph of an all-diff contraint

    11. Local Search

  11. Breakout method (in local search)
  12. Crossover point
  13. ERA
  14. Genetic algorithms
  15. Greedy local search
  16. Hill climbing
  17. Fitness function
  18. Local optimum
  19. Plateau
  20. Random mutation
  21. Random walk
  22. Restart strategy
  23. Simulated annealing
  24. Tabu search

Do not forget to list your references.
Berthe Y. Choueiry