Sciweavers

1914 search results - page 24 / 383
» Evaluation of a Catalytic Search Algorithm
Sort
View
SIGMOD
2009
ACM
155views Database» more  SIGMOD 2009»
16 years 6 months ago
Efficient top-k algorithms for fuzzy search in string collections
An approximate search query on a collection of strings finds those strings in the collection that are similar to a given query string, where similarity is defined using a given si...
Rares Vernica, Chen Li
ICRA
2008
IEEE
119views Robotics» more  ICRA 2008»
16 years 10 days ago
Towards schema-based, constructivist robot learning: Validating an evolutionary search algorithm for schema chunking
— In this paper, we lay the groundwork for extending our previously developed ASyMTRe architecture to enable constructivist learning for multi-robot team tasks. The ASyMTRe archi...
Yifan Tang, Lynne E. Parker
GECCO
2009
Springer
161views Optimization» more  GECCO 2009»
15 years 10 months ago
Benchmarking the BFGS algorithm on the BBOB-2009 noisy testbed
The BFGS quasi-Newton method is benchmarked on the noisy BBOB-2009 testbed. A multistart strategy is applied with a maximum number of function evaluations of about 104 times the s...
Raymond Ros
SAC
2004
ACM
15 years 11 months ago
Solving the maximum clique problem by k-opt local search
This paper presents a local search algorithm based on variable depth search, called the k-opt local search, for the maximum clique problem. The k-opt local search performs add and...
Kengo Katayama, Akihiro Hamamoto, Hiroyuki Narihis...
INFOSCALE
2007
ACM
15 years 7 months ago
A distributed incremental nearest neighbor algorithm
Searching for non-text data (e.g., images) is mostly done by means of metadata annotations or by extracting the text close to the data. However, supporting real content-based audi...
Fabrizio Falchi, Claudio Gennaro, Fausto Rabitti, ...