A generative power-law search tree model

DOI10.1016/j.cor.2008.08.017zbMath1179.90173OpenAlexW2073288358WikidataQ57710950 ScholiaQ57710950MaRDI QIDQ1010292

Nuno Crato, Alda Carvalho, Carla P. Gomes

Publication date: 3 April 2009

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2008.08.017

zbMATH Keywords

heavy-tailscomputational statisticsrandom algorithms

Mathematics Subject Classification ID

Search theory (90B40) Artificial intelligence (68T99)

Related Items

A Generator of Heavy-Tailed Search Trees

Uses Software

• Chaff
• BerkMin

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Statistical regimes across constrainedness regions
• The impact of search heuristics on heavy-tailed behaviour
• The hardest constraint problems: A double phase transition
• Easy problems are sometimes hard
• Heavy-tailed phenomena in satisfiability and constraint satisfaction problems
• BerkMin: A fast and robust SAT-solver
• Random backtracking in backtrack search algorithms for satisfiability
• Phase transitions and the search problem
• GRASP: a search algorithm for propositional satisfiability
• A Brief History of Generative Models for Power Law and Lognormal Distributions
• Theory and Applications of Satisfiability Testing
• A Computing Procedure for Quantification Theory
• A machine program for theorem-proving
• Principles and Practice of Constraint Programming – CP 2004

This page was built for publication: A generative power-law search tree model