1884 search results - page 180 / 377 » Simple Algorithm for Simple Timed Games |
169
click to vote
BMCBI
2006
15 years 6 months ago
2006
Background: Hidden Markov Models (HMMs) have been extensively used in computational molecular biology, for modelling protein and nucleic acid sequences. In many applications, such...
181
click to vote
WECWIS
2002
IEEE
15 years 11 months ago
2002
IEEE
Despite the large amounts of runtime needed to adequately solve a combinatorial auction (CA), existing iterative CA auction protocols require winner determination during every rou...
160
click to vote
DATE
2003
IEEE
15 years 11 months ago
2003
IEEE
This paper presents a new algorithm for on-the-fly data compression in high performance VLIW processors. The algorithm aggressively targets energy minimization of some of the domi...
157
click to vote
BMCBI
2008
15 years 6 months ago
2008
Background: Due to recent progress in genome sequencing, more and more data for phylogenetic reconstruction based on rearrangement distances between genomes become available. Howe...
183
click to vote
WDAG
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...