Sciweavers

206 search results - page 36 / 42
» Optimally Profiling and Tracing Programs
Sort
View
PLDI
2005
ACM
14 years 29 days ago
Code placement for improving dynamic branch prediction accuracy
Code placement techniques have traditionally improved instruction fetch bandwidth by increasing instruction locality and decreasing the number of taken branches. However, traditio...
Daniel A. Jiménez
PVM
2005
Springer
14 years 26 days ago
Cooperative Write-Behind Data Buffering for MPI I/O
Many large-scale production parallel programs often run for a very long time and require data checkpoint periodically to save the state of the computation for program restart and/o...
Wei-keng Liao, Kenin Coloma, Alok N. Choudhary, Le...
SIAMSC
2008
139views more  SIAMSC 2008»
13 years 7 months ago
Probing the Pareto Frontier for Basis Pursuit Solutions
The basis pursuit problem seeks a minimum one-norm solution of an underdetermined least-squares problem. Basis pursuit denoise (BPDN) fits the least-squares problem only approximat...
Ewout van den Berg, Michael P. Friedlander
MICAI
2010
Springer
13 years 5 months ago
Teaching a Robot to Perform Tasks with Voice Commands
The full deployment of service robots in daily activities will require the robot to adapt to the needs of non-expert users, particularly, to learn how to perform new tasks from “...
Ana C. Tenorio-Gonzalez, Eduardo F. Morales, Luis ...
ICCAD
2001
IEEE
185views Hardware» more  ICCAD 2001»
14 years 4 months ago
Application-Driven Processor Design Exploration for Power-Performance Trade-off Analysis
1 - This paper presents an efficient design exploration environment for high-end core processors. The heart of the proposed design exploration framework is a two-level simulation e...
Diana Marculescu, Anoop Iyer