Searching for an Optimal Path in a Tree with Random Costs

No abstract is available for this paper.

• Publication year

  1983

• Venue

  Artificial Intelligence

• Publication date

  1983-03-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1016/S0004-3702(83)80006-X
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Minimal displacement of branching random walk

  1978cited by this paper
• Review of "Problem-Solving Methods in Artificial Intelligence by Nils J. Nilsson", McGraw-Hill Pub.

  1971cited by this paper
• The Galton-Watson process with infinite mean

  1970cited by this paper
• The Theory of Branching Processes.

  1963cited by this paper
• Error-Correcting Codes.

  1962cited by this paper

• Selected Annotated Bibliography by Judea Pearl

  2022cites this paper
• Efficient approximation of branching random walk Gibbs measures

  2021cites this paper
• LOCATION AWARE ADVERTISING USING INFLUENCE MAXIMIZATION

  2019cites this paper
• Influence Maximization in Trajectory Databases

  2017cites this paper
• A Stochastic Process Model of Classical Search

  2015influential citation
• Analysis of approximation and uncertainty in optimization

  2015cites this paper
• Cooperative Heuristic Search with Software Agents

  2014cites this paper
• Predicting the Performance of IDA* using Conditional Distributions

  2014cites this paper
• Alpha-Beta Pruning and Althöfer's Pathology-Free Negamax Algorithm

  2012cites this paper
• PHA*: Finding the Shortest Path with A* in An Unknown Physical Environment

  2011cites this paper
• Dynamic Programming and Graph Algorithms in Computer Vision

  2011cites this paper
• Phase Transitions and Backbones of the Asymmetric Traveling Salesman Problem

  2011cites this paper
• HEURISTIC SEARCH UNDER CONTRACT

  2010cites this paper
• Heuristic algorithm for interpretation of multi-valued attributes in similarity-based fuzzy relational databases

  2010cites this paper
• Branching random walk and searching in trees: final report

  2010influential citation
• An Instance-Based Learning Approach for Available-Memory Non-minimal Cost-Bounded Search

  2009cites this paper
• Total progeny in killed branching random walk

  2009cites this paper
• Selecting Informative Universum Sample for Semi-Supervised Learning

  2009cites this paper
• Predicting the Performance of IDA* with Conditional Distributions

  2008cites this paper
• Search cost for a nearly optimal path in a binary tree

  2007cites this paper
• On look-ahead and pathology in decision tree learning

  2005cites this paper
• Average-case analysis of best-first search in two representative directed acyclic graphs

  2004cites this paper
• Flexible and Scalable Methods for Multi-Agent Distributed Resource Allocations by Exploiting Phase Transitions

  2004cites this paper
• On Lookahead Heuristics in Decision Tree Learning

  2003cites this paper
• Phase Transitions of the Asymmetric Traveling Salesman

  2003cites this paper
• A large deviation theory analysis of Bayesian tree search

  2003cites this paper
• KBFS: K-Best-First Search

  2003cites this paper
• An average-case analysis of graph search

  2002cites this paper
• Bayesian A Tree Search with Expected O(N) Node Expansions: Applications to Road Tracking

  2002cites this paper
• Effort profiles in multi-agent resource allocation

  2002cites this paper
• Iterative state-space reduction for flexible computation

  2001cites this paper
• AORIST: Identifying Dynamic Behavior in ANTs

  2001cites this paper
• Phase Transitions and Backbones of 3-SAT and Maximum 3-SAT

  2001cites this paper
• AORIST : Identifying Dynamic Behavior in ANTs Prepared

  2001cites this paper
• Dynamic Task Scheduling Using Online Optimization

  2000cites this paper
• Analysis of random trees

  2000cites this paper
• Extremal paths on a random cayley tree

  2000cites this paper
• On the complexity of branch-and bound search for random trees

  1999cites this paper
• Bayesian A* Tree Search with Expected O(N) Convergence Rates for Road Tracking

  1999cites this paper
• Phase transitions in project scheduling

  1999cites this paper
• State-Space Search

  1999cites this paper
• On-Line Optimization Techniques for Task Scheduling in Multiprocessor Systems

  1999cites this paper
