Sciweavers

1614 search results - page 88 / 323
» Breadth-First Heuristic Search
Sort
View
SAC
2009
ACM
15 years 11 months ago
Exploiting weak dependencies in tree-based search
In this work, our objective is to heuristically discover a simplified form of functional dependencies between variables called weak dependencies. Once discovered, these relations...
Alejandro Arbelaez, Youssef Hamadi
CSB
2005
IEEE
125views Bioinformatics» more  CSB 2005»
15 years 9 months ago
On Optimizing Distance-Based Similarity Search for Biological Databases
Similarity search leveraging distance-based index structures is increasingly being used for both multimedia and biological database applications. We consider distance-based indexi...
Rui Mao, Weijia Xu, Smriti R. Ramakrishnan, Glen N...
148
Voted
DATESO
2007
157views Database» more  DATESO 2007»
15 years 5 months ago
Index-Based Approach to Similarity Search in Protein and Nucleotide Databases
When searching databases of nucleotide or protein sequences, finding a local alignment of two sequences is one of the main tasks. Since the sizes of available databases grow const...
David Hoksza, Tomás Skopal
EVOW
2007
Springer
15 years 10 months ago
A Probabilistic Beam Search Approach to the Shortest Common Supersequence Problem
The Shortest Common Supersequence Problem (SCSP) is a well-known hard combinatorial optimization problem that formalizes many real world problems. This paper presents a novel rando...
Christian Blum, Carlos Cotta, Antonio J. Fern&aacu...
AIPS
2006
15 years 5 months ago
Exploiting the Power of Local Search in a Branch and Bound Algorithm for Job Shop Scheduling
This paper presents three techniques for using an iterated local search algorithm to improve the performance of a state-of-the-art branch and bound algorithm for job shop scheduli...
Matthew J. Streeter, Stephen F. Smith