2137 search results - page 43 / 428 » Proving Abstract Non-interference |
103
click to vote
AMAST
2010
Springer
14 years 5 months ago
2010
Springer
Abstract. We develop an algebraic modal logic that combines epistemic and dynamic modalities with a view to modelling information acquisition (learning) by automated agents in a ch...
CCIA
2010
Springer
14 years 5 months ago
2010
Springer
The implementation of AI in commercial games is usually based on low level designs that makes the control predictable, unadaptive, and non reusable. Reorithms such as HTN or GOAP p...
CDC
2010
IEEE
14 years 5 months ago
2010
IEEE
Abstract-- Given a family of real or complex monic polynomials of fixed degree with one fixed affine constraint on their coefficients, consider the problem of minimizing the root r...
CORR
2011
Springer
14 years 5 months ago
2011
Springer
d Abstract) Alexander Langer, Peter Rossmanith, and Somnath Sikdar RWTH Aachen University, 52074 Aachen, Germany. We present an alternative proof of a theorem by Courcelle, Makowsk...
106
click to vote
CORR
2011
Springer
14 years 5 months ago
2011
Springer
Abstract. Notoriously, quantum computation shatters complexity theory, but is innocuous to computability theory [17]. Yet several works have shown how quantum theory as it stands c...