535 search results - page 68 / 107 » Checking Computations in Polylogarithmic Time |
EJC
2008
13 years 9 months ago
2008
Abstract. Classes of graphs with bounded expansion are a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, t...
PRDC
1999
IEEE
14 years 1 months ago
1999
IEEE
Generally, applications employing Database Management Systems (DBMS) require that the integrity of the data stored in the database be preserved during normal operation as well as ...
DATE
1999
IEEE
14 years 1 months ago
1999
IEEE
Boolean Satisfiability is a ubiquitous modeling tool in Electronic Design Automation, It finds application in test pattern generation, delay-fault testing, combinational equivalen...
GRID
2007
Springer
14 years 3 months ago
2007
Springer
— Today’s system monitoring tools are capable of detecting system failures such as host failures, OS errors, and network partitions in near-real time. Unfortunately, the same c...
AC
2002
Springer
13 years 8 months ago
2002
Springer
nce of computation has systematically abstracted away the physical world. Embedded software systems, however, engage the physical world. Time, concurrency, liveness, robustness, c...