Sciweavers

1244 search results - page 38 / 249
» Searching in Higher Dimension
Sort
View
CORR
2010
Springer
112views Education» more  CORR 2010»
15 years 2 months ago
Transdichotomous Results in Computational Geometry, II: Offline Search
We reexamine fundamental problems from computational geometry in the word RAM model, where input coordinates are integers that fit in a machine word. We develop a new algorithm fo...
Timothy M. Chan, Mihai Patrascu
GECCO
2008
Springer
127views Optimization» more  GECCO 2008»
15 years 3 months ago
Adaptive discretization on multidimensional continuous search spaces
This paper extends an adaptive discretization method, Spliton-Demand (SoD), to be capable of handling multidimensional continuous search spaces. The proposed extension is called m...
Jiun-Jiue Liou, Ying-Ping Chen
GECCO
2009
Springer
142views Optimization» more  GECCO 2009»
15 years 6 months ago
Benchmarking the (1+1)-CMA-ES on the BBOB-2009 noisy testbed
We benchmark an independent-restart-(1+1)-CMA-ES on the BBOB-2009 noisy testbed. The (1+1)-CMA-ES is an adaptive stochastic algorithm for the optimization of objective functions d...
Anne Auger, Nikolaus Hansen
ICDE
2006
IEEE
135views Database» more  ICDE 2006»
16 years 3 months ago
Reverse Nearest Neighbors Search in Ad-hoc Subspaces
Given an object q, modeled by a multidimensional point, a reverse nearest neighbors (RNN) query returns the set of objects in the database that have q as their nearest neighbor. I...
Man Lung Yiu, Nikos Mamoulis
SODA
1992
ACM
140views Algorithms» more  SODA 1992»
15 years 3 months ago
Separation and Approximation of Polyhedral Objects
Given a family of disjoint polygons P1, P2, : : :, Pk in the plane, and an integer parameter m, it is NP-complete to decide if the Pi's can be pairwise separated by a polygon...
Joseph S. B. Mitchell, Subhash Suri