Sciweavers

358 search results - page 13 / 72
» GCD of Many Integers
Sort
View
HPCA
1999
IEEE
13 years 11 months ago
Dynamically Exploiting Narrow Width Operands to Improve Processor Power and Performance
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...
David Brooks, Margaret Martonosi
ICCAD
2005
IEEE
127views Hardware» more  ICCAD 2005»
14 years 4 months ago
Hardware synthesis from guarded atomic actions with performance specifications
We present a new hardware synthesis methodology for guarded atomic actions (or rules), which satisfies performance-related scheduling specifications provided by the designer. The ...
Daniel L. Rosenband
ISCA
1998
IEEE
119views Hardware» more  ISCA 1998»
13 years 11 months ago
Execution Characteristics of Desktop Applications on Windows NT
This paper examines the performance of desktop applications running on the Microsoft Windows NT operating system on Intel x86 processors, and contrasts these applications to the p...
Dennis C. Lee, Patrick Crowley, Jean-Loup Baer, Th...
IPCO
2008
118views Optimization» more  IPCO 2008»
13 years 9 months ago
Constraint Orbital Branching
Orbital branching is a method for branching on variables in integer programming that reduces the likelihood of evaluating redundant, isomorphic nodes in the branch-and-bound proce...
James Ostrowski, Jeff Linderoth, Fabrizio Rossi, S...
ICALP
1992
Springer
13 years 11 months ago
What Good Are Digital Clocks?
Real-time systems operate in \real," continuous time and state changes may occur at any real-numbered time point. Yet many veri cation methods are based on the assumption that...
Thomas A. Henzinger, Zohar Manna, Amir Pnueli