1325 search results - page 139 / 265 » Quasirandom Load Balancing |
132
click to vote
ICPPW
2006
IEEE
15 years 10 months ago
2006
IEEE
Homotopy methods to solve polynomial systems are well suited for parallel computing because the solution paths defined by the homotopy can be tracked independently. For sparse po...
259
click to vote
IWCMC
2006
ACM
15 years 10 months ago
2006
ACM
Introducing heterogeneous mobile devices, such as mobile phones into the large scale sparse wireless sensor networks is a promising research direction. These devices acting as mob...
129
click to vote
DEXAW
2005
IEEE
15 years 9 months ago
2005
IEEE
As Grids try to achieve optimal and balanced utilization of unused resources in a distributed system, fast and efficient discovery of resource states is a key requirement. For sm...
158
click to vote
AOSE
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Although much effort has been spent on suggesting and implementing new architectures of Multi-Agent Systems (MAS), the evaluation and comparison of these has often been d...
124
Voted
SC
1994
ACM
15 years 8 months ago
1994
ACM
In recent years, interior point algorithms have been used successfully for solving mediumto large-size linear programming LP problems. In this paper we describe a highly parallel ...