Sciweavers

167 search results - page 1 / 34
» Adaptive Searching in One and Two Dimensions
Sort
View
CCCG
2008
13 years 6 months ago
Adaptive Searching in One and Two Dimensions
Reza Dorrigiv, Alejandro López-Ortiz
GECCO
2004
Springer
13 years 10 months ago
A Polynomial Upper Bound for a Mutation-Based Algorithm on the Two-Dimensional Ising Model
Abstract. Fitness functions based on the Ising model are suited excellently for studying the adaption capabilities of randomised search heuristics. The one-dimensional Ising model ...
Simon Fischer
SSDBM
2009
IEEE
192views Database» more  SSDBM 2009»
13 years 11 months ago
MLR-Index: An Index Structure for Fast and Scalable Similarity Search in High Dimensions
High-dimensional indexing has been very popularly used for performing similarity search over various data types such as multimedia (audio/image/video) databases, document collectio...
Rahul Malik, Sangkyum Kim, Xin Jin, Chandrasekar R...
GLOBECOM
2009
IEEE
13 years 8 months ago
Near-ML Detection over a Reduced Dimension Hypersphere
Abstract--In this paper, we propose a near-maximum likelihood (ML) detection method referred to as reduced dimension ML search (RD-MLS). The RD-MLS detector is based on a partition...
Jun Won Choi, Byonghyo Shim, Andrew C. Singer
APIN
2000
120views more  APIN 2000»
13 years 4 months ago
Two-Loop Real-Coded Genetic Algorithms with Adaptive Control of Mutation Step Sizes
Genetic algorithms are adaptive methods based on natural evolution that may be used for search and optimization problems. They process a population of search space solutions with t...
Francisco Herrera, Manuel Lozano