Sciweavers

1299 search results - page 2 / 260
» Computing Minimal Diagnoses with Critical Set Algorithms
Sort
View
RTSS
2009
IEEE
14 years 2 days ago
On the Scheduling of Mixed-Criticality Real-Time Task Sets
Abstract—The functional consolidation induced by the costreduction trends in embedded systems can force tasks of different criticality (e.g. ABS Brakes with DVD) to share a proce...
Dionisio de Niz, Karthik Lakshmanan, Ragunathan Ra...
AAAI
2008
13 years 7 months ago
A Scalable Jointree Algorithm for Diagnosability
Diagnosability is an essential property that determines how accurate any diagnostic reasoning can be on a system given any sequence of observations. An unobservable fault event in...
Anika Schumann, Jinbo Huang
ATAL
2003
Springer
13 years 10 months ago
A protocol for multi-agent diagnosis with spatially distributed knowledge
In a large distributed system it is often infeasible or even impossible to perform diagnosis using a single model of the whole system. Instead, several spatially distributed local...
Nico Roos, Annette ten Teije, Cees Witteveen
GECCO
2007
Springer
154views Optimization» more  GECCO 2007»
13 years 11 months ago
Finding critical backbone structures with genetic algorithms
This paper introduces the concept of a critical backbone as a minimal set of variables or part of the solution necessary to be within the basin of attraction of the global optimum...
Adam Prügel-Bennett
WWW
2008
ACM
14 years 6 months ago
Computing minimum cost diagnoses to repair populated DL-based ontologies
Ontology population is prone to cause inconsistency because the populating process is imprecise or the populated data may conflict with the original data. By assuming that the int...
Jianfeng Du, Yi-Dong Shen