Sciweavers

4198 search results - page 82 / 840
» In search of lost time
Sort
View
GECCO
2009
Springer
115views Optimization» more  GECCO 2009»
15 years 10 months ago
Benchmarking the pure random search on the BBOB-2009 testbed
We benchmark the pure random search algorithm on the BBOB 2009 noise-free testbed. Each candidate solution is sampled uniformly in [−5, 5]D , where D denotes the search space di...
Anne Auger, Raymond Ros
GECCO
2009
Springer
118views Optimization» more  GECCO 2009»
15 years 10 months ago
Benchmarking the pure random search on the BBOB-2009 noisy testbed
We benchmark the Pure-Random-Search algorithm on the BBOB 2009 noisy testbed. Each candidate solution is sampled uniformly in [−5, 5]D , where D denotes the search space dimensi...
Anne Auger, Raymond Ros
CCCG
2003
15 years 7 months ago
Multidimensional Orthogonal Range Search Using Tries
We present a novel k-dimensional range search algorithm for reporting all k-d rectangles from a set D of size n intersecting a query rectangle. Our algorithm uses 2kd tries to sol...
Lingke Bu, Bradford G. Nickerson
JOT
2008
125views more  JOT 2008»
15 years 5 months ago
On Web Search: Some Activities and Challenges
Internet search engines have become an indispensable part of everyday living and business today. Although the capabilities of Internet search engines are incrementally improving s...
Won Kim, Ok-Ran Jeong, Hyungsuk Ji, Sangwon Lee
IPL
2006
72views more  IPL 2006»
15 years 5 months ago
Structure and linear time recognition of 3-leaf powers
A graph G is the k-leaf power of a tree T if its vertices are leaves of T such that two vertices are adjacent in G if and only if their distance in T is at most k. Then T is the k...
Andreas Brandstädt, Van Bang Le