Sciweavers

1244 search results - page 46 / 249
» Searching in Higher Dimension
Sort
View
SODA
2004
ACM
155views Algorithms» more  SODA 2004»
13 years 11 months ago
Navigating nets: simple algorithms for proximity search
d Abstract] Robert Krauthgamer James R. Lee We present a simple deterministic data structure for maintaining a set S of points in a general metric space, while supporting proximit...
Robert Krauthgamer, James R. Lee
GECCO
2007
Springer
191views Optimization» more  GECCO 2007»
14 years 4 months ago
One-test-at-a-time heuristic search for interaction test suites
Algorithms for the construction of software interaction test suites have focussed on the special case of pairwise coverage; less is known about efficiently constructing test suite...
Renée C. Bryce, Charles J. Colbourn
GECCO
2009
Springer
135views Optimization» more  GECCO 2009»
14 years 2 months ago
Benchmarking the (1+1)-ES with one-fifth success rule on the BBOB-2009 noisy testbed
The (1+1)-ES with one-fifth success rule is one of the first and simplest stochastic algorithm proposed for optimization on a continuous search space in a black-box scenario. In...
Anne Auger
WISE
2007
Springer
14 years 4 months ago
Optimization of Bounded Continuous Search Queries Based on Ranking Distributions
A common search problem in the World Wide Web concerns finding information if it is not known when the sources of information appear and how long sources will be available on the ...
Dirk Kukulenz, Nils Hoeller, Sven Groppe, Volker L...
SDM
2007
SIAM
204views Data Mining» more  SDM 2007»
13 years 11 months ago
Flexible Anonymization For Privacy Preserving Data Publishing: A Systematic Search Based Approach
k-anonymity is a popular measure of privacy for data publishing: It measures the risk of identity-disclosure of individuals whose personal information are released in the form of ...
Bijit Hore, Ravi Chandra Jammalamadaka, Sharad Meh...