Sciweavers

3514 search results - page 42 / 703
» A search space
Sort
View
SPIRE
1998
Springer
14 years 1 months ago
Fast Approximate String Matching in a Dictionary
A successful technique to search large textual databases allowing errors relies on an online search in the vocabulary of the text. To reduce the time of that online search, we ind...
Ricardo A. Baeza-Yates, Gonzalo Navarro
VLDB
2000
ACM
166views Database» more  VLDB 2000»
14 years 13 days ago
What Is the Nearest Neighbor in High Dimensional Spaces?
Nearest neighbor search in high dimensional spaces is an interesting and important problem which is relevant for a wide variety of novel database applications. As recent results s...
Alexander Hinneburg, Charu C. Aggarwal, Daniel A. ...
AAECC
2009
Springer
150views Algorithms» more  AAECC 2009»
14 years 3 months ago
Rooted Trees Searching for Cocyclic Hadamard Matrices over D4t
A new reduction on the size of the search space for cocyclic Hadamard matrices over dihedral groups D4t is described, in terms of the so called central distribution. This new searc...
Víctor Álvarez, José Á...
CP
2008
Springer
13 years 10 months ago
Approximate Solution Sampling (and Counting) on AND/OR Spaces
In this paper, we describe a new algorithm for sampling solutions from a uniform distribution over the solutions of a constraint network. Our new algorithm improves upon the Sampli...
Vibhav Gogate, Rina Dechter
GECCO
2007
Springer
160views Optimization» more  GECCO 2007»
14 years 3 months ago
Quick-and-dirty ant colony optimization
Ant colony optimization (ACO) is a well known metaheuristic. In the literature it has been used for tackling many optimization problems. Often, ACO is hybridized with a local sear...
Paola Pellegrini, Elena Moretti