1534 search results - page 173 / 307 » Stochastic Bounds on Execution Times of Parallel Computation... |
224
click to vote
POPL
2008
ACM
16 years 1 months ago
2008
ACM
Self-adjusting computation enables writing programs that can automatically and efficiently respond to changes to their data (e.g., inputs). The idea behind the approach is to stor...
100
click to vote
ICPADS
2002
IEEE
15 years 5 months ago
2002
IEEE
In this paper, an adaptive matrix multiplication algorithm for dynamic heterogeneous environments is developed and evaluated. Unlike the state-of-the-art approaches, where load ba...
139
click to vote
SPAA
1999
ACM
15 years 5 months ago
1999
ACM
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...
102
click to vote
ISORC
2005
IEEE
15 years 6 months ago
2005
IEEE
This paper is on the construction of a fault-tolerant and responsive server subsystem in an application context where the subsystem is accessed through an asynchronous network by ...
85
Voted
JC
2008
15 years 23 days ago
2008
We describe an algorithm to count the number of distinct real zeros of a polynomial (square) system f. The algorithm performs O(log(nD(f))) iterations (grid refinements) where n is...