562 search results - page 58 / 113 » Simple Randomized Algorithms for Closest Pair Problems |
GCB
1997
Springer
15 years 1 months ago
1997
Springer
Motivation: Database search programs such as FASTA, BLAST or a rigorous Smith–Waterman algorithm produce lists of database entries, which are assumed to be related to the query....
AAAI
1997
14 years 11 months ago
1997
In this paper, tabu search for SAT is investigated from an experimental point of view. To this end, TSAT, a basic tabu search algorithm for SAT, is introduced and compared with Se...
INFOCOM
2008
IEEE
15 years 4 months ago
2008
IEEE
—In this paper we develop a distributed rate control algorithm for multiple-unicast-sessions when network coding is allowed. Building on our recent flow-based characterization o...
CORR
2010
Springer
14 years 8 months ago
2010
Springer
The Maximum Betweenness Centrality problem (MBC) can be defined as follows. Given a graph find a k-element node set C that maximizes the probability of detecting communication be...
CPAIOR
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. This paper furthers the recent investigation of search heuristics based on solution counting information, by proposing and evaluating algorithms to compute solution densi...