19700 search results - page 201 / 3940 » DNA-Based Computation Times |
124
click to vote
CP
2005
Springer
15 years 11 months ago
2005
Springer
Methods exploiting tree-decompositions seem to provide the best approach for solving constraint networks w.r.t. the theoretical time complexity. However, they have not shown a real...
175
click to vote
BMCBI
2007
15 years 5 months ago
2007
Background: High-throughput peptide and protein identification technologies have benefited tremendously from strategies based on tandem mass spectrometry (MS/MS) in combination wi...
133
click to vote
EACL
1993
ACL Anthology
15 years 6 months ago
1993
ACL Anthology
We describe a computational system which parses discourses consisting of sequences of simple sentences. These contain a range of temporal constructions, including time adverbials,...
173
click to vote
TCS
2012
14 years 29 days ago
2012
Abstract. The standard simulation of a nondeterministic Turing machine (NTM) by a deterministic one essentially searches a large boundeddegree graph whose size is exponential in th...
164
click to vote
ICPPW
2009
IEEE
16 years 2 days ago
2009
IEEE
Conventional autotuning configuration of parameters in distributed computing systems using evolutionary strategies increases integrated performance notably, though at the expense ...