COCOON
2006
Springer
13 years 8 months ago
2006
Springer
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...
ICRA
2002
IEEE
13 years 9 months ago
2002
IEEE
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...
GLVLSI
2010
IEEE
13 years 9 months ago
2010
IEEE
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...
ASIAMS
2009
IEEE
13 years 9 months ago
2009
IEEE
—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 ...
COMPSAC
2003
IEEE
13 years 9 months ago
2003
IEEE
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...
WEA
2004
Springer
13 years 9 months ago
2004
Springer
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, ...
APPROX
2009
Springer
13 years 11 months ago
2009
Springer
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...