Sciweavers

868 search results - page 66 / 174
» A general compression algorithm that supports fast searching
Sort
View
SSDBM
2003
IEEE
141views Database» more  SSDBM 2003»
14 years 2 months ago
The ed-tree: An Index for Large DNA Sequence Databases
The growing interest in genomic research has caused an explosive growth in the size of DNA databases making it increasely challenging to perform searches on them. In this paper, w...
Zhenqiang Tan, Xia Cao, Beng Chin Ooi, Anthony K. ...
CORR
2008
Springer
108views Education» more  CORR 2008»
13 years 9 months ago
Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning
Resolution refinements called w-resolution trees with lemmas (WRTL) and with input lemmas (WRTI) are introduced. Dag-like resolution is equivalent to both WRTL and WRTI when there...
Samuel R. Buss, Jan Hoffmann 0002, Jan Johannsen
KDD
2009
ACM
156views Data Mining» more  KDD 2009»
14 years 9 months ago
Query result clustering for object-level search
Query result clustering has recently attracted a lot of attention to provide users with a succinct overview of relevant results. However, little work has been done on organizing t...
Jongwuk Lee, Seung-won Hwang, Zaiqing Nie, Ji-Rong...
GECCO
2009
Springer
144views Optimization» more  GECCO 2009»
14 years 3 months ago
Cheating for problem solving: a genetic algorithm with social interactions
We propose a variation of the standard genetic algorithm that incorporates social interaction between the individuals in the population. Our goal is to understand the evolutionary...
Rafael Lahoz-Beltra, Gabriela Ochoa, Uwe Aickelin
GECCO
2006
Springer
206views Optimization» more  GECCO 2006»
14 years 20 days ago
A dynamically constrained genetic algorithm for hardware-software partitioning
In this article, we describe the application of an enhanced genetic algorithm to the problem of hardware-software codesign. Starting from a source code written in a high-level lan...
Pierre-André Mudry, Guillaume Zufferey, Gia...