1888 search results - page 283 / 378 » Proof theory and computational analysis |
116
click to vote
TCS
2011
14 years 6 months ago
2011
Let F be a cellular automaton (CA). This paper establishes necessary conditions for F in order to be intrinsically universal. The central idea is to consider the communication com...
110
click to vote
ISI
2008
Springer
14 years 10 months ago
2008
Springer
This talk deals with advanced concepts of Artificial Intelligence (AI) and Pattern Recognition (PR), and their applications to solving real life problems including biometrics appl...
103
click to vote
RECOMB
2006
Springer
16 years 5 days ago
2006
Springer
mRNA molecules are folded in the cells and therefore many of their substrings may actually be inaccessible to protein and microRNA binding. The need to apply an accessability crite...
115
click to vote
ICS
2009
Tsinghua U.
15 years 6 months ago
2009
Tsinghua U.
“Is transactional memory useful?” is the question that cannot be answered until we provide substantial applications that can evaluate its capabilities. While existing TM appli...
105
click to vote
ASIACRYPT
2009
Springer
15 years 6 months ago
2009
Springer
Computational puzzles are mildly difficult computational problems that require resources (processor cycles, memory, or both) to solve. Puzzles have found a variety of uses in secu...