43 search results - page 8 / 9 » Proving Consistency and Completeness of Model Classes Using ... |
SIGCOMM
2012
ACM
11 years 8 months ago
2012
ACM
ions for Network Update Mark Reitblatt Cornell Nate Foster Cornell Jennifer Rexford Princeton Cole Schlesinger Princeton David Walker Princeton Configuration changes are a common...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
The safety of infinite state systems can be checked by a backward reachability procedure. For certain classes of systems, it is possible to prove the termination of the procedure ...
JAC
2008
13 years 7 months ago
2008
Cellular automata are a simple model of parallel computation. Many people wonder about the computing power of such a model. Following an idea of S. Wolfram [16], M. Cook [3] has pr...
SIGECOM
2005
ACM
13 years 11 months ago
2005
ACM
We introduce a new class of games, congestion games with failures (CGFs), which extends the class of congestion games to allow for facility failures. In a basic CGF (BCGF) agents ...
COLT
1993
Springer
13 years 9 months ago
1993
Springer
We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using param...