Hierarchical constraint satisfaction: Difference between revisions

Revision as of 19:16, 28 June 2009

Revision as of 00:09, 29 June 2009

Line 1:

{{Unreferenced|date=June 2009}}

{{unreferenced}}

In [[artificial intelligence]] and [[operations research]], '''hierarchical constraint satisfaction (HCS)''' is a method of handling [[constraint satisfaction]] problems where the [[Variable (mathematics)|variables]] have large domains by exploiting their internal structure.

Line 6:

[[Category:Constraint satisfaction]]

{{Mathapplied-stub}}