Sciweavers

883 search results - page 34 / 177
» A Genetic Algorithm Applied to the Maximum Flow Problem
Sort
View
FSTTCS
2000
Springer
13 years 11 months ago
Coordinatized Kernels and Catalytic Reductions: An Improved FPT Algorithm for Max Leaf Spanning Tree and Other Problems
Abstract. We describe some new, simple and apparently general methods for designing FPT algorithms, and illustrate how these can be used to obtain a signi cantly improved FPT algor...
Michael R. Fellows, Catherine McCartin, Frances A....
DAM
2006
100views more  DAM 2006»
13 years 7 months ago
A combinatorial algorithm for weighted stable sets in bipartite graphs
Abstract. Computing a maximum weighted stable set in a bipartite graph is considered wellsolved and usually approached with preflow-push, Ford-Fulkerson or network simplex algorith...
Ulrich Faigle, Gereon Frahling
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...
IEAAIE
2005
Springer
14 years 1 months ago
A Fuzzy Genetic Algorithm for Real-World Job Shop Scheduling
In this paper, a multi-objective genetic algorithm is proposed to deal with a real-world fuzzy job shop scheduling problem. Fuzzy sets are used to model uncertain due dates and pro...
Carole Fayad, Sanja Petrovic
GECCO
2009
Springer
152views Optimization» more  GECCO 2009»
14 years 5 days ago
A data-based coding of candidate strings in the closest string problem
Given a set of strings S of equal lengths over an alphabet Σ, the closest string problem seeks a string over Σ whose maximum Hamming distance to any of the given strings is as s...
Bryant A. Julstrom