Sciweavers

1074 search results - page 68 / 215
» Parallelizing post-placement timing optimization
Sort
View
PPSN
1998
Springer
14 years 1 months ago
Restart Scheduling for Genetic Algorithms
Abstract. In order to escape from local optima, it is standard practice to periodically restart a genetic algorithm according to some restart criteria/policy. This paper addresses ...
Alex S. Fukunaga
DEBS
2009
ACM
14 years 23 days ago
Efficient event-based resource discovery
The ability to find services or resources that satisfy some criteria is an important aspect of distributed systems. This paper presents an event-based architecture to support more...
Wei Yan, Songlin Hu, Vinod Muthusamy, Hans-Arno Ja...
PPSN
2004
Springer
14 years 2 months ago
Optimising the Performance of a Formula One Car Using a Genetic Algorithm
Formula One motor racing is a rich sport that spends millions on research and development of highly optimized cars. Here we describe the use of a genetic algorithm to optimize 66 s...
Krzysztof Wloch, Peter J. Bentley
VLDB
1993
ACM
152views Database» more  VLDB 1993»
14 years 29 days ago
Declustering Objects for Visualization
In this paper we propose a new declustering method which is particularly suitable for image and cartographic databases used for visualization. Our declustering method is based on ...
Ling Tony Chen, Doron Rotem
IPPS
2007
IEEE
14 years 3 months ago
A Grid-enabled Branch and Bound Algorithm for Solving Challenging Combinatorial Optimization Problems
Solving optimally large instances of combinatorial optimization problems requires a huge amount of computational resources. In this paper, we propose an adaptation of the parallel...
Mohand-Said Mezmaz, Nouredine Melab, El-Ghazali Ta...