Sciweavers

210 search results - page 15 / 42
» Widening Integer Arithmetic
Sort
View
ISTCS
1995
Springer
13 years 11 months ago
Computation of Highly Regular Nearby Points
We call a vector x 2 IRn highly regular if it satis es < x m >= 0 for some short, non{zero integer vector m where < : : > is the inner product. We present an algorithm...
Carsten Rössner, Claus-Peter Schnorr
ICCAD
1995
IEEE
127views Hardware» more  ICCAD 1995»
13 years 11 months ago
Hybrid decision diagrams
Abstract: Functions that map boolean vectors into the integers are important for the design and veri cation of arithmetic circuits. MTBDDs and BMDs have been proposed for represent...
Edmund M. Clarke, Masahiro Fujita, Xudong Zhao
IPCO
2007
143views Optimization» more  IPCO 2007»
13 years 8 months ago
On the Exact Separation of Mixed Integer Knapsack Cuts
During the last decades, much research has been conducted deriving classes of valid inequalities for single-row mixed integer programming polyhedrons. However, no such class has ha...
Ricardo Fukasawa, Marcos Goycoolea
DCC
2007
IEEE
14 years 7 months ago
On binary signed digit representations of integers
Applications of signed digit representations of an integer include computer arithmetic, cryptography, and digital signal processing. An integer of length n bits can have several b...
Nevine Maurice Ebeid, M. Anwar Hasan
TC
2008
13 years 7 months ago
Converting to and from Dilated Integers
Abstract-- Dilated integers form an ordered group of the cartesian indices into a d-dimensional array represented in Morton order. Efficient implementations of its operations can b...
Rajeev Raman, David S. Wise