most citedA Java Implementation of Parameter-less Evolutionary Algorithms

2 citations · 4 across the 4 of their papers we have counts for

collaborators
Showing cs.CGShow all

1 paper · 1 filter

cs.CG2010

An Optimized Divide-and-Conquer Algorithm for the Closest-Pair Problem in the Planar Case

José C. Pereira, Fernando G. Lobo

We present an engineered version of the divide-and-conquer algorithm for finding the closest pair of points, within a given set of points in the XY-plane. For this version of the a…