688 search results - page 73 / 138 » Comparison of Conceptual Graphs |
ICALP
1992
Springer
15 years 1 months ago
1992
Springer
Suppose that n tokens are arbitrarily placed on the n nodes of a graph. At each parallel step one token may be moved from each node to an adjacent node. An algorithm for the near-...
WABI
2001
Springer
15 years 2 months ago
2001
Springer
We describe algorithms for pattern matching and pattern learning in TOPS diagrams (formal descriptions of protein topologies). These problems can be reduced to checking for subgrap...
SEMWEB
2005
Springer
15 years 3 months ago
2005
Springer
The paper reports on the formal framework to design strategies for multi-issue non-symmetric meaning negotiations among software agents in a distributed information retrieval syste...
CA
1999
IEEE
15 years 2 months ago
1999
IEEE
This paper shows a new approach to model and control interactive objects for simulations with virtual human agents when real time interactivity is essential. A general conceptuali...
122
click to vote
GLVLSI
1996
IEEE
15 years 1 months ago
1996
IEEE
Inthispaperweintroduceanondeterministiccounterpart to Reduced, Ordered Binary Decision Diagrams for the representation and manipulation of logic functions. ROBDDs are conceptually...