Sciweavers

33 search results - page 3 / 7
» Domain representations of spaces of compact subsets
Sort
View
AAAI
2006
13 years 7 months ago
Learning Partially Observable Action Models: Efficient Algorithms
We present tractable, exact algorithms for learning actions' effects and preconditions in partially observable domains. Our algorithms maintain a propositional logical repres...
Dafna Shahaf, Allen Chang, Eyal Amir
TOG
2002
118views more  TOG 2002»
13 years 5 months ago
Frequency space environment map rendering
We present a new method for real-time rendering of objects with complex isotropic BRDFs under distant natural illumination, as specified by an environment map. Our approach is bas...
Ravi Ramamoorthi, Pat Hanrahan
PKDD
2009
Springer
102views Data Mining» more  PKDD 2009»
14 years 16 days ago
Relevance Grounding for Planning in Relational Domains
Probabilistic relational models are an efficient way to learn and represent the dynamics in realistic environments consisting of many objects. Autonomous intelligent agents that gr...
Tobias Lang, Marc Toussaint
ATAL
2004
Springer
13 years 11 months ago
Graphical Models in Local, Asymmetric Multi-Agent Markov Decision Processes
In multi-agent MDPs, it is generally necessary to consider the joint state space of all agents, making the size of the problem and the solution exponential in the number of agents...
Dmitri A. Dolgov, Edmund H. Durfee
ECSQARU
2007
Springer
14 years 5 days ago
Shared Ordered Binary Decision Diagrams for Dempster-Shafer Theory
The binary representation is widely used for representing focal sets of Dempster-Shafer belief functions because it allows to compute efficiently all relevant operations. However, ...
Norbert Lehmann