Sciweavers

74 search results - page 2 / 15
» A Canonical Form for Testing Boolean Function Properties
Sort
View
QEST
2010
IEEE
13 years 2 months ago
Canonical Form Based MAP(2) Fitting
The importance of the order two Markovian arrival process (MAP(2)) comes from its compactness, serving either as arrival or service process in applications, and from the nice prope...
Levente Bodrog, Peter Buchholz, Jan Kriege, Mikl&o...
JUCS
2006
107views more  JUCS 2006»
13 years 4 months ago
Testing Membership in Formal Languages Implicitly Represented by Boolean Functions
Abstract: Combinatorial property testing, initiated formally by Goldreich, Goldwasser, and Ron in [Goldreich et al. (1998)] and inspired by Rubinfeld and Sudan in [Rubinfeld and Su...
Beate Bollig
ISMIS
2005
Springer
13 years 10 months ago
Normal Forms for Knowledge Compilation
A class of formulas called factored negation normal form is introduced. They are closely related to BDDs, but there is a DPLL-like tableau procedure for computing them that operate...
Reiner Hähnle, Neil V. Murray, Erik Rosenthal
PROPERTYTESTING
2010
13 years 2 months ago
Testing by Implicit Learning: A Brief Survey
We give a high-level survey of the "testing by implicit learning" paradigm, and explain some of the property testing results for various Boolean function classes that ha...
Rocco A. Servedio
GLVLSI
1996
IEEE
145views VLSI» more  GLVLSI 1996»
13 years 9 months ago
Boolean Function Representation Using Parallel-Access Diagrams
Inthispaperweintroduceanondeterministiccounterpart to Reduced, Ordered Binary Decision Diagrams for the representation and manipulation of logic functions. ROBDDs are conceptually...
Valeria Bertacco, Maurizio Damiani