Sciweavers

759 search results - page 86 / 152
» What Can Be Implemented Anonymously
Sort
View
LCPC
1999
Springer
14 years 2 months ago
High Performance Numerical Computing in Java: Language and Compiler Issues
Poor performance on numerical codes has slowed the adoption of Java within the technical computing community. In this paper we describe a prototype array library and a research pr...
Pedro V. Artigas, Manish Gupta, Samuel P. Midkiff,...
APPROX
2006
Springer
126views Algorithms» more  APPROX 2006»
14 years 1 months ago
Better Approximations for the Minimum Common Integer Partition Problem
Abstract. In the k-Minimum Common Integer Partition Problem, abbreviated k-MCIP, we are given k multisets X1, . . . , Xk of positive integers, and the goal is to find an integer mu...
David P. Woodruff
ICS
2010
Tsinghua U.
14 years 13 days ago
Speeding up Nek5000 with autotuning and specialization
Autotuning technology has emerged recently as a systematic process for evaluating alternative implementations of a computation, in order to select the best-performing solution for...
Jaewook Shin, Mary W. Hall, Jacqueline Chame, Chun...
NSDI
2008
14 years 9 days ago
Efficiency Through Eavesdropping: Link-layer Packet Caching
The broadcast nature of wireless networks is the source of both their utility and much of their complexity. To turn what would otherwise be unwanted interference into an advantage...
Mikhail Afanasyev, David G. Andersen, Alex C. Snoe...
FMCAD
2008
Springer
13 years 11 months ago
BackSpace: Formal Analysis for Post-Silicon Debug
Post-silicon debug is the problem of determining what's wrong when the fabricated chip of a new design behaves incorrectly. This problem now consumes over half of the overall ...
Flavio M. de Paula, Marcel Gort, Alan J. Hu, Steve...