Sciweavers

6437 search results - page 16 / 1288
» Parallel Algorithms for Arrangements
Sort
View
SGP
2007
15 years 2 months ago
Shape reconstruction from unorganized cross-sections
In this paper, we consider the problem of reconstructing a shape from unorganized cross-sections. The main motivation for this problem comes from medical imaging applications wher...
Jean-Daniel Boissonnat, Pooran Memari
96
Voted
IPPS
2009
IEEE
15 years 7 months ago
Adaptative clustering Particle Swarm Optimization
—The performance of Particle Swarm Optimization (PSO) algorithms depends strongly upon the interaction among the particles. The existing communication topologies for PSO (e.g. st...
Salomão S. Madeiro, Carmelo J. A. Bastos Fi...
111
Voted
ACMACE
2009
ACM
15 years 4 months ago
Music box: composing and performing visual music
Music Box is an artistic implementation of emergent behavior and its use to create music. Music Box employs Craig Reynold's flocking algorithm to display animated notes that ...
Lindsay Grace
CLUSTER
2008
IEEE
15 years 7 months ago
Gather-arrange-scatter: Node-level request reordering for parallel file systems on multi-core clusters
—Multiple processors or multi-core CPUs are now in common, and the number of processes running concurrently is increasing in a cluster. Each process issues contiguous I/O request...
Kazuki Ohta, Hiroya Matsuba, Yutaka Ishikawa
93
Voted
MICAI
2005
Springer
15 years 6 months ago
A Comparison of Memetic Recombination Operators for the MinLA Problem
In this paper the Minimum Linear Arrangement (MinLA) problem is studied within the framework of memetic algorithms (MA). A new dedicated recombination operator called Trajectory Cr...
Eduardo Rodriguez-Tello, Jin-Kao Hao, Jose Torres-...