Sciweavers

1707 search results - page 44 / 342
» Early Integer Programming
Sort
View
OL
2010
87views more  OL 2010»
13 years 9 months ago
Uniqueness of integer solution of linear equations
Abstract. We consider the system of m linear equations in n integer variables Ax = d and give sufficient conditions for the uniqueness of its integer solution x ∈ {−1,1}n by r...
O. L. Mangasarian, Michael C. Ferris
TOOLS
2009
IEEE
14 years 5 months ago
Early Crosscutting Metrics as Predictors of Software Instability
Many researchers claim that crosscutting concerns, which emerge in early software development stages, are harmful to software stability. On the other hand, there is a lack of effec...
José María Conejero, Eduardo Figueir...
CCCG
2008
14 years 13 days ago
Polynomial irreducibility testing through Minkowski summand computation
In this paper, we address the problem of deciding absolute irreducibility of multivariate polynomials. Our work has been motivated by a recent work due to Gao et. al. [1, 2, 3] wh...
Deepanjan Kesh, Shashank K. Mehta
SAS
2007
Springer
112views Formal Methods» more  SAS 2007»
14 years 5 months ago
Taming the Wrapping of Integer Arithmetic
Variables in programs are usually confined to a fixed number of bits and results that require more bits are truncated. Due to the use of 32-bit and 64-bit variables, inadvertent ...
Axel Simon, Andy King
PLDI
1998
ACM
14 years 3 months ago
Exploiting Idle Floating-Point Resources for Integer Execution
In conventional superscalar microarchitectures with partitioned integer and floating-point resources, all floating-point resources are idle during execution of integer programs....
S. Subramanya Sastry, Subbarao Palacharla, James E...