1088 search results - page 158 / 218 » Intelligent Optimization of Parallel and Distributed Applica... |
112
Voted
EUROPAR
1999
Springer
15 years 6 months ago
1999
Springer
Recently, a number of graph partitioning applications have emerged with additional requirements that the traditional graph partitioning model alone cannot e ectively handle. One s...
133
click to vote
DCOSS
2006
Springer
15 years 6 months ago
2006
Springer
Wireless sensor networks are often studied with the goal of removing information from the network as efficiently as possible. However, when the application also includes an actuato...
157
Voted
SPAA
1994
ACM
15 years 6 months 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...
121
Voted
ICDCS
2010
IEEE
15 years 6 months ago
2010
IEEE
This paper proposes LTNC, a new recoding algorithm to build low complexity network codes. At the core of LTNC is a decentralized version of LT codes that allows the use of fast be...
149
Voted
CCGRID
2008
IEEE
15 years 4 months ago
2008
IEEE
Selection of resources for execution of scientific workflows in data grids becomes challenging with the exponential growth of files as a result of the distribution of scientific e...