535 search results - page 33 / 107 » Checking Computations in Polylogarithmic Time |
RTCSA
2005
IEEE
14 years 1 months ago
2005
IEEE
With the advent of miniaturized sensing technology, it has become possible to envision smart structures containing millions of sensors embedded in concrete for autonomously detect...
ICLP
1997
Springer
13 years 12 months ago
1997
Springer
Kowalski and Sergot’s Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which propert...
ATAL
2006
Springer
13 years 11 months ago
2006
Springer
We investigate the computational complexity of reasoning about multi-agent systems using the cooperation logic ATL of Alur, Henzinger, and Kupferman. It is known that satisfiabili...
IVC
2008
13 years 7 months ago
2008
In the US and many other countries, bank checks are preprinted with the account number and the check number in MICR ink and format; as such, these two numeric fields can be easily...
COCO
2010
Springer
13 years 11 months ago
2010
Springer
Abstract—We consider two natural extensions of the communication complexity model that are inspired by distributed computing. In both models, two parties are equipped with synchr...