[ Please note: The project has been discontinued as of May 31, 2005 and is superseded by the projects of the ii Labs. There won't be further updates to these pages. ]

(Related publications: [PUBLink] [PUBLink])

Unlike low-level CSP-based representations, global constraints enable the search to be conducted in a more informed way. A measure for this is the susceptibility to getting caught in local minima and on plateaus. This is investigated in the following subsections.

Subsections:

• Randomization
• Random Walks
• Tabu Lists

For questions, comments or suggestions, please contact us.

Last update:
May 19, 2001 by Alexander Nareyek