Sciweavers

192 search results - page 35 / 39
» Arithmetic Optimization Using Carry-Save-Adders
Sort
View
ICS
2003
Tsinghua U.
14 years 17 days ago
Enhancing memory level parallelism via recovery-free value prediction
—The ever-increasing computational power of contemporary microprocessors reduces the execution time spent on arithmetic computations (i.e., the computations not involving slow me...
Huiyang Zhou, Thomas M. Conte
COMPGEOM
1998
ACM
13 years 11 months ago
Rotational Polygon Containment and Minimum Enclosure
An algorithm and a robust floating point implementation is given for rotational polygon containment: given polygons P1,P2,P3,...,Pk and a container polygon C, find rotations and...
Victor Milenkovic
CPM
2006
Springer
107views Combinatorics» more  CPM 2006»
13 years 11 months ago
Tiling an Interval of the Discrete Line
We consider the problem of tiling a segment {0, . . . , n} of the discrete line. More precisely, we ought to characterize the structure of the patterns that tile a segment and thei...
Olivier Bodini, Eric Rivals
TACAS
2000
Springer
151views Algorithms» more  TACAS 2000»
13 years 11 months ago
Salsa: Combining Constraint Solvers with BDDs for Automatic Invariant Checking
Salsa is an invariant checker for speci cations in SAL the SCR Abstract Language. To establish a formula as an invariant without any user guidance Salsa carries out an induction pr...
Ramesh Bharadwaj, Steve Sims
CP
2008
Springer
13 years 9 months ago
Universal Booleanization of Constraint Models
Abstract. While the efficiency and scalability of modern SAT technology offers an intriguing alternative approach to constraint solving via translation to SAT, previous work has mo...
Jinbo Huang