562 search results - page 82 / 113 » Simple Randomized Algorithms for Closest Pair Problems |
SMA
2009
ACM
14 years 3 months ago
2009
ACM
We examine the problem of computing exactly the Delaunay graph (and the dual Voronoi diagram) of a set of, possibly intersecting, smooth convex pseudo-circles in the Euclidean pla...
JEA
2006
13 years 8 months ago
2006
In this paper we show cache-friendly implementations of the Floyd-Warshall algorithm for the All-Pairs ShortestPath problem. We first compare the best commercial compiler optimiza...
CEC
2009
IEEE
14 years 3 months ago
2009
IEEE
— Differential Evolution (DE) is a novel evolutionary approach capable of handling non-differentiable, non-linear and multi-modal objective functions. DE has been consistently ra...
JCB
1998
13 years 8 months ago
1998
Abstract. The method of invariants is an approach to the problem of reconstructing the phylogenetic tree of a collection of m taxa using nucleotide sequence data. Models for the re...
ESA
1995
Springer
14 years 2 days ago
1995
Springer
An input to the betweenness problem contains m constraints over n real variables (points). Each constraint consists of three points, where one of the points is specified to lie in...