1420 search results - page 167 / 284 » Representation of Graphs by OBDDs |
169
click to vote
ESWS
2006
Springer
15 years 10 months ago
2006
Springer
We present a new iterative algorithm for ontology mapping where we combine standard string distance metrics with a structural similarity measure that is based on a vector represent...
179
click to vote
CONCUR
2000
Springer
15 years 10 months ago
2000
Springer
Unfoldings are a technique for verification of concurrent and distributed systems introduced by McMillan. The method constructs a finite complete prefix, which can be seen as a sym...
155
click to vote
ASPDAC
2005
ACM
15 years 8 months ago
2005
ACM
In order to handle device matching for analog circuits, some pairs of modules need to be placed symmetrically with respect to a common axis. In this paper, we deal with the module...
212
click to vote
EUROGP
2008
Springer
15 years 8 months ago
2008
Springer
Two prominent genetic programming approaches are the graph-based Cartesian Genetic Programming (CGP) and Linear Genetic Programming (LGP). Recently, a formal algorithm for construc...
160
click to vote
FORTE
2010
15 years 8 months ago
2010
Abstract. Rule-based specifications have been very successful as a declarative approach in many domains, due to the handy yet solid foundations offered by rule-based machineries li...