CSCE 421/821: Glossary 5

CSCE 421/821, Spring 2018, Glossary 5

Assigned: Monday, Feb 12
Due: Monday, Feb 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. You may need to check the following documents:

Peter Cheeseman et al.: Where the Really Hard Problems Are (IJCAI 1991).
Dechter's Constraint Processing book

Clique in a graph, maximal clique in a graph
Complete graph
Constraint density of a binary CSP
Constraint tightness of a binary constraint
Degree of a graph
Degree of a vertex in a graph
Efficient algorithm
Fail-first principle (for variable ordering)
Mathematical Programming
Maintaining arc-consistency (MAC)
Maximal cliques in a graph
Order parameter (in phase transition)
Phase Transition

Do not forget to list your references.

Berthe Y. Choueiry