Sciweavers

COCOON
2006
Springer
14 years 4 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
ICRA
2002
IEEE
108views Robotics» more  ICRA 2002»
14 years 5 months ago
An Execution Control System for Autonomous Robots
Abstract— This paper presents some recent developments of the LAAS architecture for autonomous mobile robots. In particular, we specify the role of the Execution Control level of...
François Felix Ingrand, Frederic Py
GLVLSI
2010
IEEE
139views VLSI» more  GLVLSI 2010»
14 years 5 months ago
Dynamically resizable binary decision diagrams
We present the architecture of a new Ordered Binary Decision Diagram library that is designed from the ground up to be space efficient. The main novelty lies in the library’s no...
Stergios Stergiou, Jawahar Jain
ASIAMS
2009
IEEE
14 years 5 months ago
Evolutionary-Reduced Ordered Binary Decision Diagram
—Reduced ordered binary decision diagram (ROBDD) is a memory-efficient data structure which is used in many applications such as synthesis, digital system, verification, testing ...
Hossein Moeinzadeh, Mehdi Mohammadi, Hossein Pazho...
COMPSAC
2003
IEEE
14 years 5 months ago
A Cut-Based Algorithm for Reliability Analysis of Terminal-Pair Network Using OBDD
In this paper, we propose an algorithm to construct the Ordered Binary Decision Diagram (OBDD) representing the cut function of a terminal-pair network. The algorithm recognizes i...
Yung-Ruei Chang, Hung-Yau Lin, Ing-Yi Chen, Sy-Yen...
WEA
2004
Springer
124views Algorithms» more  WEA 2004»
14 years 5 months ago
Experimental Studies of Symbolic Shortest-Path Algorithms
Abstract. Graphs can be represented symbolically by the Ordered Binary Decision Diagram (OBDD) of their characteristic function. To solve problems in such implicitly given graphs, ...
Daniel Sawitzki
APPROX
2009
Springer
137views Algorithms» more  APPROX 2009»
14 years 7 months ago
Testing Computability by Width Two OBDDs
Property testing is concerned with deciding whether an object (e.g. a graph or a function) has a certain property or is “far” (for some definition of far) from every object w...
Dana Ron, Gilad Tsur