CSCE 421/821, Fall 2004, Glossary 6

Assigned: Wednesday, November 10, 2004.
Due: Monday, November 15, 2004.
Note: Glossaries are optional but help you improve your grade.
  1. Bandwidth of a graph
  2. Directed Arc Consistency
  3. Directed Acyclic Graph
  4. Fail-first principle
  5. Least domain heuristic
  6. Maintaining arc-consistency (MAC)
  7. Maximum cardinality heuristic
  8. Min-conflict heuristic
  9. Width of an ordering
  10. Width of a graph
  11. (The difference between) a set and a bag

Bonus (worth 8 `glossary' points): Find and explain how the technique called `edge finding,' which is used for constraint propagation in scheduling, works by checking out the papers referenced in Dr. Fromherz tutorial.

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