1677 search results - page 55 / 336 » On the Completeness of Quantum Computation Models |
101
click to vote
KI
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. We aim to demonstrate that automated deduction techniques, in particular those following the model computation paradigm, are very well suited for database schema/query re...
TAMC
2009
Springer
15 years 8 months ago
2009
Springer
Computability concerns information with a causal – typically algorithmic – structure. As such, it provides a schematic analysis of many naturally occurring situations. We look ...
117
click to vote
ANSS
2007
IEEE
15 years 7 months ago
2007
IEEE
Accurate failure prediction in Grids is critical for reasoning about QoS guarantees such as job completion time and availability. Statistical methods can be used but they suffer f...
101
click to vote
ICALP
2009
Springer
16 years 1 months ago
2009
Springer
Ong has shown that the modal mu-calculus model checking problem (equivalently, the alternating parity tree automaton (APT) acceptance problem) of possibly-infinite ranked trees gen...
135
click to vote
NIPS
2000
15 years 2 months ago
2000
Learning of a smooth but nonparametric probability density can be regularized using methods of Quantum Field Theory. We implement a field theoretic prior numerically, test its eff...