1728 search results - page 118 / 346 » The Accelerated Euclidean Algorithm |
150
click to vote
JUCS
2007
15 years 2 months ago
2007
: We give a tight analysis of an old and popular sweep-line heuristic for constructing a spanning tree of a set of n points in the plane. The algorithm sweeps a vertical line acros...
132
click to vote
SIAMCOMP
2010
14 years 9 months ago
2010
In the first part of the paper, we reexamine the all-pairs shortest paths (APSP) problem and present a new algorithm with running time O(n3 log3 log n/ log2 n), which improves all...
127
click to vote
ICCS
2007
Springer
15 years 9 months ago
2007
Springer
In this work we study the computational complexity of a class of grid Monte Carlo algorithms for integral equations. The idea of the algorithms consists in an approximation of the ...
124
click to vote
GECCO
2010
Springer
15 years 5 months ago
2010
Springer
To successfully search multiple coadaptive subcomponents in a solution, we developed a novel cooperative evolutionary algorithm based on a new computational multilevel selection f...
124
click to vote
EUSFLAT
2009
15 years 24 days ago
2009
Fuzzy C-Means (FCM) and hard clustering are the most common tools for data partitioning. However, the presence of noisy observations in the data may cause generation of completely ...