Sciweavers

851 search results - page 170 / 171
» Inaccessibility in Decision Procedures
Sort
View
AOSD
2011
ACM
13 years 27 days ago
Closure joinpoints: block joinpoints without surprises
Block joinpoints allow programmers to explicitly mark regions of base code as “to be advised”, thus avoiding the need to extract the block into a method just for the sake of c...
Eric Bodden
IANDC
2011
129views more  IANDC 2011»
13 years 25 days ago
Rigid tree automata and applications
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a res...
Florent Jacquemard, Francis Klay, Camille Vacher
TR
2010
140views Hardware» more  TR 2010»
13 years 17 days ago
Modeling Failure Modes for Residual Life Prediction Using Stochastic Filtering Theory
This paper reports on a theoretical Bayesian modeling development for residual life prediction in the context of condition-based maintenance. At each monitoring point during a comp...
Matthew J. Carr, Wenbin Wang
CORR
2011
Springer
160views Education» more  CORR 2011»
12 years 9 months ago
Searching for Bayesian Network Structures in the Space of Restricted Acyclic Partially Directed Graphs
Although many algorithms have been designed to construct Bayesian network structures using different approaches and principles, they all employ only two methods: those based on i...
Silvia Acid, Luis M. de Campos
DLOG
2011
12 years 9 months ago
Dependencies to Optimize Ontology Based Data Access
Query answering in Ontology Based Data Access (OBDA) exploits the knowledge of an ontology’s TBox to deal with incompleteness of the ABox (or data source). Current query-answerin...
Mariano Rodriguez-Muro, Diego Calvanese