Heavy-Tailed runtime distributions: heuristics, models and optimal refutations

Authors:
Tudor Hulubei;Barry O'Sullivan
Affiliations:
Cork Constraint Computation Centre, Department of Computer Science, University College Cork, Ireland;Cork Constraint Computation Centre, Department of Computer Science, University College Cork, Ireland
Venue:
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Year:
2006

Citing 4
Cited 2

A filtering algorithm for constraints of difference in CSPs

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Statistical Regimes Across Constrainedness Regions

Constraints
The Impact of Search Heuristics on Heavy-Tailed Behaviour

Constraints
Optimal refutations for constraint satisfaction problems

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence

A generative power-law search tree model

Computers and Operations Research
Using expectation maximization to find likely assignments for solving CSP's

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.01

Visualization

Abstract

We perform an in-depth empirical study of runtime distributions associated with a continuum of problem formulations for QWH-10 with 90% holes defined between the points where a formulation is entirely specified in terms of binary inequality constraints to models specified using an increasing number of AllDifferent global constraints [4]. For each model we study a variety of variable and value ordering heuristics. We compare their runtime distributions against runtime distributions where any mistakes made in search are refuted optimally [2], and make the following observations: