Sciweavers

251 search results - page 34 / 51
» On Modular Decomposition of Integers
Sort
View
MOC
2002
132views more  MOC 2002»
14 years 9 months ago
Comparison of algorithms to calculate quadratic irregularity of prime numbers
In previous work, the author has extended the concept of regular and irregular primes to the setting of arbitrary totally real number fields k0, using the values of the zeta functi...
Joshua Holden
ICSM
2006
IEEE
15 years 3 months ago
Quantifying the Effects of Aspect-Oriented Programming: A Maintenance Study
One of the main promises of aspect-oriented programming (AOP) is to promote improved modularization of crosscutting concerns, thereby enhancing the software stability in the prese...
Uirá Kulesza, Cláudio Sant'Anna, Ale...
ENTCS
2007
96views more  ENTCS 2007»
14 years 9 months ago
Deduction, Strategies, and Rewriting
Automated deduction methods should be specified not procedurally, but declaratively, as inference systems which are proved correct regardless of implementation details. Then, diļ...
Steven Eker, Narciso Martí-Oliet, Jos&eacut...
DM
2010
103views more  DM 2010»
14 years 9 months ago
Degree-bounded factorizations of bipartite multigraphs and of pseudographs
For d 1, s 0 a (d,d +s)-graph is a graph whose degrees all lie in the interval {d,d +1,...,d +s}. For r 1, a 0 an (r,r+1)-factor of a graph G is a spanning (r,r+a)-subgraph of...
Anthony J. W. Hilton
SIAMJO
2008
100views more  SIAMJO 2008»
14 years 9 months ago
On the Global Solution of Linear Programs with Linear Complementarity Constraints
This paper presents a parameter-free integer-programming based algorithm for the global resolution of a linear program with linear complementarity constraints (LPCC). The cornersto...
Jing Hu, John E. Mitchell, Jong-Shi Pang, Kristin ...