19700 search results - page 2 / 3940 » DNA-Based Computation Times |
NC
2006
13 years 5 months ago
2006
A monomer structure based on a hairpin loop is described that can be linked via short oligonucleotide sequences (linkers) to form polymers. Independence of linked monomers allow fo...
GECCO
2007
Springer
13 years 9 months ago
2007
Springer
A large and reliable DNA codeword library is key to the success of DNA based computing. Searching for sets of reliable DNA codewords is an NP-hard problem, which can take days on ...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
We define a new transfinite time model of computation, infinite time cellular automata. The model is shown to be as powerful than infinite time Turing machines, both on finite and ...
FORMATS
2010
Springer
13 years 3 months ago
2010
Springer
We study two-player timed games where the objectives of the two players are not opposite. We focus on the standard notion of Nash equilibrium and propose a series of transformation...
CORR
2011
Springer
12 years 9 months ago
2011
Springer
—We consider timed Petri nets, i.e., unbounded Petri nets where each token carries a real-valued clock. Transition arcs are labeled with time intervals, which specify constraints...