The following pages link to (Q5679703):
Displaying 33 items.
- A lower bound for the quickest path problem (Q337093) (← links)
- Value-at-Risk model for hazardous material transportation (Q490229) (← links)
- Processing time-dependent shortest path queries without pre-computed speed information on road networks (Q497898) (← links)
- Heuristic search through islands (Q578930) (← links)
- Software agents architecture for controlling long-range dependent network traffic (Q596975) (← links)
- The \((n^ 2-1)\)-puzzle and related relocation problems (Q917310) (← links)
- A new bidirectional search algorithm with shortened postprocessing (Q1026755) (← links)
- A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing (Q1044022) (← links)
- Macro-operators: A weak method for learning (Q1057073) (← links)
- A new combination of input and unit deductions for Horn sentences (Q1057665) (← links)
- Depth-first iterative-deepening: An optimal admissible tree search (Q1062761) (← links)
- \(BS^*:\) An admissible bidirectional staged heuristic search algorithm (Q1115210) (← links)
- Computing shortest paths in networks derived from recurrence relations (Q1179746) (← links)
- Bidirectional heuristic search with limited resources (Q1183503) (← links)
- Optimal problem-solving search: All-or-none solutions (Q1226866) (← links)
- A new approach to the symbolic factorization of multivariate polynomials (Q1228373) (← links)
- Problem representations and formal properties of heuristic search (Q1238643) (← links)
- The one-to-one shortest-path problem: An empirical analysis with the two- tree Dijkstra algorithm (Q1260623) (← links)
- A biobjective Dijkstra algorithm (Q1728479) (← links)
- A bidirectional shortest-path algorithm with good average-case behavior (Q1823692) (← links)
- Modeling awake hippocampal reactivations with model-based bidirectional search (Q2210936) (← links)
- A parallel bio-inspired shortest path algorithm (Q2218449) (← links)
- Two new bidirectional search algorithms (Q2231042) (← links)
- Dynamically improved bounds bidirectional search (Q2238652) (← links)
- Computer science and decision theory (Q2271874) (← links)
- Heuristic shortest path algorithms for transportation applications: state of the art (Q2499162) (← links)
- Efficient Computation of Shortest Paths in Time-Dependent Multi-Modal Networks (Q2828194) (← links)
- Combining Forward and Backward Propagation (Q2964470) (← links)
- Symmetric connection problems and their solution by bidirectional search (Q3210917) (← links)
- (Q4158471) (← links)
- Iterative Deepening Dynamically Improved Bounds Bidirectional Search (Q5086001) (← links)
- Shortest-path queries in static networks (Q5176178) (← links)
- A Forward-Backward Single-Source Shortest Paths Algorithm (Q5255013) (← links)
