Sciweavers

406 search results - page 40 / 82
» Boosting Using Branching Programs
Sort
View
MICRO
2008
IEEE
107views Hardware» more  MICRO 2008»
14 years 4 months ago
A distributed processor state management architecture for large-window processors
— Processor architectures with large instruction windows have been proposed to expose more instruction-level parallelism (ILP) and increase performance. Some of the proposed arch...
Isidro Gonzalez, Marco Galluzzi, Alexander V. Veid...
STVR
2010
99views more  STVR 2010»
13 years 8 months ago
Fault localization based on information flow coverage
Failures triggered by hard to debug defects usually involve complex interactions between many program elements. We hypothesize that information flows present a good model for such ...
Wes Masri
COCO
2005
Springer
128views Algorithms» more  COCO 2005»
14 years 3 months ago
More on Noncommutative Polynomial Identity Testing
We continue the study of noncommutative polynomial identity testing initiated by Raz and Shpilka and present efficient algorithms for the following problems in the noncommutative...
Andrej Bogdanov, Hoeteck Wee
ISCA
1997
IEEE
137views Hardware» more  ISCA 1997»
14 years 2 months ago
A Language for Describing Predictors and Its Application to Automatic Synthesis
As processor architectures have increased their reliance on speculative execution to improve performance, the importance of accurate prediction of what to execute speculatively ha...
Joel S. Emer, Nicholas C. Gloy
CIDU
2010
13 years 7 months ago
Optimal Partitions of Data In Higher Dimensions
Given any collection of data cells in a data space X, consider the problem of finding the optimal partition of the data cells into blocks which are unions of cells. The algorithms...
Bradley W. Jackson, Jeffrey D. Scargle, Chris Cusa...