Sciweavers

10054 search results - page 1681 / 2011
» On the Complexity of Function Learning
Sort
View
IEEEPACT
2007
IEEE
16 years 13 days ago
Automatic Correction of Loop Transformations
Loop nest optimization is a combinatorial problem. Due to the growing complexity of modern architectures, it involves two increasingly difficult tasks: (1) analyzing the profita...
Nicolas Vasilache, Albert Cohen, Louis-Noël P...
142
Voted
IEEEPACT
2007
IEEE
16 years 13 days ago
Paceline: Improving Single-Thread Performance in Nanoscale CMPs through Core Overclocking
Under current worst-case design practices, manufacturers specify conservative values for processor frequencies in order to guarantee correctness. To recover some of the lost perfo...
Brian Greskamp, Josep Torrellas
162
Voted
IPPS
2007
IEEE
16 years 13 days ago
The Adaptive Code Kitchen: Flexible Tools for Dynamic Application Composition
Driven by the increasing componentization of scientific codes, the deployment of high-end system infrastructures such as the Grid, and the desire to support high level problem so...
Pilsung Kang 0002, Mike Heffner, Joy Mukherjee, Na...
159
Voted
IPPS
2007
IEEE
16 years 13 days ago
Memory Optimizations For Fast Power-Aware Sparse Computations
— We consider memory subsystem optimizations for improving the performance of sparse scientific computation while reducing the power consumed by the CPU and memory. We first co...
Konrad Malkowski, Padma Raghavan, Mary Jane Irwin
IROS
2007
IEEE
111views Robotics» more  IROS 2007»
16 years 13 days ago
Design of a modular snake robot
— Many factors such as size, power, and weight constrain the design of modular snake robots. Meeting these constraints requires implementing a complex mechanical and electrical a...
Cornell Wright III, Aaron Johnson, Aaron Peck, Zac...
« Prev « First page 1681 / 2011 Last » Next »