71228 search results - page 238 / 14246 » Algorithms |
106
Voted
APPROX
2009
Springer
15 years 8 months ago
2009
Springer
The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v ∈ Fn 2 and a linear space L ⊆ Fn 2 of dimension k NC...
122
Voted
ICCS
2001
Springer
15 years 6 months ago
2001
Springer
Abstract. Phylogeny reconstruction from molecular data poses complex optimization problems: almost all optimization models are NP-hard and thus computationally intractable. Yet app...
118
click to vote
BMCBI
2010
15 years 1 months ago
2010
Background: DNA signatures are distinct short nucleotide sequences that provide valuable information that is used for various purposes, such as the design of Polymerase Chain Reac...
132
click to vote
BMCBI
2010
15 years 1 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...
132
click to vote
JAIR
2008
15 years 1 months ago
2008
Several multiagent reinforcement learning (MARL) algorithms have been proposed to optimize agents' decisions. Due to the complexity of the problem, the majority of the previo...