scientific article; zbMATH DE number 67459
From MaRDI portal
Publication:4012185
Recommendations
- A theoretical evaluation of selected backtracking algorithms.
- scientific article; zbMATH DE number 2065281
- scientific article; zbMATH DE number 2159023
- An average analysis of backtracking on random constraint satisfaction problems
- Efficiency of randomized parallel backtrack search
- Expected Performance of m-Solution Backtracking
- Quasiconvex analysis of backtracking algorithms
- An overview of backtrack search satisfiability algorithms
- Toward a model for backtracking and dynamic programming
- Random backtracking in backtrack search algorithms for satisfiability
Cited in
(18)- scientific article; zbMATH DE number 1334602 (Why is no real title available?)
- Performance of linear-space search algorithms
- scientific article; zbMATH DE number 1786154 (Why is no real title available?)
- A study of complexity transitions on the asymmetric traveling salesman problem
- Expected hitting times for Backtracking Adaptive Search
- Formal Concept Analysis
- Epsilon-transformation: exploiting phase transitions to solve combinatorial optimization problems
- Phase transitions and the search problem
- Bayesian A* Tree Search with Expected O(N) Node Expansions: Applications to Road Tracking
- scientific article; zbMATH DE number 2065281 (Why is no real title available?)
- Performance of linear-space search algorithms
- A theoretical evaluation of selected backtracking algorithms.
- Best-first minimax search
- Iterative state-space reduction for flexible computation
- Amortized random backtracking
- Expected Performance of m-Solution Backtracking
- Downward refinement and the efficiency of hierarchical problem solving
- Average-case analysis of best-first search in two representative directed acyclic graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4012185)
