1171 search results - page 209 / 235 » Clustering for processing rate optimization |
SRDS
1999
IEEE
14 years 21 days ago
1999
IEEE
Numerous mathematical approaches have been proposed to determine the optimal checkpoint interval for minimizing total execution time of an application in the presence of failures....
SPAA
1994
ACM
14 years 15 days ago
1994
ACM
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Wireless networks with multiple nodes that relay information from a source to a destination are expected to be deployed in many applications. In this work, we consider multihoppin...
SAC
2002
ACM
13 years 8 months ago
2002
ACM
We investigate the universal characteristics of the simulated time horizon of the basic conservative parallel algorithm when implemented on regular lattices. This technique [1, 2]...
SIAMIS
2011
13 years 3 months ago
2011
The convergence rate is analyzed for the sparse reconstruction by separable approximation (SpaRSA) algorithm for minimizing a sum f(x) + ψ(x), where f is smooth and ψ is convex, ...