Sciweavers

693 search results - page 65 / 139
» Complexity Analysis of Heuristic CSP Search Algorithms
Sort
View
GECCO
2008
Springer
123views Optimization» more  GECCO 2008»
13 years 9 months ago
Precision, local search and unimodal functions
We investigate the effects of precision on the efficiency of various local search algorithms on 1-D unimodal functions. We present a (1 + 1)-EA with adaptive step size which fin...
Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wege...
FOCS
2000
IEEE
14 years 14 days ago
On Clusterings - Good, Bad and Spectral
We motivate and develop a natural bicriteria measure for assessing the quality of a clustering that avoids the drawbacks of existing measures. A simple recursive heuristic is shown...
Ravi Kannan, Santosh Vempala, Adrian Vetta
ADHOC
2008
183views more  ADHOC 2008»
13 years 8 months ago
On ant routing algorithms in ad hoc networks with critical connectivity
This paper shows a novel self-organizing approach for routing datagrams in ad hoc networks, called Distributed Ant Routing (DAR). This approach belongs to the class of routing alg...
Laura Rosati, Matteo Berioli, Gianluca Reali
JACM
2002
94views more  JACM 2002»
13 years 7 months ago
The greedy path-merging algorithm for contig scaffolding
Given a collection of contigs and mate-pairs. The Contig Scaffolding Problem is to order and orientate the given contigs in a manner that is consistent with as many mate-pairs as p...
Daniel H. Huson, Knut Reinert, Eugene W. Myers
COCOON
2005
Springer
14 years 1 months ago
A Quadratic Lower Bound for Rocchio's Similarity-Based Relevance Feedback Algorithm
Rocchio’s similarity-based relevance feedback algorithm, one of the most important query reformation methods in information retrieval, is essentially an adaptive supervised lear...
Zhixiang Chen, Bin Fu