Sciweavers

12825 search results - page 217 / 2565
» Improved PLSOM algorithm
Sort
View
JCIT
2010
150views more  JCIT 2010»
15 years 1 months ago
Characteristic Description of Coupled Task Sets Based on Design Structure Matrix and Its Optimal Time and Efforts Solution by Ge
The complicated interactions among tasks lead to iterations in product design and development. To maintain the market share, enterprises should effectively manage their product de...
Ting-gui Chen, Chun-hua Ju
WEA
2010
Springer
476views Algorithms» more  WEA 2010»
16 years 1 months ago
Fast FPT Algorithms for Computing Rooted Agreement Forests: Theory and Experiments
We improve on earlier FPT algorithms for computing a rooted maximum agreement forest (MAF) or a maximum acyclic agreement forest (MAAF) of a pair of phylogenetic trees. Their sizes...
Chris Whidden, Robert G. Beiko, Norbert Zeh
GECCO
2003
Springer
116views Optimization» more  GECCO 2003»
15 years 11 months ago
A Hybrid Genetic Algorithm Based on Complete Graph Representation for the Sequential Ordering Problem
Abstract. A hybrid genetic algorithm is proposed for the sequential ordering problem. It is known that the performance of a genetic algorithm depends on the survival environment an...
Dong-il Seo, Byung Ro Moon
EUROCAST
2009
Springer
179views Hardware» more  EUROCAST 2009»
16 years 27 days ago
New Approximation-Based Local Search Algorithms for the Probabilistic Traveling Salesman Problem
In this paper we present new local search algorithms for the Probabilistic Traveling Salesman Problem (PTSP) using sampling and ad-hoc approximation. These algorithms improve both...
Dennis Weyland, Leonora Bianchi, Luca Maria Gambar...
ICIC
2007
Springer
16 years 14 days ago
On the Convergence Properties of Quantum-Inspired Multi-Objective Evolutionary Algorithms
Abstract. In this paper, a general framework of quantum-inspired multiobjective evolutionary algorithms is proposed based on the basic principles of quantum computing and general s...
Zhiyong Li, Zhe Li, Günter Rudolph