Sciweavers

2869 search results - page 88 / 574
» The Inference Problem: A Survey
Sort
View
AAAI
2006
13 years 11 months ago
Compiling Uncertainty Away: Solving Conformant Planning Problems using a Classical Planner (Sometimes)
Even under polynomial restrictions on plan length, conformant planning remains a very hard computational problem as plan verification itself can take exponential time. This heavy ...
Héctor Palacios, Hector Geffner
COGSR
2011
71views more  COGSR 2011»
13 years 5 months ago
Psychological models of human and optimal performance in bandit problems
In bandit problems, a decision-maker must choose between a set of alternatives, each of which has a fixed but unknown rate of reward, to maximize their total number of rewards ov...
Michael D. Lee, Shunan Zhang, Miles Munro, Mark St...
IPSN
2004
Springer
14 years 3 months ago
Distributed state representation for tracking problems in sensor networks
This paper investigates the problem of designing decentralized representations to support monitoring and inferences in sensor networks. State-space models of physical phenomena su...
Juan Liu, Maurice Chu, Jie Liu, Jim Reich, Feng Zh...
AAAI
1996
13 years 11 months ago
Enhancements of Branch and Bound Methods for the Maximal Constraint Satisfaction Problem
Two methods are described for enhancing performance of branch and bound methods for overconstrained CSPS. These methods improve either the upper or lower bound, respectively, duri...
Richard J. Wallace
DOLAP
2004
ACM
14 years 3 months ago
Cardinality-based inference control in OLAP systems: an information theoretic approach
We address the inference control problem in data cubes with some data known to users through external knowledge. The goal of inference controls is to prevent exact values of sensi...
Nan Zhang 0004, Wei Zhao, Jianer Chen