Sciweavers

33 search results - page 6 / 7
» Algorithms for Propositional KB Approximation
Sort
View
IJSI
2010
84views more  IJSI 2010»
13 years 7 months ago
Computational Complexity and Anytime Algorithm for Inconsistency Measurement
Measuring inconsistency degrees of inconsistent knowledge bases is an important problem as it provides context information for facilitating inconsistency handling. Many methods hav...
Yue Ma, Guilin Qi, Guohui Xiao, Pascal Hitzler, Zu...
UAI
2008
13 years 10 months ago
Sampling First Order Logical Particles
Approximate inference in dynamic systems is the problem of estimating the state of the system given a sequence of actions and partial observations. High precision estimation is fu...
Hannaneh Hajishirzi, Eyal Amir
AIPS
2008
13 years 11 months ago
Stochastic Planning with First Order Decision Diagrams
Dynamic programming algorithms have been successfully applied to propositional stochastic planning problems by using compact representations, in particular algebraic decision diag...
Saket Joshi, Roni Khardon
JAIR
2010
131views more  JAIR 2010»
13 years 7 months ago
Automatic Induction of Bellman-Error Features for Probabilistic Planning
Domain-specific features are important in representing problem structure throughout machine learning and decision-theoretic planning. In planning, once state features are provide...
Jia-Hong Wu, Robert Givan
ECCV
2008
Springer
14 years 11 months ago
Automatic Image Colorization Via Multimodal Predictions
We aim to color greyscale images automatically, without any manual intervention. The color proposition could then be interactively corrected by user-provided color landmarks if nec...
Bernhard Schölkopf, Guillaume Charpiat, Matth...