Sciweavers

121 search results - page 15 / 25
» Diagnosis as Planning Revisited
Sort
View
ECAI
2006
Springer
14 years 1 months ago
Extracting MUCs from Constraint Networks
Abstract. We address the problem of extracting Minimal Unsatisfiable Cores (MUCs) from constraint networks. This computationally hard problem has a practical interest in many appli...
Fred Hemery, Christophe Lecoutre, Lakhdar Sais, Fr...
SCAI
2008
13 years 11 months ago
Troubleshooting when Action Costs are Dependent with Application to a Truck Engine
We propose a troubleshooting algorithm that can troubleshoot systems with dependent action costs. When actions are performed they may change the way the system is decomposed and af...
Håkan Warnquist, Mattias Nyberg, Petter S&au...
UAI
2008
13 years 11 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
VMV
2004
97views Visualization» more  VMV 2004»
13 years 11 months ago
Flexible Direct Multi-Volume Rendering in Dynamic Scenes
In this paper we describe methods to efficiently visualize multiple intersecting volumetric objects. We introduce the concept of V-Objects. V-Objects repbstract properties of an o...
Sören Grimm, Stefan Bruckner, Armin Kanitsar,...
AAAI
1997
13 years 11 months ago
Using CSP Look-Back Techniques to Solve Real-World SAT Instances
We report on the performance of an enhanced version of the “Davis-Putnam” (DP) proof procedure for propositional satisfiability (SAT) on large instances derived from realworld...
Roberto J. Bayardo Jr., Robert Schrag