CPC
2008
13 years 11 months ago
2008
![B2[ g] Sets and a Conjecture of Schinzel and Schmidt](https://www.sciweavers.org/files/imagecache/thumbnail/default/content.jpg "B2[ g] Sets and a Conjecture of Schinzel and Schmidt")
A set of integers A is called a B2[g] set if every integer m has at most g representations of the form m = a + a , with a a and a, a A. We obtain a new lower bound for F(g, n), t...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
The packing chromatic number (G) of a graph G is the least integer k for which there exists a mapping f from V (G) to {1, 2, . . ., k} such that any two vertices of color i
AAAI
1998
14 years 24 days ago
1998
Production planning is an important task in manufacturing systems. We consider a real-world capacitated lot-sizing problem (CLSP) from the process industry. Because the problem re...
DIMVA
2006
14 years 25 days ago
2006
Incomplete or improper input validation is one of the major sources of security bugs in programs. While traditional approaches often focus on detecting string related buffer overfl...
CCCG
2008
14 years 27 days ago
2008
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...
PLDI
1994
ACM
14 years 3 months ago
1994
ACM
Integer division remains expensive on today's processors as the cost of integer multiplication declines. We present code sequences for division by arbitrary nonzero integer c...
PLDI
1998
ACM
14 years 3 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....
HPCA
1999
IEEE
14 years 3 months ago
1999
IEEE
In general-purpose microprocessors, recent trends have pushed towards 64-bit word widths, primarily to accommodate the large addressing needs of some programs. Many integer proble...
IEEEPACT
2000
IEEE
14 years 3 months ago
2000
IEEE
Multimedia instruction set extensions have become a prominent feature in desktop microprocessor platforms, promising superior performance on a wide range of floating-point and int...
AUSSOIS
2001
Springer
14 years 4 months ago
2001
Springer
In recent years the branch-and-cut method, a synthesis of the classical branch-and-bound and cutting plane methods, has proven to be a highly successful approach to solving large-s...