Sciweavers

646 search results - page 67 / 130
» Hybrid decision diagrams
Sort
View
ICRA
2002
IEEE
108views Robotics» more  ICRA 2002»
14 years 1 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
STACS
2001
Springer
14 years 1 months ago
New Bounds on the OBDD-Size of Integer Multiplication via Universal Hashing
Abstract. Ordered binary decision diagrams (OBDDs) nowadays belong to the most common representation types for Boolean functions. Although they allow important operations such as s...
Philipp Woelfel
DAC
1999
ACM
14 years 1 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
DATE
1998
IEEE
103views Hardware» more  DATE 1998»
14 years 1 months ago
Efficient Encoding Schemes for Symbolic Analysis of Petri Nets
Petri nets are a graph-based formalism appropriate to model concurrentsystems such as asynchronouscircuits or network protocols. Symbolic techniques based on Binary Decision Diagr...
Enric Pastor, Jordi Cortadella
IJCAI
2007
13 years 10 months ago
Compiling Bayesian Networks Using Variable Elimination
Compiling Bayesian networks has proven an effective approach for inference that can utilize both global and local network structure. In this paper, we define a new method of comp...
Mark Chavira, Adnan Darwiche