Sciweavers

3686 search results - page 672 / 738
» Pattern-Based Parallel Programming
Sort
View
EMO
2006
Springer
219views Optimization» more  EMO 2006»
15 years 1 months ago
ParadisEO-MOEO: A Framework for Evolutionary Multi-objective Optimization
Abstract. This paper presents ParadisEO-MOEO, a white-box objectoriented generic framework dedicated to the flexible design of evolutionary multi-objective algorithms. This paradig...
Arnaud Liefooghe, Matthieu Basseur, Laetitia Jourd...
GECCO
2006
Springer
170views Optimization» more  GECCO 2006»
15 years 1 months ago
Combining simplex with niche-based evolutionary computation for job-shop scheduling
We propose a hybrid algorithm (called ALPINE) between Genetic Algorithm and Dantzig's Simplex method to approximate optimal solutions for the Flexible Job-Shop Problem. Local...
Syhlin Kuah, Joc Cing Tay
CASES
2001
ACM
15 years 1 months ago
Combined partitioning and data padding for scheduling multiple loop nests
With the widening performance gap between processors and main memory, efficient memory accessing behavior is necessary for good program performance. Loop partition is an effective...
Zhong Wang, Edwin Hsing-Mean Sha, Xiaobo Hu
WAN
1998
Springer
15 years 1 months ago
Performance Analysis of Wavefront Algorithms on Very-Large Scale Distributed Systems
We present a model for the parallel performance of algorithms that consist of concurrent, two-dimensional wavefronts implemented in a message passing environment. The model combine...
Adolfy Hoisie, Olaf M. Lubeck, Harvey J. Wasserman
LICS
1997
IEEE
15 years 1 months ago
How Much Memory is Needed to Win Infinite Games?
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...
Stefan Dziembowski, Marcin Jurdzinski, Igor Waluki...