Sciweavers

132 search results - page 10 / 27
» Genetic Algorithm based technique for solving Chance Constra...
Sort
View
COMCOM
2007
123views more  COMCOM 2007»
13 years 7 months ago
Heuristic and optimal techniques for light-trail assignment in optical ring WDM networks
In this paper we address the problem of constrained optimization (ILP formulation) and propose a set of heuristic algorithms for assigning light-trails [1–4,7,10] to WDM ring ne...
Ashwin Gumaste, Paparao Palacharla
TCBB
2008
107views more  TCBB 2008»
13 years 7 months ago
Progressive Tree Neighborhood Applied to the Maximum Parsimony Problem
Abstract-- The Maximum Parsimony problem aims at reconstructing a phylogenetic tree from DNA sequences while minimizing the number of genetic transformations. To solve this NP-comp...
Adrien Goëffon, Jean-Michel Richer, Jin-Kao H...
GECCO
2006
Springer
192views Optimization» more  GECCO 2006»
13 years 11 months ago
Optimising cancer chemotherapy using an estimation of distribution algorithm and genetic algorithms
This paper presents a methodology for using heuristic search methods to optimise cancer chemotherapy. Specifically, two evolutionary algorithms - Population Based Incremental Lear...
Andrei Petrovski, Siddhartha Shakya, John A. W. Mc...
ASPDAC
1999
ACM
77views Hardware» more  ASPDAC 1999»
13 years 11 months ago
Timing-Driven Bipartitioning with Replication Using Iterative Quadratic Programming
We present an algorithm for solving a general min-cut, twoway partitioning problem subject to timing constraints. The problem is formulated as a constrained programming problem an...
Shihliang Ou, Massoud Pedram
MICAI
2004
Springer
14 years 22 days ago
Simple Feasibility Rules and Differential Evolution for Constrained Optimization
In this paper, we propose a differential evolution algorithm to solve constrained optimization problems. Our approach uses three simple selection criteria based on feasibility to g...
Efrén Mezura-Montes, Carlos A. Coello Coell...