Sciweavers

2137 search results - page 232 / 428
» Experiments on Graph Clustering Algorithms
Sort
View
CCGRID
2005
IEEE
14 years 2 months ago
A dynamically adaptive hybrid algorithm for scheduling lightpaths in lambda-grids
This paper focuses on the scheduling of multiple-wavelength lightpaths and outlines an algorithm to provide increased simultaneous allocations of lightpaths on the Lambda-Grid. Se...
Neena R. Kaushik, Silvia M. Figueira
PVM
2005
Springer
14 years 2 months ago
Scalable Fault Tolerant MPI: Extending the Recovery Algorithm
ct Fault Tolerant MPI (FT-MPI)[6] was designed as a solution to allow applications different methods to handle process failures beyond simple check-point restart schemes. The init...
Graham E. Fagg, Thara Angskun, George Bosilca, Jel...
ICDM
2006
IEEE
89views Data Mining» more  ICDM 2006»
14 years 3 months ago
On the Lower Bound of Local Optimums in K-Means Algorithm
The k-means algorithm is a popular clustering method used in many different fields of computer science, such as data mining, machine learning and information retrieval. However, ...
Zhenjie Zhang, Bing Tian Dai, Anthony K. H. Tung
CCGRID
2009
IEEE
14 years 4 months ago
Reliability-Oriented Genetic Algorithm for Workflow Applications Using Max-Min Strategy
— To optimize makespan and reliability for workflow applications, most existing works use list heuristics rather than genetic algorithms (GAs) which can usually give better solut...
Xiaofeng Wang, Rajkumar Buyya, Jinshu Su
IPPS
2007
IEEE
14 years 3 months ago
A Grid-enabled Branch and Bound Algorithm for Solving Challenging Combinatorial Optimization Problems
Solving optimally large instances of combinatorial optimization problems requires a huge amount of computational resources. In this paper, we propose an adaptation of the parallel...
Mohand-Said Mezmaz, Nouredine Melab, El-Ghazali Ta...