2976 search results - page 64 / 596 » On the bounded integer programming |
SAS
2007
Springer
14 years 4 months ago
2007
Springer
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 ...
SODA
1992
ACM
13 years 11 months ago
1992
ACM
In this paper we give the first self-testers and checkers for polynomials over rational and integer domains. We also show significantly stronger bounds on the efficiency of a simp...
PLDI
1998
ACM
14 years 2 months ago
1998
ACM
In conventional superscalar microarchitectures with partitioned integer and floating-point resources, all floating-point resources are idle during execution of integer programs....
NETWORKS
2006
13 years 10 months ago
2006
We study capacitated network flow problems with supplies and demands defined on a countably infinite collection of nodes having finite degree. This class of network flow models in...
LCPC
2001
Springer
14 years 2 months ago
2001
Springer
Integer division, modulo, and remainder operations are expressive and useful operations. They are logical candidates to express complex data accesses such as the wrap-around behav...