Pages that link to "Item:Q3990655"
From MaRDI portal
The following pages link to Heuristic Sampling: A Method for Predicting the Performance of Tree Searching Programs (Q3990655):
Displaying 11 items.
- Stratified sampling for the Ising model: A graph-theoretic approach (Q311816) (← links)
- Stochastic enumeration method for counting trees (Q518856) (← links)
- Predicting optimal solution costs with bidirectional stratified sampling in regular search spaces (Q901034) (← links)
- Stochastic enumeration with importance sampling (Q1739341) (← links)
- Completeness, approximability and exponential time results for counting problems with easy decision version (Q2143122) (← links)
- Phase transitions and the search problem (Q2674173) (← links)
- Refining the phase transition in combinatorial search (Q2674181) (← links)
- From feasibility to improvement to proof: three phases of solving mixed-integer programs (Q4637827) (← links)
- Estimating the Size of Branch-and-Bound Trees (Q5085999) (← links)
- Determining if (FC-) (conflict-directed) backjumping visits a given node is NP-hard (Q5958710) (← links)
- On the power of counting the total number of computation paths of NPTMs (Q6636085) (← links)
