688 search results - page 79 / 138 » Comparison of Conceptual Graphs |
SCAM
2008
IEEE
15 years 4 months ago
2008
IEEE
Bug-checking tools have been used with some success in recent years to find bugs in software. For finding bugs that can cause security vulnerabilities, bug checking tools requir...
CIVR
2007
Springer
15 years 3 months ago
2007
Springer
Ensuring the uniqueness of trademark images and protecting their identities are the most important objectives for the trademark registration process. To prevent trademark infringe...
DAC
2000
ACM
15 years 10 months ago
2000
ACM
Joint module selection and retiming is a powerful technique to optimize the implementation cost and the speed of a circuit specified using a synchronous data-flow graph (DFG). In ...
110
click to vote
MOBIHOC
2002
ACM
15 years 9 months ago
2002
ACM
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
CAV
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. The problem of finding a small unsatisfiable core of an unsatisfiable CNF formula is addressed. The proposed algorithm, Trimmer, iterates over each internal node d in the...