882 search results - page 94 / 177 » Local Search for Very Large SAT Problems |
149
click to vote
BIBE
2005
IEEE
15 years 9 months ago
2005
IEEE
We propose a method for finding seeds for the local alignment of two nucleotide sequences. Our method uses randomized algorithms to find approximate seeds. We present a dynamic ...
148
click to vote
EAAI
2007
15 years 4 months ago
2007
Multi-agent systems are widely used to address large-scale distributed combinatorial applications in the real world. One such application is meeting scheduling (MS), which is de...
142
click to vote
ECIR
2007
Springer
15 years 5 months ago
2007
Springer
An expert finding is a very common task among enterprise search activities, while its usual retrieval performance is far from the quality of the Web search. Query modeling helps t...
167
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
Markov Logic Networks (MLNs) have emerged as a powerful framework that combines statistical and logical reasoning; they have been applied to many data intensive problems including...
168
click to vote
DAGSTUHL
2007
15 years 5 months ago
2007
Binary search trees are a fundamental data structure and their height plays a key role in the analysis of divide-and-conquer algorithms like quicksort. Their worst-case height is l...