Sciweavers

1383 search results - page 200 / 277
» On the Complexity of the Interlace Polynomial
Sort
View
AGP
1994
IEEE
15 years 10 months ago
What the Event Calculus actually does, and how to do it efficiently
Kowalski and Sergot's Event Calculus (EC) is a formalism for reasoning about time and change in a logic programming framework. From a description of events which occur in the...
Iliano Cervesato, Luca Chittaro, Angelo Montanari
ATAL
2006
Springer
15 years 10 months ago
A hierarchical approach to efficient reinforcement learning in deterministic domains
Factored representations, model-based learning, and hierarchies are well-studied techniques for improving the learning efficiency of reinforcement-learning algorithms in large-sca...
Carlos Diuk, Alexander L. Strehl, Michael L. Littm...
ESORICS
2006
Springer
15 years 10 months ago
TrustedPals: Secure Multiparty Computation Implemented with Smart Cards
We study the problem of Secure Multi-party Computation (SMC) in a model where individual processes contain a tamper-proof security module, and introduce the TrustedPals framework, ...
Milan Fort, Felix C. Freiling, Lucia Draque Penso,...
AAAI
2007
15 years 8 months ago
On the Partial Observability of Temporal Uncertainty
We explore a means to both model and reason about partial observability within the scope of constraintbased temporal reasoning. Prior studies of uncertainty in Temporal CSPs have ...
Michael D. Moffitt
AAAI
2007
15 years 8 months ago
Approximating OWL-DL Ontologies
Efficient query answering over ontologies is one of the most useful and important services to support Semantic Web applications. Approximation has been identified as a potential...
Jeff Z. Pan, Edward Thomas