Sciweavers

4114 search results - page 22 / 823
» Efficient Algorithms for the 2-Center Problems
Sort
View
EVOW
2006
Springer
15 years 8 months ago
Fast EAX Algorithm Considering Population Diversity for Traveling Salesman Problems
This paper proposes an evolutionary algorithm (EA) that is applied to the traveling salesman problem (TSP). Existing approximation methods to address the TSP known to be state-of-t...
Yuichi Nagata
GECCO
2004
Springer
101views Optimization» more  GECCO 2004»
15 years 9 months ago
A Novel Multi-objective Orthogonal Simulated Annealing Algorithm for Solving Multi-objective Optimization Problems with a Large
In this paper, a novel multi-objective orthogonal simulated annealing algorithm MOOSA using a generalized Pareto-based scale-independent fitness function and multi-objective intell...
Li-Sun Shu, Shinn-Jang Ho, Shinn-Ying Ho, Jian-Hun...
IWOCA
2010
Springer
219views Algorithms» more  IWOCA 2010»
14 years 11 months ago
Efficient Chaining of Seeds in Ordered Trees
We consider here the problem of chaining seeds in ordered trees. Seeds are mappings between two trees Q and T and a chain is a subset of non overlapping seeds that is consistent wi...
Julien Allali, Cedric Chauve, Pascal Ferraro, Anne...
ESANN
2003
15 years 5 months ago
On Convergence Problems of the EM Algorithm for Finite Gaussian Mixtures
Efficient probability density function estimation is of primary interest in statistics. A popular approach for achieving this is the use of finite Gaussian mixture models. Based on...
Cédric Archambeau, John Aldo Lee, Michel Ve...
CORR
2010
Springer
98views Education» more  CORR 2010»
15 years 4 months ago
Efficient Sketches for the Set Query Problem
We develop an algorithm for estimating the values of a vector x Rn over a support S of size k from a randomized sparse binary linear sketch Ax of size O(k). Given Ax and S, we ca...
Eric Price