Sciweavers

3514 search results - page 82 / 703
» A search space
Sort
View
SISAP
2009
IEEE
134views Data Mining» more  SISAP 2009»
14 years 4 months ago
EGNAT: A Fully Dynamic Metric Access Method for Secondary Memory
—We introduce a novel metric space search data structure called EGNAT, which is fully dynamic and designed for secondary memory. The EGNAT is based on Brin’s GNAT static index,...
Roberto Uribe Paredes, Gonzalo Navarro
MICRO
1990
IEEE
147views Hardware» more  MICRO 1990»
14 years 2 months ago
Motivation and framework for using genetic algorithms for microcode compaction
Genetic algorithms are a robust adaptive optimization technique based on a biological paradigm. They perform efficient search on poorly-defined spaces by maintaining an ordered po...
Steven J. Beaty, Darrell Whitley, Gearold Johnson
ICPP
2008
IEEE
14 years 4 months ago
Bounded LSH for Similarity Search in Peer-to-Peer File Systems
Similarity search has been widely studied in peer-to-peer environments. In this paper, we propose the Bounded Locality Sensitive Hashing (Bounded LSH) method for similarity search...
Yu Hua, Bin Xiao, Dan Feng, Bo Yu
EVOW
2007
Springer
14 years 4 months ago
Iterated k-Opt Local Search for the Maximum Clique Problem
Abstract. This paper presents a simple iterated local search metaheuristic incorporating a k-opt local search (KLS), called Iterated KLS (IKLS for short), for solving the maximum c...
Kengo Katayama, Masashi Sadamatsu, Hiroyuki Narihi...
AAAI
2006
13 years 11 months ago
Memory Intensive Branch-and-Bound Search for Graphical Models
AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sens...
Radu Marinescu 0002, Rina Dechter