17298 search results - page 198 / 3460 » Abstract computing machines |
146
Voted
SOSP
2001
ACM
16 years 17 days ago
2001
ACM
ing Abstraction to Improve Fault Tolerance MIGUEL CASTRO Microsoft Research and RODRIGO RODRIGUES and BARBARA LISKOV MIT Laboratory for Computer Science Software errors are a major...
156
Voted
LFCS
2007
Springer
15 years 9 months ago
2007
Springer
act Completion (Full Version) Guillaume Burel Claude Kirchner August 6, 2007 Deduction Modulo implements Poincar´e’s principle by identifying deduction and computation as diff...
113
Voted
MEMBRANE
2005
Springer
15 years 9 months ago
2005
Springer
Some features capturing the computational completeness of P systems with maximal parallelism, priorities or zero-test using symbol objects are studied through Petri nets. The obtai...
120
Voted
ICTCS
2007
Springer
15 years 9 months ago
2007
Springer
ing from Prioritized/Weighted Internal Immediate Actions Marco Bernardo and Alessandro Aldini Universit`a di Urbino “Carlo Bo” – Italy Markovian process calculi constitute a ...
134
Voted
ICNP
2005
IEEE
15 years 9 months ago
2005
IEEE
straction of Complex Network Compositions∗ Azer Bestavros, Adam D. Bradley, Assaf J. Kfoury, and Ibrahim Matta Department of Computer Science Boston University The heterogeneity...