Sciweavers

1144 search results - page 34 / 229
» Fractal Algorithm for Finding Global Optimal Solution
Sort
View
ICCV
2003
IEEE
15 years 11 months ago
Globally Convergent Autocalibration
Existing autocalibration techniques use numerical optimization algorithms that are prone to the problem of local minima. To address this problem, we have developed a method where ...
Arrigo Benedetti, Alessandro Busti, Michela Farenz...
64
Voted
GECCO
2005
Springer
153views Optimization» more  GECCO 2005»
15 years 3 months ago
Finding needles in haystacks is harder with neutrality
This research presents an analysis of the reported successes of the Cartesian Genetic Programming method on a simplified form of the Boolean parity problem. We show the method of...
M. Collins
SWARM
2010
SPRINGER
420views Optimization» more  SWARM 2010»
14 years 8 months ago
Fireworks Algorithm for Optimization
Abstract. Inspired by observing fireworks explosion, a novel swarm intelligence algorithm, called Fireworks Algorithm (FA), is proposed for global optimization of complex function...
Ying Tan, Yuanchun Zhu
77
Voted
ICCV
2009
IEEE
16 years 2 months ago
Multimodal Partial Estimates Fusion
Fusing partial estimates is a critical and common problem in many computer vision tasks such as part-based detection and tracking. It generally becomes complicated and intractab...
Jiang Xu, Junsong Yuan, YingWu
71
Voted
ICRA
2000
IEEE
111views Robotics» more  ICRA 2000»
15 years 2 months ago
Learning Globally Consistent Maps by Relaxation
Mobile robots require the ability to build their own maps to operate in unknown environments. A fundamental problem is that odometry-based dead reckoning cannot be used to assign ...
Tom Duckett, Stephen Marsland, Jonathan Shapiro