7988 search results - page 254 / 1598 » A Useful Undecidable Theory |
112
Voted
VLDB
1989
ACM
15 years 4 months ago
1989
ACM
In this paper, we introduce Quasi Serializability, a correctness criterion for concurrency control in heterogeneous distributed database environments. A global history is quasi se...
113
Voted
IJVR
2008
15 years 24 days ago
2008
Due to its importance as a model for several software and hardware applications, automata theory is a core topic in computer science and engineering education. But because of its m...
53
Voted
JCC
2008
15 years 23 days ago
2008
: Time-dependent coupled cluster theory, with unrestricted electron spins and full treatment of orbital rotation, is used to calculate polarizabilities at imaginary frequencies for...
134
Voted
JCSC
1998
15 years 14 days ago
1998
: Continuous and hybrid Petri nets can be seen as relaxation of discrete nets, in which the firing of some or of all transitions is approximated with a fluid model. Several analysi...
102
Voted
AMAI
2004
Springer
15 years 6 months ago
2004
Springer
The framework of algorithmic knowledge assumes that agents use algorithms to compute the facts they explicitly know. In many cases of interest, a logical theory, rather than a par...