Skip to search formSkip to main contentSkip to account menu

Fringe search

In computer science, fringe search is a recent graph search algorithm that finds the least-cost path from a given initial node to one goal node. In… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
We propose a new pathfinding technique called xTrek that combines conventional pathfinding and influence fields; that is, we are… 
2016
2016
The Chinese VLBI Network correlator has been successfully adopted in the China’s lunar exploration project for probe tracking… 
2014
2014
One promising area of wireless body area networks is remotely diagnosing human health by implanting bio-medical sensors on or… 
2013
2013
—Boundary searches were introduced in pathfinding aiming to find a middle-ground between memory intensive algorithms such as the… 
Review
2012
Review
2012
Cophasing six telescopes from the CHARA array, the CHARA-Michigan Phasetracker (CHAMP) and Michigan Infrared Combiner (MIRC) are… 
2011
2011
Game developers are often faced with very demanding requirements on huge numbers of agents moving naturally through increasingly… 
2008
2007
2007
The function of fringe search is to find the maximum amplitude of complex cross-correlation function and determine the residual… 
2007
2007
Being able to achieve very high angular resolution, the Very Long Baseline Interferometry (VLBI) synthetic telescope is widely… 
2006
2006
The Sydney University Stellar Interferometer is a long baseline optical interferometer located in northern New South Wales…