688 search results - page 49 / 138 » Comparison of Conceptual Graphs |
CMOT
2004
14 years 9 months ago
2004
We describe a methodology to examine bipartite relational data structures as exemplified in networks of corporate interlocking. These structures can be represented as bipartite gr...
LCTRTS
2004
Springer
15 years 3 months ago
2004
Springer
While concurrency in embedded systems is most often supplied by real-time operating systems, this approach can be unpredictable and difficult to debug. Synchronous concurrency, i...
SPATIALCOGNITION
2000
Springer
15 years 1 months ago
2000
Springer
Navigation has always been an interdisciplinary topic of research, because mobile agents of different types are inevitably faced with similar navigational problems. Therefore, huma...
CONSTRAINTS
2010
14 years 9 months ago
2010
Abstract. We present three constraint models of the problem of finding a graceful labelling of a graph, or proving that the graph is not graceful. An experimental comparison of the...
74
Voted
ICCV
2007
IEEE
15 years 11 months ago
2007
IEEE
We pose robust matching with parametric and non-parametric constraints as the problem of finding a stable independent set (SIS) in an oriented graph whose vertices are all possible...