10988 search results - page 116 / 2198 » Algorithmic Folding Complexity |
139
click to vote
WABI
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. Sequence alignment algorithms have a long standing tradition in bioinformatics. In this paper, we formulate an extension to existing local alignment algorithms: local ali...
109
click to vote
ATAL
2008
Springer
15 years 4 months ago
2008
Springer
In this paper, we develop a novel algorithm that allows service consumer agents to automatically select and provision service provider agents for their workflows in highly dynamic...
136
Voted
KDD
2002
ACM
16 years 2 months ago
2002
ACM
In this paper we propose a scaling-up method that is applicable to essentially any induction algorithm based on discrete search. The result of applying the method to an algorithm ...
105
Voted
ICASSP
2008
IEEE
15 years 9 months ago
2008
IEEE
Lattice reduction by means of the LLL algorithm has been previously suggested as a powerful preprocessing tool that allows to improve the performance of suboptimal detectors and t...
163
Voted
FOGA
2011
14 years 6 months ago
2011
Analyzing the computational complexity of evolutionary algorithms (EAs) for binary search spaces has significantly informed our understanding of EAs in general. With this paper, ...