251 search results - page 17 / 51 » On Modular Decomposition of Integers |
143
click to vote
ITCC
2005
IEEE
15 years 7 months ago
2005
IEEE
We define here the Montgomery Exponent of order s, modulo the odd integer N, by MEXP = MEXP(A, X, N, s) = AX 2−s(X−1) (mod N), and illustrate some properties and usage of thi...
ICSE
2005
IEEE-ACM
16 years 1 months ago
2005
IEEE-ACM
Aspects cut new interfaces through the primary decomposition of a system. This implies that in the presence of aspects, the complete interface of a module can only be determined o...
111
click to vote
CASSIS
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. Abstract interpretation is a particularly well-suited methodology to build modular correctness proof of static analysers. Proof modularity becomes essential when correctn...
113
click to vote
ESANN
2003
15 years 2 months ago
2003
Abstract. This paper considers the general problem of function estimation with a modular approach of neural computing. We propose to use functionally independent subnetworks to lea...
112
click to vote
IOR
2006
15 years 1 months ago
2006
Mixed-Integer Programs (MIP's) involving logical implications modelled through big-M coefficients, are notoriously among the hardest to solve. In this paper we propose and an...