1127 search results - page 49 / 226 » Testing the Expansion of a Graph |
WCE
2007
14 years 9 days ago
2007
Improving testability during the early stages of High-level synthesis has several advantages including reduced test hardware overhead and design iterations. Recently, BIST techniq...
VL
1999
IEEE
14 years 3 months ago
1999
IEEE
We present new pragmatic constructs for easing programming in visual graph rewriting programming languages. The first is a modification to the rewriting process for nodes the host...
ICPR
2004
IEEE
15 years 7 days ago
2004
IEEE
A new method of structural graph matching is introduced and compared against an existing method and against the maximum common subgraph. The method is approximate with polynomial ...
JAIR
2008
13 years 11 months ago
2008
We investigate the computational complexity of testing dominance and consistency in CP-nets. Up until now, the complexity of dominance has been determined only for restricted clas...
SAC
2010
ACM
14 years 4 months ago
2010
ACM
Developed using the principles of the Model-View-Controller architectural pattern, FolksEngine is a parametric search engine for folksonomies that allows us to test arbitrary sear...