397 search results - page 35 / 80 » Comparing Two Grammar-Based Generation Algorithms: A Case St... |
133
click to vote
ICNC
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Four local search algorithms are investigated for the phylogenetic tree reconstruction problem under the Maximum Parsimony criterion. A new subtree swapping neighborhood ...
104
Voted
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
We consider the problem of channel estimation for amplify-andforward (AF) two-way relay networks (TWRNs). The majority of works on this problem develop pilot-based algorithms that...
121
click to vote
AI
2007
Springer
15 years 9 months ago
2007
Springer
Agent competition and coordination are two classical and most important tasks in multiagent systems. In recent years, there was a number of learning algorithms proposed to resolve ...
147
click to vote
BMCBI
2010
15 years 3 months ago
2010
Background: Assembling genomic sequences from a set of overlapping reads is one of the most fundamental problems in computational biology. Algorithms addressing the assembly probl...
125
Voted
CVPR
2004
IEEE
15 years 7 months ago
2004
IEEE
In the paper, we study the problem of optimal matching of two generalized functions (distributions) via a diffeomorphic transformation of the ambient space. In the particular case...