Sciweavers

883 search results - page 26 / 177
» A Genetic Algorithm Applied to the Maximum Flow Problem
Sort
View
JSS
2008
122views more  JSS 2008»
13 years 6 months ago
Traffic-aware stress testing of distributed real-time systems based on UML models using genetic algorithms
This report presents a model-driven, stress test methodology aimed at increasing chances of discovering faults related to network traffic in Distributed Real-Time Systems (DRTS). T...
Vahid Garousi, Lionel C. Briand, Yvan Labiche
GECCO
2000
Springer
170views Optimization» more  GECCO 2000»
13 years 11 months ago
A Comparison of Genetic Algorithms for the Dynamic Job Shop Scheduling Problem
The majority of the research using evolutionary algorithms for the Job Shop Scheduling Problem (JSSP) has studied only the static JSSP. Few evolutionary algorithms have been appli...
Manuel Vázquez, L. Darrell Whitley
ICNC
2005
Springer
14 years 1 months ago
Local Search for the Maximum Parsimony Problem
Abstract. Four local search algorithms are investigated for the phylogenetic tree reconstruction problem under the Maximum Parsimony criterion. A new subtree swapping neighborhood ...
Adrien Goëffon, Jean-Michel Richer, Jin-Kao H...
FOCS
1997
IEEE
13 years 11 months ago
Beyond the Flow Decomposition Barrier
We introduce a new approach to the maximum flow problem. This approach is based on assigning arc lengths based on the residual flow value and the residual arc capacities. Our appro...
Andrew V. Goldberg, Satish Rao
JUCS
2006
101views more  JUCS 2006»
13 years 7 months ago
DS/CDMA Multiuser Detection with Evolutionary Algorithms
This work analyses two heuristic algorithms based on the genetic evolution theory applied to direct sequence code division multiple access (DS/CDMA) communication systems. For diff...
Fernando Ciriaco, Taufik Abrão, Paul Jean E...