Sciweavers

306 search results - page 40 / 62
» Underspecified computation of normal forms
Sort
View
VLSID
2001
IEEE
164views VLSI» more  VLSID 2001»
15 years 10 months ago
An Efficient Parallel Transparent Bist Method For Multiple Embedded Memory Buffers
In this paper, we propose a new transparent built-in self-test ( TBIST ) method to test multiple embedded memory arrays with various sizes in parallel. First, a new transparent tes...
Der-Cheng Huang, Wen-Ben Jone, Sunil R. Das
RTA
2010
Springer
15 years 1 months ago
Declarative Debugging of Missing Answers for Maude
Abstract. Declarative debugging is a semi-automatic technique that starts from an incorrect computation and locates a program fragment responsible for the error by building a tree ...
Adrián Riesco, Alberto Verdejo, Narciso Mar...
CSCLP
2008
Springer
14 years 11 months ago
An Efficient Decision Procedure for Functional Decomposable Theories Based on Dual Constraints
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
Khalil Djelloul
UAI
1993
14 years 11 months ago
Probabilistic Assumption-Based Reasoning
In this paper the classical propositional assumption-based model is extended to incorporate probabilities for the assumptions. Then the whole model is placed into the framework of...
Jürg Kohlas, Paul-André Monney
IWC
1998
109views more  IWC 1998»
14 years 9 months ago
About the importance of auditory alarms during the operation of a plant simulator
An experiment was carried out to estimate the effect of auditory alarms on the work of an plant operator in the context of a computer simulation. We designed our process simulator...
Matthias Rauterberg