Sciweavers

832 search results - page 65 / 167
» Parallel algorithms for solving aggregated shortest-path pro...
Sort
View
PPSN
2004
Springer
15 years 3 months ago
Phase Transition Properties of Clustered Travelling Salesman Problem Instances Generated with Evolutionary Computation
Abstract. This paper introduces a generator that creates problem instances for the Euclidean symmetric travelling salesman problem. To fit real world problems, we look at maps con...
Jano I. van Hemert, Neil Urquhart
CORR
2006
Springer
91views Education» more  CORR 2006»
14 years 9 months ago
The Complexity of Mean Flow Time Scheduling Problems with Release Times
We study the problem of preemptive scheduling n jobs with given release times on m identical parallel machines. The objective is to minimize the average flow time. We show that wh...
Philippe Baptiste, Peter Brucker, Marek Chrobak, C...
PPSN
1998
Springer
15 years 1 months ago
Comparison of Evolutionary Algorithms for Design Optimization
The production of specimen for microsystems or microcomponents is both, time and material-consuming. In a traditional design process the number of possible variations which can be ...
Wilfried Jakob, Martina Gorges-Schleuter, Ingo Sie...
IPPS
2008
IEEE
15 years 4 months ago
A study of master-slave approaches to parallelize NSGA-II
Many of the optimization problems from the real world are multiobjective in nature, and the reference algorithm for multiobjective optimization is NSGA-II. Frequently, these probl...
Juan José Durillo, Antonio J. Nebro, Franci...
DAC
2010
ACM
14 years 10 months ago
Parallel hierarchical cross entropy optimization for on-chip decap budgeting
Decoupling capacitor (decap) placement has been widely adopted as an effective way to suppress dynamic power supply noise. Traditional decap budgeting algorithms usually explore t...
Xueqian Zhao, Yonghe Guo, Zhuo Feng, Shiyan Hu