535 search results - page 83 / 107 » Predicting Application Run Times Using Historical Informatio... |
88
Voted
PDPTA
2000
14 years 11 months ago
2000
Exploiting compile time knowledge to improve memory bandwidth can produce noticeable improvements at run-time [13, 1]. Allocating the data structure [13] to separate memories when...
BMCBI
2007
14 years 9 months ago
2007
Background: Microarray techniques survey gene expressions on a global scale. Extensive biomedical studies have been designed to discover subsets of genes that are associated with ...
IWMM
2004
Springer
15 years 2 months ago
2004
Springer
Heap size has a huge impact on the performance of garbage collected applications. A heap that barely meets the application’s needs causes excessive GC overhead, while a heap tha...
107
click to vote
FSTTCS
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...
88
Voted
ACSC
2004
IEEE
15 years 1 months ago
2004
IEEE
Graph drawing is an important area of information visualization which concerns itself with the visualization of relational data structures. Relational data like networks, hierarch...