• Flexible and Approximate Computation through State-Space Reduction

  1998cites this paper
• Branching Processes and Their Applications in the Analysis of Tree Structures and Tree Algorithms

  1998cites this paper
• A Metropolis-Type Optimization Algorithm on the Infinite Tree

  1998cites this paper
• CAN’T GET NO SATISFACTION

  1997cites this paper
• CAN’T GET NO SATISFACTION

  1997cites this paper
• A Study of Complexity Transitions on the Asymmetric Traveling Salesman Problem

  1996cites this paper
• Forward Estimation for Game-Tree Search

  1996cites this paper
• Dynamic scheduling strategies for shared-memory multiprocessors

  1996cites this paper
• Best-First Minimax Search

  1996cites this paper
• Epsilon-Transformation: Exploiting Phase Transitions to Solve Combinatorial Optimization Problems

  1996cites this paper
• Phase Transitions and the Search Problem

  1996cites this paper
• Bounded Branching Process AND/OR Tree Evaluation

  1995cites this paper
• Performance of Linear-Space Search Algorithms

  1995cites this paper
• Epsilon-Transformation: Exploiting Phase Transitions to Solve Combinatorial Optimization Problems Initial Results

  1994influential citation
• An Incremental Search Approach to Real-Time Decision Making

  1994cites this paper
• Downward Refinement and the Efficiency of Hierarchical Problem Solving

  1994cites this paper
• Incremental Search Algorithms for Real-time Decision Making

  1994cites this paper
• A decision structure using generalized and/or trees containing chance nodes

  1994cites this paper
• Finite Branching Processes and AND/OR Tree Evaluation

  1994cites this paper
• THE TYPICALITY OF PHASE TRANSITIONS IN SEARCH

  1993cites this paper
• Downward Reenement and the Eeciency of Hierarchical Problem Solving

  1993cites this paper
• Depth-First vs. Best-First Search: New Results

  1993cites this paper
• The Expected Value of Hierarchical Problem-Solving

  1992cites this paper
• Computational Complexity And Phase Transitions

  1992cites this paper
• Greedy Search on the Binary Tree with Random Edge-Weights

  1992cites this paper
• Am Average-Case with Applications: Summary of

  1992cites this paper
• An Average-Case Analysis of Branch-and-Bound with Applications: Summary of Results

  1992cites this paper
• Limit distributions for minimal displacement of branching random walks

  1991cites this paper
• Where the Really Hard Problems Are

  1991cites this paper
• An Expected-Cost Analysis of Backtracking and Non-Backtracking Algorithms

  1991influential citation
• Real-Time Heuristic Search

  1990cites this paper
• An Incremental Negamax Algorithm

  1990cites this paper
• Average case analysis of graph-searching algorithms

  1990cites this paper
• A Nonlinear Evolution with Travelling Waves

  1990cites this paper
• Probabilistic analysis of tree search

  1990cites this paper
• Hierarchical parallel search for markov control with enhanced selector

  1989cites this paper
• Hierarchical parallel search in a Markov controller

  1989cites this paper
• MPS: An artificially intelligent software system for the analysis and synthesis of metabolic pathways

  1988cites this paper
• Expected Performance of m-Solution Backtracking

  1988cites this paper
• Real-time heuristic search: new results

  1988cites this paper
• Phase Transitions in Artificial Intelligence Systems

  1987cites this paper
• Artificial intelligence and large scale computation: A physics perspective

  1987cites this paper
• Percolation and the complexity of games

  1987influential citation
• Optimal Allocation of Very Limited Search Resources

  1986cites this paper
• The Average Complexity of Depth-First Search with Backtracking and Cutoff

  1986cites this paper
• What search algorithm gives optimal average-case performance when search resources are highly limited?

  1986cites this paper
• Generalized best-first search strategies and the optimality of A*

  1985cites this paper
• Relative Entropy, Probabilistic Inference, and AI

  1985cites this paper
• On the Discovery and Generation of Certain Heuristics

  1983cites this paper
• Expected Performance of M-solution Backtracking Nl\si\ National Aeronautics and Space Administration

  year unknowncites this paper
• P vs NP Problem

  year unknowncites this paper