Sciweavers

662 search results - page 51 / 133
» Cheap and Fast - But is it Good
Sort
View
MIRRORBOT
2005
Springer
139views Robotics» more  MIRRORBOT 2005»
14 years 1 months ago
Neural Robot Detection in RoboCup
Abstract. Improving the game play in RoboCup middle size league requires a fast and robust visual robot detection system. The presented multilevel approach documents, that the comb...
Gerd Mayer, Ulrich Kaufmann, Gerhard K. Kraetzschm...
GECCO
2009
Springer
131views Optimization» more  GECCO 2009»
14 years 8 days ago
Application of a simple binary genetic algorithm to a noiseless testbed benchmark
One of the earliest evolutionary computation algorithms, the genetic algorithm, is applied to the noise-free BBOB 2009 testbed. It is adapted to the continuous domain by increasin...
Miguel Nicolau
ICRA
2000
IEEE
115views Robotics» more  ICRA 2000»
14 years 1 days ago
Virtual Obstacle Concept for Local-Minimum Recovery in Potential-Field Based Navigation
We present a navigation algorithm, which integrates virtual obstacle concept with a potential-field-based method to maneuver cylindrical mobile robots in unknown or unstructured e...
Liu Chengqing, Marcelo H. Ang, Hariharan Krishnan,...
ICPP
1989
IEEE
13 years 11 months ago
Efficient Serial and Parallel Algorithms for Median Filtering
We develop a serial algorithm for separable median filtering that requires only two comparisons per element when the window size is three. In addition, fast parallel CREW PRAM al...
Sanjay Ranka, Sartaj Sahni
CIAC
2000
Springer
121views Algorithms» more  CIAC 2000»
13 years 11 months ago
An Efficient Algorithm for the Approximate Median Selection Problem
We present an efficient algorithm for the approximate median selection problem. The algorithm works in-place; it is fast and easy to implement. For a large array it returns, with ...
Sebastiano Battiato, Domenico Cantone, Dario Catal...