| C86-1080 | Computing a graph relation is a | path search algorithm | which operates over CS 's hierarchically |
| C86-1080 | class of animate entities . A | path searching algorithm | operates over tile directed graph |
| C96-1025 | The method relies on a heuristic | path search algorithm | that exploits the graphic aspects |
| C86-1080 | the record of the result of the | path search algorithm | is binary : either a satisfied |
| D11-1137 | This is written as a shortest | path search algorithm | with a tropical ( real ) semiring |
| W12-2303 | hypotheses and use the k-best | path search algorithms | instead of 1-best ( Mohri , 2002 |
