Sciweavers

52 search results - page 1 / 11
» Computing Minimal Diagnoses by Greedy Stochastic Search
Sort
View
AAAI
2008
13 years 8 months ago
Computing Minimal Diagnoses by Greedy Stochastic Search
Most algorithms for computing diagnoses within a modelbased diagnosis framework are deterministic. Such algorithms guarantee soundness and completeness, but are P 2 hard. To overc...
Alexander Feldman, Gregory M. Provan, Arjan J. C. ...
SARA
2007
Springer
13 years 12 months ago
Approximate Model-Based Diagnosis Using Greedy Stochastic Search
Most algorithms for computing diagnoses within a modelbased diagnosis framework are deterministic. Such algorithms guarantee soundness and completeness, but are NPhard. To overcom...
Alexander Feldman, Gregory M. Provan, Arjan J. C. ...
AAAI
2011
12 years 5 months ago
Stopping Rules for Randomized Greedy Triangulation Schemes
Many algorithms for performing inference in graphical models have complexity that is exponential in the treewidth - a parameter of the underlying graph structure. Computing the (m...
Andrew Gelfand, Kalev Kask, Rina Dechter
AAAI
2008
13 years 8 months ago
Computing Observation Vectors for Max-Fault Min-Cardinality Diagnoses
Model-Based Diagnosis (MBD) typically focuses on diagnoses, minimal under some minimality criterion, e.g., the minimal-cardinality set of faulty components that explain an observa...
Alexander Feldman, Gregory M. Provan, Arjan J. C. ...
ICASSP
2008
IEEE
14 years 8 days ago
Abnormal event detection based on trajectory clustering by 2-depth greedy search
Clustering-based approaches for abnormal video event detection have been proven to be effective in the recent literature. Based on the framework proposed in our previous work [1],...
Fan Jiang, Ying Wu, Aggelos K. Katsaggelos