Sciweavers

57 search results - page 4 / 12
» On the Construction of Multiple-Valued Decision Diagrams
Sort
View
LICS
2005
IEEE
14 years 1 months ago
A Polynomial Time Presburger Criterion and Synthesis for Number Decision Diagrams
Number Decision Diagrams (NDD) are the automatabased symbolic representation for manipulating sets of integer vectors encoded as strings of digit vectors (least or most significa...
Jérôme Leroux
TC
1998
13 years 7 months ago
Using Decision Diagrams to Design ULMs for FPGAs
—Many modern Field Programmable Logic Arrays (FPGAs) use lookup table (LUT) logic blocks which can be programmed to realize any function of a fixed number of inputs. It is possib...
Zeljko Zilic, Zvonko G. Vranesic
CPAIOR
2007
Springer
14 years 2 months ago
Cost-Bounded Binary Decision Diagrams for 0-1 Programming
Abstract. In recent work binary decision diagrams (BDDs) were introduced as a technique for postoptimality analysis for integer programming. In this paper we show that much smaller...
Tarik Hadzic, John N. Hooker
TCAD
1998
161views more  TCAD 1998»
13 years 7 months ago
Ordered Kronecker functional decision diagrams-a data structure for representation and manipulation of Boolean functions
— Ordered Kronecker functional decision diagrams (OKFDD’s) are a data structure for efficient representation and manipulation of Boolean functions. OKFDD’s are a generalizat...
Rolf Drechsler, Bernd Becker
ISCAS
2002
IEEE
116views Hardware» more  ISCAS 2002»
14 years 24 days ago
Antisymmetries in the realization of Boolean functions
New symmetries of degree two are introduced, along with spectral techniques for identifying these symmetries. Some applications of these symmetries are discussed, in particular th...
Jacqueline E. Rice, Jon C. Muzio