Sciweavers

3446 search results - page 201 / 690
» A Reasoning Algorithm for pD*
Sort
View
KR
2004
Springer
15 years 9 months ago
Learning Probabilistic Relational Planning Rules
To learn to behave in highly complex domains, agents must represent and learn compact models of the world dynamics. In this paper, we present an algorithm for learning probabilist...
Hanna Pasula, Luke S. Zettlemoyer, Leslie Pack Kae...
CAV
2010
Springer
207views Hardware» more  CAV 2010»
15 years 8 months ago
Petruchio: From Dynamic Networks to Nets
We introduce Petruchio, a tool for computing Petri net translations of dynamic networks. To cater for unbounded architectures beyond the capabilities of existing implementations, t...
Roland Meyer, Tim Strazny
IJCAI
2007
15 years 6 months ago
Deictic Option Schemas
Deictic representation is a representational paradigm, based on selective attention and pointers, that allows an agent to learn and reason about rich complex environments. In this...
Balaraman Ravindran, Andrew G. Barto, Vimal Mathew
CSC
2006
15 years 5 months ago
Symmetric Positive Definite Based Preconditioners For Discrete Convection-diffusion Problems
Abstract -- We experimentally examine the performance of preconditioners based on entries of the symmetric positive definite part and small subspace solvers for linear system of eq...
Mohammad Sameer Sunhaloo, Muddun Bhuruth
ENTCS
2008
85views more  ENTCS 2008»
15 years 4 months ago
Formalising in Nominal Isabelle Crary's Completeness Proof for Equivalence Checking
In the book on Advanced Topics in Types and Programming Languages, Crary illustrates the reasoning technique of logical relations in a case study about equivalence checking. He pr...
Julien Narboux, Christian Urban