Skip to search formSkip to main contentSkip to account menu

Bidirectional search

Known as: Bi-directional search 
Bidirectional search is a graph search algorithm that finds a shortest path from an initial vertex to a goal vertex in a directed graph. It runs two… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Generative adversarial networks (GANs) have achieved outstanding success in generating the high quality data. Focusing on the… 
2015
2015
{sven.peldszus@stud|geza.kulcsar@es|malte.lochau@es}.tu-darmstadt.de Our solution to the Java Refactoring case study of the… 
2013
2013
In this paper, we consider the problem of sum rate maximization in a bidirectional relay network with fading. Hereby, user 1 and… 
2010
2010
This paper presents a procedure for the design of a fuzzy logic controller for the garaging of a wheeled mobile robot, with non… 
2010
2010
We present an approach to improve the search efficiency for near‐optimal motion synthesis using motion graphs. An optimal or near… 
2007
2007
A novel algorithm is presented for broadcasting in the singl e-port and duplex model on a completely connected interconnection… 
2005
2005
The paper describes the study of the multichannel upgrade of IEEE Standard 802.17 Resilient Packet Ring (RPR) in particular and… 
2005
2005
In this paper we present a novel abstraction layer above the well-known triangular 1-to-4 split sub-division based on hexagons… 
2001
2001
Perhaps the most critical component in determining the ultimate performance potential of a multicomputer is its interconnection… 
1993
1993
Bi-rewriting systems introduced in LA93] allow to derive inclusion relations a b between terms built up from monotonic operators…