Sciweavers

1024 search results - page 157 / 205
» Value complete, column complete, predicate complete
Sort
View
TRS
2008
14 years 11 months ago
Local and Global Approximations for Incomplete Data
Abstract. For completely specified decision tables lower and upper approximations are unique, the lower approximation is the largest definable set contained in the approximated set...
Jerzy W. Grzymala-Busse, Wojciech Rzasa
TVLSI
2008
140views more  TVLSI 2008»
14 years 11 months ago
A Novel Mutation-Based Validation Paradigm for High-Level Hardware Descriptions
We present a Mutation-based Validation Paradigm (MVP) technology that can handle complete high-level microprocessor implementations and is based on explicit design error modeling, ...
Jorge Campos, Hussain Al-Asaad
ENDM
2000
174views more  ENDM 2000»
14 years 11 months ago
Hybrid Constraints in Automated Model Synthesis and Model Processing
Both parametric design tasks and analysis tasks of technical systems have a similar problem setting: The structure of the system to be configured or analyzed is defined already. W...
Klaus-Ulrich Leweling, Benno Stein
ET
2002
67views more  ET 2002»
14 years 11 months ago
On-the-Fly Reseeding: A New Reseeding Technique for Test-Per-Clock BIST
In this paper we present a new reseeding technique for test-per-clock test pattern generation suitable for at-speed testing of circuits with random-pattern resistant faults. Our te...
Emmanouil Kalligeros, Xrysovalantis Kavousianos, D...
IJCM
2002
92views more  IJCM 2002»
14 years 11 months ago
Random-tree Diameter and the Diameter-constrained MST
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to...
Ayman Abdalla, Narsingh Deo