747 search results - page 133 / 150 » Theory and Construction of Molecular Computers |
113
click to vote
CORR
2004
Springer
14 years 11 months ago
2004
Springer
Words and phrases acquire meaning from the way they are used in society, from their relative semantics to other words and phrases. For computers the equivalent of `society' is...
103
click to vote
MST
2010
14 years 10 months ago
2010
Reductions and completeness notions form the heart of computational complexity theory. Recently non-uniform reductions have been naturally introduced in a variety of settings conc...
213
click to vote
ICFP
2009
ACM
16 years 11 days ago
2009
ACM
re a popular form of abstract computation. Being more general than monads, they are more broadly applicable, and in parare a good abstraction for signal processing and dataflow co...
107
click to vote
ICFP
2007
ACM
15 years 11 months ago
2007
ACM
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
109
click to vote
MICAI
2005
Springer
15 years 5 months ago
2005
Springer
In Multi-agent based simulation (MABS) systems, computational models are built as multi-agent systems (MAS). Replication of these models can contribute to improve the reliability o...