Online social networks greatly promote peoples' online interaction, where trust plays a
crucial role. Trust prediction with trust path search is widely used to help users find the …

Heuristic search guides the exploration of states via heuristic functions h estimating
remaining cost. Symbolic search instead replaces the exploration of individual states with …

Recent work in bidirectional heuristic search characterize pairs of nodes from which at least
one node must be expanded in order to ensure optimality of solutions. We use these …

Recently, the proposal of individual bounds that use consistent heuristics in front-to-end
bidirectional search has improved the state of the art. However, modern theory in …

The shortest path problem is the problem of finding a path with minimum total weight from a
source node to each destination node in a network. The existing solution to this fundamental …

We combine ideas from uni-directional and bi-directional heuristic search, and
approximation algorithms for the Traveling Salesman Problem, to develop a novel …

This paper presents a bidirectional search algorithm that dynamically improves the bounds
during its execution. It has the property that it always terminates on or before the forward …

This paper presents two new bidirectional heuristic search algorithms for solving the shortest
path problem on graphs: consistent-heuristic bucket-based bidirectional search (CBBS) and …

Planning a collision-free path efficiently among obstacles is crucial in robotics. Conventional
one-shot unidirectional path planning algorithms work well in the static environment, but …

Abstract Parallelization and External Memory (PEM) techniques significantly enhance the
capabilities of search algorithms for solving large-scale problems. While previous research …