895 search results - page 79 / 179 » An Indirect Genetic Algorithm for Set Covering Problems |
119
click to vote
ENTCS
2007
14 years 11 months ago
2007
Abstract. Model-based testing has been proposed as a technique to automatically verify that a system conforms to its specification. A popular approach is to use a model-checker to...
77
Voted
ICALP
2005
Springer
15 years 4 months ago
2005
Springer
We define an algorithmic paradigm, the stack model, that captures many primal-dual and local-ratio algorithms for approximating covering and packing problems. The stack model is ...
114
click to vote
BMCBI
2007
14 years 11 months ago
2007
Background: Much recent work in bioinformatics has focused on the inference of various types of biological networks, representing gene regulation, metabolic processes, protein-pro...
120
click to vote
ESA
2003
Springer
15 years 4 months ago
2003
Springer
We prove that various geometric covering problems, related to the Travelling Salesman Problem cannot be efficiently approximated to within any constant factor unless P = NP. This ...
116
Voted
GECCO
2005
Springer
15 years 4 months ago
2005
Springer
This paper describes the development of an evolutionary algorithm called Multipopulation Cooperative Coevolutionary Programming (MCCP) that extends Genetic Programming (GP) to sea...