Searching for an optimal path in a tree with random costs
From MaRDI portal
(Redirected from Publication:1837534)
Cites work
- scientific article; zbMATH DE number 3172224 (Why is no real title available?)
- scientific article; zbMATH DE number 3574966 (Why is no real title available?)
- scientific article; zbMATH DE number 3190745 (Why is no real title available?)
- Minimal displacement of branching random walk
- The Galton-Watson process with infinite mean
Cited in
(21)- Greedy Search on the Binary Tree with Random Edge-Weights
- scientific article; zbMATH DE number 1334602 (Why is no real title available?)
- Performance of linear-space search algorithms
- A study of complexity transitions on the asymmetric traveling salesman problem
- Search cost for a nearly optimal path in a binary tree
- Efficient approximation of branching random walk Gibbs measures
- 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
- An incremental negamax algorithm
- On look-ahead and pathology in decision tree learning
- Real-time heuristic search
- Performance of linear-space search algorithms
- Heuristic search under contract
- Best-first minimax search
- Iterative state-space reduction for flexible computation
- Total progeny in killed branching random walk
- Limit distributions for minimal displacement of branching random walks
- Downward refinement and the efficiency of hierarchical problem solving
- Average-case analysis of best-first search in two representative directed acyclic graphs
- Bounded branching process and and/or tree evaluation
This page was built for publication: Searching for an optimal path in a tree with random costs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1837534)
