1159 search results - page 4 / 232 » Binary Decision Graphs |
WEA
2004
Springer
14 years 1 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, ...
CVIU
1998
13 years 7 months ago
1998
BIRTHDAY
2008
Springer
13 years 9 months ago
2008
Springer
The paper is an overview of a recently developed compilation data structure for graphical models, with specific application to constraint networks. The AND/OR Multi-Valued Decision...
AGP
1999
IEEE
14 years 15 hour ago
1999
IEEE
Domains Decomposing Non-Redundant Sharing by Complementation . . . . . . . . . . . . . 69 Enea Zaffanella, Patricia M. Hill, Roberto Bagnara Freeness Analysis Through Linear Refine...
VLC
2002
13 years 7 months ago
2002
Graph layout algorithms typically conform to one or more aesthetic criteria (e.g. minimising the number of bends, maximising orthogonality). Determining the extent to which a grap...