scientific article; zbMATH DE number 3415384
From MaRDI portal
zbMath0263.68021MaRDI QIDQ5679703
Publication date: 1971
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
A lower bound for the quickest path problem, \(BS^*:\) An admissible bidirectional staged heuristic search algorithm, Unnamed Item, Software agents architecture for controlling long-range dependent network traffic, Iterative Deepening Dynamically Improved Bounds Bidirectional Search, Symmetric connection problems and their solution by bidirectional search, Combining Forward and Backward Propagation, Modeling awake hippocampal reactivations with model-based bidirectional search, The \((n^ 2-1)\)-puzzle and related relocation problems, A parallel bio-inspired shortest path algorithm, A biobjective Dijkstra algorithm, Computing shortest paths in networks derived from recurrence relations, Two new bidirectional search algorithms, Value-at-Risk model for hazardous material transportation, Bidirectional heuristic search with limited resources, Processing time-dependent shortest path queries without pre-computed speed information on road networks, Dynamically improved bounds bidirectional search, Shortest-path queries in static networks, Optimal problem-solving search: All-or-none solutions, Computer science and decision theory, A new approach to the symbolic factorization of multivariate polynomials, Heuristic shortest path algorithms for transportation applications: state of the art, Heuristic search through islands, Problem representations and formal properties of heuristic search, The one-to-one shortest-path problem: An empirical analysis with the two- tree Dijkstra algorithm, A new bidirectional search algorithm with shortened postprocessing, Efficient Computation of Shortest Paths in Time-Dependent Multi-Modal Networks, A bidirectional shortest-path algorithm with good average-case behavior, A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing, A Forward-Backward Single-Source Shortest Paths Algorithm, Macro-operators: A weak method for learning, A new combination of input and unit deductions for Horn sentences, Depth-first iterative-deepening: An optimal admissible tree search
