Searching for an optimal path in a tree with random costs
From MaRDI portal
Publication:1837534
DOI10.1016/S0004-3702(83)80006-XzbMATH Open0507.68034OpenAlexW2084077236MaRDI QIDQ1837534FDOQ1837534
Authors: Richard Karp, Judea Pearl 
Publication date: 1983
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0004-3702(83)80006-x
Applications of branching processes (60J85) Analysis of algorithms and problem complexity (68Q25) Search theory (90B40) Searching and sorting (68P10) Artificial intelligence (68T99)
Cites Work
Cited In (21)
- Greedy Search on the Binary Tree with Random Edge-Weights
- Title not available (Why is that?)
- 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
- Bayesian A* Tree Search with Expected O(N) Node Expansions: Applications to Road Tracking
- Epsilon-transformation: exploiting phase transitions to solve combinatorial optimization problems
- Phase transitions and the search problem
- 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
- Iterative state-space reduction for flexible computation
- Best-first minimax search
- Total progeny in killed branching random walk
- Downward refinement and the efficiency of hierarchical problem solving
- Limit distributions for minimal displacement of branching random walks
- 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)
