Sciweavers

1233 search results - page 1 / 247
» Extensible Point Location Algorithm
Sort
View
GMP
2003
IEEE
13 years 10 months ago
Extensible Point Location Algorithm
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...
Rashmi Sundareswara, Paul R. Schrater
ALGORITHMICA
2004
130views more  ALGORITHMICA 2004»
13 years 4 months ago
The Power of Priority Algorithms for Facility Location and Set Cover
We apply and extend the priority algorithm framework introduced by Borodin, Nielsen, and Rackoff to define "greedy-like" algorithms for the (uncapacitated) facility locat...
Spyros Angelopoulos, Allan Borodin
COCOA
2008
Springer
13 years 6 months ago
New Algorithms for k-Center and Extensions
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...
René Brandenberg, Lucia Roth
PERVASIVE
2010
Springer
13 years 3 months ago
LOC8: A Location Model and Extensible Framework for Programming with Location
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...
GECCO
2000
Springer
13 years 8 months ago
Sampling Bias and Search Space Boundary Extension in Real Coded Genetic Algorithms
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 ...
Shigeyoshi Tsutsui