Sciweavers

380 search results - page 24 / 76
» Projective Least-Squares: Global Solutions with Local Optimi...
Sort
View
SCIA
2007
Springer
149views Image Analysis» more  SCIA 2007»
15 years 4 months ago
Triangulation of Points, Lines and Conics
The problem of reconstructing 3D scene features from multiple views with known camera motion and given image correspondences is considered. This is a classical and one of the most...
Klas Josephson, Fredrik Kahl
GECCO
2005
Springer
138views Optimization» more  GECCO 2005»
15 years 3 months ago
Artificial immune system for solving generalized geometric problems: a preliminary results
Generalized geometric programming (GGP) is an optimization method in which the objective function and constraints are nonconvex functions. Thus, a GGP problem includes multiple lo...
Jui-Yu Wu, Yun-Kung Chung
CP
2005
Springer
15 years 3 months ago
Solving Large-Scale Nonlinear Programming Problems by Constraint Partitioning
Abstract. In this paper, we present a constraint-partitioning approach for finding local optimal solutions of large-scale mixed-integer nonlinear programming problems (MINLPs). Ba...
Benjamin W. Wah, Yixin Chen
ICRA
2008
IEEE
114views Robotics» more  ICRA 2008»
15 years 4 months ago
Lazy localization using the Frozen-Time Smoother
— We present a new algorithm for solving the global localization problem called Frozen-Time Smoother (FTS). Time is ‘frozen’, in the sense that the belief always refers to th...
Andrea Censi, Gian Diego Tipaldi
NN
2000
Springer
128views Neural Networks» more  NN 2000»
14 years 9 months ago
A recurrent neural network for solving linear projection equations
Linear projection equations arise in many optimization problems and have important applications in science and engineering. In this paper, we present a recurrent neural network fo...
Youshen Xia, Jun Wang