15494 search results - page 32 / 3099 » Computing dynamic clusters |
IWCMC
2010
ACM
14 years 3 months ago
2010
ACM
—Analysis and modeling of wireless networks greatly depend on understanding the structure of underlying mobile nodes. In this paper we present two clustering algorithms to determ...
IPPS
2007
IEEE
14 years 4 months ago
2007
IEEE
Resource performance in the Computational Grid is not only heterogeneous, but also changing dynamically. However scheduling algorithms designed for traditional parallel and distri...
PDPTA
2000
13 years 11 months ago
2000
The growing computational power requirements of grand challenge applications has promoted the need for linking highperformance computational resources distributed across multiple ...
IPPS
2000
IEEE
14 years 2 months ago
2000
IEEE
With the ever-increasing demands on server applications, many new server services are distributed in nature. We evaluated one hundred deployed systems and found that over a one-yea...
PAKDD
2005
ACM
14 years 3 months ago
2005
ACM
Density-based clustering has the advantages for (i) allowing arbitrary shape of cluster and (ii) not requiring the number of clusters as input. However, when clusters touch each o...