Sciweavers

1550 search results - page 184 / 310
» Benchmarking for Graph Transformation
Sort
View
103
Voted
GECCO
2005
Springer
219views Optimization» more  GECCO 2005»
15 years 6 months ago
An evolutionary lagrangian method for the 0/1 multiple knapsack problem
We propose a new evolutionary approach to solve the 0/1 multiple knapsack problem. We approach the problem from a new viewpoint different from traditional methods. The most remar...
Yourim Yoon, Yong-Hyuk Kim, Byung Ro Moon
ICANN
2005
Springer
15 years 6 months ago
LS-SVM Hyperparameter Selection with a Nonparametric Noise Estimator
This paper presents a new method for the selection of the two hyperparameters of Least Squares Support Vector Machine (LS-SVM) approximators with Gaussian Kernels. The two hyperpar...
Amaury Lendasse, Yongnan Ji, Nima Reyhani, Michel ...
PPSN
2004
Springer
15 years 6 months ago
Learning Probabilistic Tree Grammars for Genetic Programming
Genetic Programming (GP) provides evolutionary methods for problems with tree representations. A recent development in Genetic Algorithms (GAs) has led to principled algorithms cal...
Peter A. N. Bosman, Edwin D. de Jong
PPSN
2004
Springer
15 years 6 months ago
Optimization via Parameter Mapping with Genetic Programming
Abstract. This paper describes a new approach for parameter optimization that uses a novel representation for the parameters to be optimized. By using genetic programming, the new ...
João Carlos Figueira Pujol, Riccardo Poli
90
Voted
DATE
2000
IEEE
85views Hardware» more  DATE 2000»
15 years 5 months ago
Meeting Delay Constraints in DSM by Minimal Repeater Insertion
We address the problem of inserting repeaters, selected from a library, at feasible locations in a placed and routed network to meet user-specified delay constraints. We use mini...
I-Min Liu, Adnan Aziz, D. F. Wong