Sciweavers

1093 search results - page 131 / 219
» Crossover in Probability Spaces
Sort
View
JIRS
2007
108views more  JIRS 2007»
13 years 10 months ago
GODZILA: A Low-resource Algorithm for Path Planning in Unknown Environments
— In this paper, we propose a novel path-planning and obstacle avoidance algorithm GODZILA for navigation in unknown environments. No prior knowledge of the environment is requir...
Prashanth Krishnamurthy, Farshad Khorrami
AROBOTS
2002
126views more  AROBOTS 2002»
13 years 10 months ago
Selecting Landmarks for Localization in Natural Terrain
We describe techniques to optimally select landmarks for performing mobile robot localization by matching terrain maps. The method is based upon a maximum-likelihood robot localiza...
Clark F. Olson
CJ
2002
67views more  CJ 2002»
13 years 10 months ago
Using Bloom Filters to Speed-up Name Lookup in Distributed Systems
Bloom filters make use of a "probabilistic" hash-coding method to reduce the amount of space required to store a hash set. A Bloom filter offers a trade-off between its ...
Mark C. Little, Santosh K. Shrivastava, Neil A. Sp...
IJCV
2000
161views more  IJCV 2000»
13 years 10 months ago
Probabilistic Detection and Tracking of Motion Boundaries
We propose a Bayesian framework for representing and recognizing local image motion in terms of two basic models: translational motion and motion boundaries. Motion boundaries are ...
Michael J. Black, David J. Fleet
IJON
2000
76views more  IJON 2000»
13 years 10 months ago
Fast neural network simulations with population density methods
The complexity of neural networks of the brain makes studying these networks through computer simulation challenging. Conventional methods, where one models thousands of individua...
Duane Q. Nykamp, Daniel Tranchina