Sciweavers

29 search results - page 3 / 6
» Boolean Function Manipulation on a Parallel System Using BDD...
Sort
View
ISAAC
1995
Springer
135views Algorithms» more  ISAAC 1995»
13 years 9 months ago
The I/O - Complexity of Ordered Binary - Decision Diagram Manipulation
Ordered Binary-Decision Diagrams (OBDD) are the state-of-the-art data structure for boolean function manipulation and there exist several software packages for OBDD manipulation. ...
Lars Arge
IPPS
2006
IEEE
13 years 11 months ago
Placement and routing of Boolean functions in constrained FPGAs using a distributed genetic algorithm and local search
In this work we present a system for implementing the placement and routing stages in the FPGA cycle of design, into the physical design stage. We start with the ISCAS benchmarks,...
Manuel Rubio del Solar, Juan Manuel Sánchez...
DAC
1999
ACM
13 years 10 months ago
Using Lower Bounds During Dynamic BDD Minimization
Ordered Binary Decision Diagrams BDDs are a data structure for representation and manipulation of Boolean functions often applied in VLSI CAD. The choice of the variable orderin...
Rolf Drechsler, Wolfgang Günther
IROS
2009
IEEE
144views Robotics» more  IROS 2009»
14 years 12 days ago
Experimental validation of a hybrid mobile robot mechanism with interchangeable locomotion and manipulation
—This video submission presents the experimental validation and testing of a novel Hybrid Mobile Robot (HMR) system design using a complete physical prototype. The HMR consists o...
Pinhas Ben-Tzvi
STTT
2008
90views more  STTT 2008»
13 years 5 months ago
A uniform framework for weighted decision diagrams and its implementation
1 This papers introduces a generic framework for OBDD variants with weighted edges. It covers many boolean and multi-valued OBDD-variants that have been studied in the literature a...
Jörn Ossowski, Christel Baier