963 search results - page 23 / 193 » On Computation of Performance Bounds of Optimal Index Assign... |
ISSS
2000
IEEE
14 years 26 days ago
2000
IEEE
This paper addresses the problem of estimating lower bounds on the power consumption in scheduled data flow graphs with a fixed number of allocated resources prior to binding. T...
RECOMB
2000
Springer
14 years 1 days ago
2000
Springer
In a recent paper (Preparata et al., 1999) we introduced a novel probing scheme for DNA sequencing by hybridization (SBH). The new gapped-probe scheme combines natural and univers...
SIGMOD
2004
ACM
14 years 8 months ago
2004
ACM
In this paper, we attempt to approximate and index a ddimensional (d 1) spatio-temporal trajectory with a low order continuous polynomial. There are many possible ways to choose ...
IPPS
2010
IEEE
13 years 6 months ago
2010
IEEE
In this paper, we study the problem of finding optimal mappings for several independent but concurrent workflow applications, in order to optimize performance-related criteria tog...
ISHPC
2003
Springer
14 years 1 months ago
2003
Springer
Most cluster systems used in high performance computing do not allow process relocation at run-time. Finding an allocation that results in minimal completion time is NP-hard and (n...