17298 search results - page 198 / 3460 » Abstract computing machines |
183
click to vote
SOSP
2001
ACM
16 years 3 months 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...
196
click to vote
LFCS
2007
Springer
16 years 19 days 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...
158
click to vote
MEMBRANE
2005
Springer
15 years 12 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...
150
click to vote
ICTCS
2007
Springer
16 years 19 days 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 ...
176
click to vote
ICNP
2005
IEEE
16 years 2 days 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...