Sciweavers

630 search results - page 69 / 126
» Symbolic Domain Decomposition
Sort
View
PC
2010
101views Management» more  PC 2010»
14 years 6 months ago
An efficient parallel implementation of the MSPAI preconditioner
We present an efficient implementation of the Modified SParse Approximate Inverse (MSPAI) preconditioner. MSPAI generalizes the class of preconditioners based on Frobenius norm mi...
Thomas Huckle, A. Kallischko, A. Roy, M. Sedlacek,...
AIPS
2011
14 years 3 months ago
Searching for Plans with Carefully Designed Probes
We define a probe to be a single action sequence computed greedily from a given state that either terminates in the goal or fails. We show that by designing these probes carefull...
Nir Lipovetzky, Hector Geffner
ICML
2007
IEEE
16 years 19 days ago
Statistical predicate invention
We propose statistical predicate invention as a key problem for statistical relational learning. SPI is the problem of discovering new concepts, properties and relations in struct...
Stanley Kok, Pedro Domingos
ITS
2004
Springer
124views Multimedia» more  ITS 2004»
15 years 5 months ago
Combining Competing Language Understanding Approaches in an Intelligent Tutoring System
When implementing a tutoring system that attempts a deep understanding of students’ natural language explanations, there are three basic approaches to choose between; symbolic, i...
Pamela W. Jordan, Maxim Makatchev, Kurt VanLehn
ATAL
2003
Springer
15 years 5 months ago
Towards a motivation-based approach for evaluating goals
Traditional goal-oriented approaches to building intelligent agents only consider absolute satisfaction of goals. However, in continuous domains there may be many instances in whi...
Stephen J. Munroe, Michael Luck, Mark d'Inverno