Sciweavers

895 search results - page 16 / 179
» An Indirect Genetic Algorithm for Set Covering Problems
Sort
View
ESA
2004
Springer
120views Algorithms» more  ESA 2004»
14 years 23 days ago
Solving Geometric Covering Problems by Data Reduction
We consider a scenario where stops are to be placed along an already existing public transportation network in order to improve its attractiveness for the customers. The core probl...
Steffen Mecke, Dorothea Wagner
DATE
2000
IEEE
92views Hardware» more  DATE 2000»
13 years 11 months ago
An Efficient Heuristic Approach to Solve the Unate Covering Problem
The classical solving approach for two-level logic minimisation reduces the problem to a special case of unate covering and attacks the latter with a (possibly limited) branch-and...
Roberto Cordone, Fabrizio Ferrandi, Donatella Sciu...
GECCO
2005
Springer
158views Optimization» more  GECCO 2005»
14 years 27 days ago
A genetic algorithm approach to the selection of near-optimal subsets from large sets
The problem attempted in this paper is to select a sample from a large set where the sample is required to have a particular average property. The problem can be expressed as an o...
P. Whiting, P. W. Poon, J. N. Carter
TCBB
2011
13 years 2 months ago
A Partial Set Covering Model for Protein Mixture Identification Using Mass Spectrometry Data
—Protein identification is a key and essential step in mass spectrometry (MS) based proteome research. To date, there are many protein identification strategies that employ eithe...
Zengyou He, Can Yang, Weichuan Yu
ESA
2001
Springer
132views Algorithms» more  ESA 2001»
13 years 12 months ago
Greedy Algorithms for Minimisation Problems in Random Regular Graphs
In this paper we introduce a general strategy for approximating the solution to minimisation problems in random regular graphs. We describe how the approach can be applied to the m...
Michele Zito