Heuristic Sampling: A Method for Predicting the Performance of Tree Searching Programs
From MaRDI portal
Publication:3990655
DOI10.1137/0221022zbMath0747.68031OpenAlexW2072378654MaRDI QIDQ3990655
Publication date: 28 June 1992
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/bf809a1d08116367f661b7597d65fa7a375d2ca9
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Monte Carlo methods (65C05)
Related Items
Completeness, approximability and exponential time results for counting problems with easy decision version, Stratified sampling for the Ising model: A graph-theoretic approach, Estimating the Size of Branch-and-Bound Trees, Phase transitions and the search problem, Refining the phase transition in combinatorial search, Predicting optimal solution costs with bidirectional stratified sampling in regular search spaces, From feasibility to improvement to proof: three phases of solving mixed-integer programs, Stochastic enumeration with importance sampling, Stochastic enumeration method for counting trees, Determining if (FC-) (conflict-directed) backjumping visits a given node is NP-hard
