Sciweavers

16093 search results - page 111 / 3219
» On the optimality of the neighbor-joining algorithm
Sort
View
ICCV
2005
IEEE
16 years 3 months ago
Is Levenberg-Marquardt the Most Efficient Optimization Algorithm for Implementing Bundle Adjustment?
In order to obtain optimal 3D structure and viewing parameter estimates, bundle adjustment is often used as the last step of feature-based structure and motion estimation algorith...
Manolis I. A. Lourakis, Antonis A. Argyros
ICC
2007
IEEE
166views Communications» more  ICC 2007»
15 years 8 months ago
Dynamic Optimization of Secure Mobile Sensor Networks: A Genetic Algorithm
— We propose a reduced-complexity genetic algorithm for secure and dynamic deployment of resource constrained multi-hop mobile sensor networks. Mobility and security are relative...
Rahul Khanna, Huaping Liu, Hsiao-Hwa Chen
GECCO
2007
Springer
183views Optimization» more  GECCO 2007»
15 years 7 months ago
A genetic algorithm for privacy preserving combinatorial optimization
We propose a protocol for a local search and a genetic algorithm for the distributed traveling salesman problem (TSP). In the distributed TSP, information regarding the cost funct...
Jun Sakuma, Shigenobu Kobayashi
CEC
2005
IEEE
15 years 7 months ago
Elitist generational genetic chromodynamics - a new radii-based evolutionary algorithm for multimodal optimization
A new radii-based evolutionary algorithm (EA) designed for multimodal optimization problems is proposed. The approach can be placed within the genetic chromodynamics framework and ...
Catalin Stoean, Mike Preuss, Ruxandra Gorunescu, D...
ICTAI
2005
IEEE
15 years 7 months ago
Determining the Optimal Number of Clusters Using a New Evolutionary Algorithm
Estimating the optimal number of clusters for a dataset is one of the most essential issues in cluster analysis. An improper pre-selection for the number of clusters might easily ...
Wei Lu, Issa Traoré