949 search results - page 118 / 190 » Programmed Mutagenesis Is Universal |
CORR
2007
Springer
14 years 12 months ago
2007
Springer
We introduce S-DUDE, a new algorithm for denoising Discrete Memoryless Channel (DMC)-corrupted data. The algorithm, which generalizes the recently introduced DUDE (Discrete Univer...
ETS
2000
IEEE
14 years 11 months ago
2000
IEEE
This paper describes experiences with on-line and in-class sections of a writing-intensive course, including a collaborative library literacy unit. It reports on a mid-semester so...
119
click to vote
EC
1998
14 years 11 months ago
1998
L. M. Adleman launched the field of DNA computing with a demonstration in 1994 that strands of DNA could be used to solve the Hamiltonian path problem for a simple graph. He also...
CAV
2009
Springer
16 years 13 days ago
2009
Springer
Counter Abstraction for Concurrent Software G?erard Basler1 , Michele Mazzucchi1 , Thomas Wahl1,2 , Daniel Kroening1,2 1 Computer Systems Institute, ETH Zurich, Switzerland 2 Compu...
190
click to vote
POPL
2006
ACM
16 years 6 days ago
2006
ACM
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...