Sciweavers

371 search results - page 12 / 75
» A New Method for Interoperability Test Generation
Sort
View
CP
2006
Springer
15 years 3 months ago
A New Algorithm for Sampling CSP Solutions Uniformly at Random
The paper presents a method for generating solutions of a constraint satisfaction problem (CSP) uniformly at random. The main idea is to express the CSP as a factored probability d...
Vibhav Gogate, Rina Dechter
ATS
2000
IEEE
149views Hardware» more  ATS 2000»
15 years 4 months ago
Efficient built-in self-test algorithm for memory
We present a new pseudorandom testing algorithm for the Built-In Self-Test (BIST) of DRAM. In this algorithm, test patterns are complemented to generate state-transitions that are...
Sying-Jyan Wang, Chen-Jung Wei
122
Voted
FPGA
2000
ACM
114views FPGA» more  FPGA 2000»
15 years 3 months ago
Generating highly-routable sparse crossbars for PLDs
A method for evaluating and constructing sparse crossbars which are both area efficient and highly routable is presented. The evaluation method uses a network flow algorithm to ac...
Guy G. Lemieux, Paul Leventis, David M. Lewis
131
Voted
AIME
2011
Springer
13 years 11 months ago
The FMA in OWL 2
Representing the Foundational Model of Anatomy (FMA) in OWL 2 is essential for semantic interoperability. The paper describes the method and tool used to formalize the FMA in OWL 2...
Christine Golbreich, Julien Grosjean, Stéfa...
103
Voted
ACSD
2001
IEEE
102views Hardware» more  ACSD 2001»
15 years 3 months ago
Exploration Testing
This paper describes a new way of testing reactive systems as investigated by the RATE-project at the Tampere University of Technology. We abandon the idea of systematically using...
Juhana Helovuo, Sari Leppänen