Sciweavers

1652 search results - page 241 / 331
» Matching Vector Codes
Sort
View
SC
2004
ACM
15 years 4 months ago
Analysis and Performance Results of a Molecular Modeling Application on Merrimac
The Merrimac supercomputer uses stream processors and a highradix network to achieve high performance at low cost and low power. The stream architecture matches the capabilities o...
Mattan Erez, Jung Ho Ahn, Ankit Garg, William J. D...
IEEEAMS
2003
IEEE
15 years 4 months ago
Service Morphing: Integrated System- and Application-Level Service
Service morphing is a set of techniques used to continuously meet an application’s Quality of Service (QoS) needs, in the presence of run-time variations in service locations, p...
Christian Poellabauer, Karsten Schwan, Sandip Agar...
WCRE
2003
IEEE
15 years 4 months ago
RegReg: a Lightweight Generator of Robust Parsers for Irregular Languages
In reverse engineering, parsing may be partially done to extract lightweight source models. Parsing code containing preprocessing directives, syntactical errors and embedded langu...
Mario Latendresse
IWPC
2002
IEEE
15 years 4 months ago
Mining System-User Interaction Traces for Use Case Models
While code understanding is the primary program comprehension activity, it is quite challenging to recognize the application requirements from code, since they have usually been o...
Mohammad El-Ramly, Eleni Stroulia, Paul G. Sorenso...
PPOPP
1999
ACM
15 years 3 months ago
Automatic Parallelization of Divide and Conquer Algorithms
Divide and conquer algorithms are a good match for modern parallel machines: they tend to have large amounts of inherent parallelism and they work well with caches and deep memory...
Radu Rugina, Martin C. Rinard