204 search results - page 23 / 41 » Computational Universality in Symbolic Dynamical Systems |
MFCS
1991
Springer
13 years 11 months ago
1991
Springer
Weak Observational Congruence (woc) defined on CCS agents is not a bisimulation since it does not require two states reached by bisimilar computations of woc agents to be still w...
SAC
2004
ACM
14 years 1 months ago
2004
ACM
This paper presents specialized code generation techniques and runtime optimizations for developing light-weight XML Web services for embedded devices. The optimizations are imple...
SAC
2002
ACM
13 years 7 months ago
2002
ACM
We investigate the universal characteristics of the simulated time horizon of the basic conservative parallel algorithm when implemented on regular lattices. This technique [1, 2]...
COMPUTER
2002
13 years 7 months ago
2002
ions and concepts that let applications access and share resources and services across distributed, wide area networks, while providing common security semantics, distributed resou...
ECAL
1995
Springer
13 years 11 months ago
1995
Springer
Arti cial Life and the more general area of Complex Systems does not have a uni ed theoretical framework although most theoretical work in these areas is based on simulation. This ...