We present a general walk-through point location algorithm for use with general polyhedron lattices and polygonal meshes assuming the usage of nothing more than a simple linked li...
We apply and extend the priority algorithm framework introduced by Borodin, Nielsen, and Rackoff to define "greedy-like" algorithms for the (uncapacitated) facility locat...
The problem of interest is covering a given point set with homothetic copies of several convex containers C1,...,Ck, while the objective is to minimize the maximum over the dilatat...
ing model abstracts over various types of positioning systems and incorporates the capture of uncertainty, serving as a foundation on which developers can apply sensor-fusion techn...
Graeme Stevenson, Juan Ye, Simon Dobson, Paddy Nix...
In Real coded genetic algorithms, some crossover operators do not work well on functions which have their optimum at the corner of the search space. To cope with this problem, we ...