Sciweavers

232 search results - page 40 / 47
» On Characterizing the Data Access Complexity of Programs
Sort
View
BMCBI
2005
113views more  BMCBI 2005»
14 years 10 months ago
Pathway level analysis of gene expression using singular value decomposition
Background: A promising direction in the analysis of gene expression focuses on the changes in expression of specific predefined sets of genes that are known in advance to be rela...
John K. Tomfohr, Jun Lu, Thomas B. Kepler
MICRO
2006
IEEE
145views Hardware» more  MICRO 2006»
15 years 4 months ago
Virtually Pipelined Network Memory
We introduce virtually-pipelined memory, an architectural technique that efficiently supports high-bandwidth, uniform latency memory accesses, and high-confidence throughput eve...
Banit Agrawal, Timothy Sherwood
IPPS
2008
IEEE
15 years 5 months ago
Lattice Boltzmann simulation optimization on leading multicore platforms
We present an auto-tuning approach to optimize application performance on emerging multicore architectures. The methodology extends the idea of searchbased performance optimizatio...
Samuel Williams, Jonathan Carter, Leonid Oliker, J...
GECCO
2004
Springer
106views Optimization» more  GECCO 2004»
15 years 4 months ago
Evolving En-Route Caching Strategies for the Internet
Nowadays, large distributed databases are commonplace. Client applications increasingly rely on accessing objects from multiple remote hosts. The Internet itself is a huge network ...
Jürgen Branke, Pablo Funes, Frederik Thiele
SIGSOFT
2000
ACM
15 years 3 months ago
Automated systematic testing for constraint-based interactive services
Constraint-based languages can express in a concise way the complex logic of a new generation of interactive services for applications such as banking or stock trading, that must ...
Patrice Godefroid, Lalita Jategaonkar Jagadeesan, ...