121 search results - page 11 / 25 » Modular Decomposition of Hypergraphs |
CP
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. This paper deals with the problem of solving efficiently structured CSPs. It is well known that (hyper)tree-decompositions offer the best approaches from a theoretical v...
ICSE
1997
IEEE-ACM
13 years 11 months ago
1997
IEEE-ACM
We apply mathematical concept analysis in order to modularize legacy code. By analysing the relation between procedures and global variables, a so-called concept lattice is constr...
CADE
2008
Springer
14 years 7 months ago
2008
Springer
We present a novel proof of Toyama's famous modularity of confluence result for term rewriting systems. Apart from being short and intuitive, the proof is modular itself in th...
ICSE
2003
IEEE-ACM
14 years 7 months ago
2003
IEEE-ACM
We present a new methodology for automatic verification of C programs against finite state machine specifications. Our approach is compositional, naturally enabling us to decompos...
ICNC
2005
Springer
14 years 25 days ago
2005
Springer
Abstract. Through task decomposition and module combination, minmax modular support vector machines (M3 -SVMs) can be successfully used for difficult pattern classification task. ...