Sciweavers

TEC
2010
173views more  TEC 2010»
12 years 11 months ago
Analysis of Computational Time of Simple Estimation of Distribution Algorithms
Estimation of distribution algorithms (EDAs) are widely used in stochastic optimization. Impressive experimental results have been reported in the literature. However, little work ...
Tianshi Chen, Ke Tang, Guoliang Chen, Xin Yao
EWC
2008
117views more  EWC 2008»
13 years 4 months ago
Performance of parallel computations with dynamic processor allocation
In parallel adaptive mesh refinement (AMR) computations the problem size can vary significantly during a simulation. The goal here is to explore the performance implications of dyn...
Saeed Iqbal, Graham F. Carey
IPPS
1998
IEEE
13 years 8 months ago
Performance Range Comparison via Crossing Point Analysis
Parallel programming is elusive. The relative performance of di erent parallel implementations varies with machine architecture, system and problem size. How to compare di erent i...
Xian-He Sun
IAT
2009
IEEE
13 years 8 months ago
Offline Planning for Communication by Exploiting Structured Interactions in Decentralized MDPs
Variants of the decentralized MDP model focus on problems exhibiting some special structure that makes them easier to solve in practice. Our work is concerned with two main issues...
Hala Mostafa, Victor R. Lesser
ICPADS
1998
IEEE
13 years 8 months ago
Symbolic Partitioning and Scheduling of Parameterized Task Graphs
The DAG-based task graph model has been found effective in scheduling for performance prediction and optimization of parallel applications. However the scheduling complexity and s...
Michel Cosnard, Emmanuel Jeannot, Tao Yang