251 search results - page 19 / 51 » On Modular Decomposition of Integers |
CADE
2008
Springer
15 years 10 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
15 years 9 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...
86
Voted
ICNC
2005
Springer
15 years 3 months 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. ...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We study decompositions of the global NVALUE constraint. Our main contribution is theoretical: we show that there are propagators for global constraints like NVALUE which decomposi...
FAC
2010
14 years 8 months ago
2010
For more than a decade, the trend in geometric constraint systems solving has been to use a geometric decomposition/recombination approach. These methods are generally grounded on...