The impact of search heuristics on heavy-tailed behaviour

DOI10.1007/s10601-006-8061-1zbMath1103.68812OpenAlexW2045342409MaRDI QIDQ850467

Barry O'Sullivan, Tudor Hulubei

Publication date: 3 November 2006

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10601-006-8061-1

zbMATH Keywords

search heuristicsruntime distributionsconstraint satisfactions

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (2)

A generative power-law search tree model ⋮ Value ordering for quantified CSPs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Embedding partial Steiner triple systems is NP-complete
• Statistical regimes across constrainedness regions
• Depth-first iterative-deepening: An optimal admissible tree search
• The hardest constraint problems: A double phase transition
• Easy problems are sometimes hard
• Heavy-tailed phenomena in satisfiability and constraint satisfaction problems
• Search Heuristics and Heavy-Tailed Behaviour
• New methods to color the vertices of a graph
• Generating uniformly distributed random latin squares
• Principles and Practice of Constraint Programming – CP 2004
• Random constraint satisfaction: Flaws and structure

This page was built for publication: The impact of search heuristics on heavy-tailed behaviour