3 search results - page 1 / 1 » Improving the Forward Chaining Algorithm for Conceptual Grap... |
KR
2004
Springer
15 years 2 months ago
2004
Springer
Simple Conceptual Graphs (SGs) are used to represent entities and relations between these entities: they can be translated into positive, conjunctive, existential first-order log...
95
Voted
PLDI
1993
ACM
15 years 1 months ago
1993
ACM
Program analysis and optimizationcan be speeded upthrough the use of the dependence flow graph (DFG), a representation of program dependences which generalizes def-use chains and...
109
Voted
TSP
2010
14 years 4 months ago
2010
Distributed averaging describes a class of network algorithms for the decentralized computation of aggregate statistics. Initially, each node has a scalar data value, and the goal...