397 search results - page 67 / 80 » Inversion in Time |
TC
2011
13 years 4 months ago
2011
—During any composite computation, there is a constant need for rounding intermediate results before they can participate in further processing. Recently, a class of number repre...
IPPS
2008
IEEE
2008
IEEE
Modeling and predicting application performance on parallel computers using HPC challenge benchmarks
14 years 4 months ago
A method is presented for modeling application performance on parallel computers in terms of the performance of microkernels from the HPC Challenge benchmarks. Specifically, the a...
INFOCOM
2010
IEEE
13 years 8 months ago
2010
IEEE
—Neighbor discovery is essential for the process of self-organization of a wireless network, where almost all routing and medium access protocols need knowledge of one-hop neighb...
IPL
2007
13 years 9 months ago
2007
We prove that there is a polynomial time substitution (y1, . . . , yn) := g(x1, . . . , xk) with k << n such that whenever the substitution instance A(g(x1, . . . , xk)) of ...
SPAA
1997
ACM
14 years 1 months ago
1997
ACM
A parallel multithreaded program that is ostensibly deterministic may nevertheless behave nondeterministically due to bugs in the code. These bugs are called determinacy races, an...