Sciweavers

1310 search results - page 46 / 262
» A parallel genetic algorithm to solve the set-covering probl...
Sort
View
NETWORKS
2008
14 years 9 months ago
Reformulation and sampling to solve a stochastic network interdiction problem
The Network Interdiction Problem involves interrupting an adversary's ability to maximize flow through a capacitated network by destroying portions of the network. A budget c...
Udom Janjarassuk, Jeff Linderoth
GECCO
2003
Springer
117views Optimization» more  GECCO 2003»
15 years 3 months ago
Improving Evolvability of Genetic Parallel Programming Using Dynamic Sample Weighting
Abstract. This paper investigates the sample weighting effect on Genetic Parallel Programming (GPP) that evolves parallel programs to solve the training samples captured directly f...
Sin Man Cheang, Kin-Hong Lee, Kwong-Sak Leung
TVLSI
2008
90views more  TVLSI 2008»
14 years 9 months ago
A Special-Purpose Architecture for Solving the Breakpoint Median Problem
Abstract--In this paper, we describe the design for a co-processor for whole-genome phylogenetic reconstruction. Our current design performs a parallelized breakpoint median comput...
Jason D. Bakos, Panormitis E. Elenis
CEC
2009
IEEE
15 years 4 months ago
Optimization of the sizing of a solar thermal electricity plant: Mathematical programming versus genetic algorithms
— Genetic algorithms (GAs) have been argued to constitute a flexible search thereby enabling to solve difficult problems which classical optimization methodologies may find ha...
Jose M. Cabello, Jose M. Cejudo, Mariano Luque, Fr...
ASUNAM
2010
IEEE
14 years 11 months ago
Fast Discovery of Reliable Subnetworks
Abstract--We present a novel and efficient algorithm, PATH COVERING, for solving the most reliable subgraph problem. A reliable subgraph gives a concise summary of the connectivity...
Petteri Hintsanen, Hannu Toivonen, Petteri Sevon