7311 search results - page 173 / 1463 » Time in State Machines |
137
click to vote
AIML
2004
15 years 6 months ago
2004
This paper shows that satisfiability for Propositional Dynamic Logic with Intersection is EXPSPACE-hard. The proof uses a reduction from the word problem for alternating, exponent...
106
Voted
CRYPTO
1998
Springer
15 years 8 months ago
1998
Springer
We state the basic requirements for time-stamping systems applicable as the necessary support to the legal use of electronic documents. We analyze the main drawbacks of the time-st...
261
Voted
ICDE
2001
IEEE
16 years 6 months ago
2001
IEEE
Semi-join reducers were introduced in the late seventies as a means to reduce the communication costs of distributed database systems. Subsequent work in the eighties showed, howe...
141
click to vote
CICLING
2007
Springer
15 years 10 months ago
2007
Springer
Finite-state technology is considered the preferred model for representing the phonology and morphology of natural languages. The attractiveness of this technology for natural lang...
119
Voted
TIME
1994
IEEE
15 years 8 months ago
1994
IEEE
We are concerned with temporalreasoning problems where there is uncertainty about the order in which events occur. The task of temporal reasoning is to derive an event sequence co...