Sciweavers

1015 search results - page 11 / 203
» An efficient algorithm for AS path inferring
Sort
View
COMGEO
2006
ACM
13 years 8 months ago
Computing homotopic shortest paths efficiently
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
Alon Efrat, Stephen G. Kobourov, Anna Lubiw
IWANN
1997
Springer
14 years 3 days ago
Dynamic Path Planning with Spiking Neural Networks
: The path planning problem is relevant for all applications in which a mobil robot should autonomously navigate. Finding the shortest path in an environment that is only partialy ...
Ulrich Roth, Marc Walker, Arne Hilmann, Heinrich K...
CDC
2010
IEEE
136views Control Systems» more  CDC 2010»
13 years 3 months ago
Multi-resolution path planning: Theoretical analysis, efficient implementation, and extensions to dynamic environments
A multi-resolution path planning algorithm based on the wavelet transform of the environment has been reported previously in the literature. In this paper, we provide a proof of co...
Raghvendra V. Cowlagi, Panagiotis Tsiotras
TFS
2008
157views more  TFS 2008»
13 years 7 months ago
Efficient Self-Evolving Evolutionary Learning for Neurofuzzy Inference Systems
Abstract--This study proposes an efficient self-evolving evolutionary learning algorithm (SEELA) for neurofuzzy inference systems (NFISs). The major feature of the proposed SEELA i...
Cheng-Jian Lin, Cheng-Hung Chen, Chin-Teng Lin
AAAI
2010
13 years 9 months ago
Efficient Belief Propagation for Utility Maximization and Repeated Inference
Many problems require repeated inference on probabilistic graphical models, with different values for evidence variables or other changes. Examples of such problems include utilit...
Aniruddh Nath, Pedro Domingos