Sciweavers

4255 search results - page 212 / 851
» On Learning Boolean Functions
Sort
View
IWSSD
2000
IEEE
15 years 11 months ago
Hybrid Model Visualization in Requirements and Design: A Preliminary Investigation
This paper reports on a preliminary investigation into applying work on graphic animation of behavioral models to an air traffic control case study – the National Air Traffic Se...
Jeff Magee, Jeff Kramer, Bashar Nuseibeh, David Bu...
COCO
2000
Springer
161views Algorithms» more  COCO 2000»
15 years 11 months ago
Characterization of Non-Deterministic Quantum Query and Quantum Communication Complexity
It is known that the classical and quantum query complexities of a total Boolean function f are polynomially related to the degree of its representing polynomial, but the optimal ...
Ronald de Wolf
DAC
1994
ACM
15 years 10 months ago
Incorporating Speculative Execution in Exact Control-Dependent Scheduling
- This paper describes a symbolic formulation that allows incorporation of speculative operation execution (preexecution) in an exact control-dependent scheduling of arbitrary forw...
Ivan P. Radivojevic, Forrest Brewer
COCOON
2006
Springer
15 years 10 months ago
Finding Small OBDDs for Incompletely Specified Truth Tables Is Hard
We present an efficient reduction mapping undirected graphs G with n = 2k vertices for integers k to tables of partially specified Boolean functions g : {0, 1}4k+1 {0, 1, } so tha...
Jesper Torp Kristensen, Peter Bro Miltersen
DIS
2006
Springer
15 years 10 months ago
Symmetric Item Set Mining Based on Zero-Suppressed BDDs
In this paper, we propose a method for discovering hidden information from large-scale item set data based on the symmetry of items. Symmetry is a fundamental concept in the theory...
Shin-ichi Minato