1677 search results - page 311 / 336 » On the Completeness of Quantum Computation Models |
105
click to vote
EUROCOLT
1999
Springer
15 years 5 months ago
1999
Springer
The present paper motivates the study of mind change complexity for learning minimal models of length-bounded logic programs. It establishes ordinal mind change complexity bounds ...
106
click to vote
DBPL
1993
Springer
15 years 5 months ago
1993
Springer
This paper presents database applications of the recently proposed Transaction Logic—an extension of classical predicate logic that accounts in a clean and declarative fashion f...
124
click to vote
FPCA
1989
15 years 5 months ago
1989
We give a framework for denotational semantics for the polymorphic “core” of the programming language ML. This framework requires no more semantic material than what is needed...
130
click to vote
ATAL
2004
Springer
15 years 5 months ago
2004
Springer
This paper deals with a new approach to build a completely distributed and decentralized Intrusion Detection and Response System (IDRS) in computer networks. This approach is call...
130
click to vote
SPW
2000
Springer
15 years 5 months ago
2000
Springer
In the context of the security of wireless ad hoc networks, we previously explored the problem of secure transient association between a master and a slave device in the absence of...