Sciweavers

134 search results - page 15 / 27
» Succinct Representations of Model Based Belief Revision
Sort
View
AAAI
1996
13 years 8 months ago
Computing Optimal Policies for Partially Observable Decision Processes Using Compact Representations
: Partially-observable Markov decision processes provide a very general model for decision-theoretic planning problems, allowing the trade-offs between various courses of actions t...
Craig Boutilier, David Poole
SIGECOM
2003
ACM
134views ECommerce» more  SIGECOM 2003»
14 years 24 days ago
Correlated equilibria in graphical games
We examine correlated equilibria in the recently introduced formalism of graphical games, a succinct representation for multiplayer games. We establish a natural and powerful rela...
Sham Kakade, Michael J. Kearns, John Langford, Lui...
SAT
2005
Springer
123views Hardware» more  SAT 2005»
14 years 1 months ago
Bounded Model Checking with QBF
Current algorithms for bounded model checking (BMC) use SAT methods for checking satisfiability of Boolean formulas. These BMC methods suffer from a potential memory explosion prob...
Nachum Dershowitz, Ziyad Hanna, Jacob Katz
ITS
2004
Springer
105views Multimedia» more  ITS 2004»
14 years 27 days ago
The Massive User Modelling System (MUMS)
Developing a learner model containing an accurate representation of a learner’s knowledge is made more difficult in distributed learning environments where the learner uses mult...
Christopher A. Brooks, Mike Winter, Jim E. Greer, ...
ECSQARU
2005
Springer
14 years 1 months ago
Multiple Semi-revision in Possibilistic Logic
Semi-revision is a model of belief change that differs from revision in that a new formula is not always accepted. Later, Fuhrmann defined multiple semi-revision by replacing a n...
Guilin Qi, Weiru Liu, David A. Bell