Sciweavers

6105 search results - page 182 / 1221
» A Parallel Algorithm for Bound-Smoothing
Sort
View
179
Voted
GECCO
2005
Springer
140views Optimization» more  GECCO 2005»
15 years 12 months ago
Multi-niche crowding in the development of parallel genetic simulated annealing
In this paper, a new hybrid of genetic algorithm (GA) and simulated annealing (SA), referred to as GSA, is presented. In this algorithm, SA is incorporated into GA to escape from ...
Zhi-Gang Wang, Mustafizur Rahman 0002, Yoke-San Wo...
ISPA
2004
Springer
15 years 11 months ago
Parallel Volume Rendering with Early Ray Termination for Visualizing Large-Scale Datasets
Abstract. This paper presents an efficient parallel algorithm for volume rendering of large-scale datasets. Our algorithm focuses on an optimization technique, namely early ray te...
Manabu Matsui, Fumihiko Ino, Kenichi Hagihara
ICPP
1993
IEEE
15 years 10 months ago
Solving the Region Growing Problem on the Connection Machine
Abstract { This paper presents a parallel algorithm for solving the region growing problem based on the split and merge approach. The algorithm was implemented on the CM-2 and the ...
Nawal Copty, Sanjay Ranka, Geoffrey Fox, Ravi V. S...
JPDC
1998
124views more  JPDC 1998»
15 years 6 months ago
Multilevel k-way Partitioning Scheme for Irregular Graphs
In this paper we present a parallel formulation of a multilevel k-way graph partitioning algorithm. A key feature of this parallel formulation is that it is able to achieve a high ...
George Karypis, Vipin Kumar
DCOSS
2011
Springer
14 years 6 months ago
A local average consensus algorithm for wireless sensor networks
—In many application scenarios sensors need to calculate the average of some local values, e.g. of local measurements. A possible solution is to rely on consensus algorithms. In ...
Konstantin Avrachenkov, Mahmoud El Chamie, Giovann...