1963 search results - page 80 / 393 » The Maximum Solution Problem on Graphs |
SAC
2000
ACM
14 years 1 months ago
2000
ACM
The coding by which chromosomes represent candidate solutions is a fundamental design choice in a genetic algorithm. This paper describes a novel coding of spanning trees in a gen...
RECOMB
2010
Springer
14 years 1 months ago
2010
Springer
Abstract. We consider the problem of aligning two metabolic pathways. Unlike traditional approaches, we do not restrict the alignment to one-to-one mappings between the molecules o...
IEEESCC
2009
IEEE
13 years 6 months ago
2009
IEEE
In this paper we look at combining and compressing a set of workflows, such that computation can be minimized. In this context, we look at two novel theoretical problems with appl...
MP
2010
13 years 3 months ago
2010
In many practical applications, the task is to optimize a non-linear objective function over the vertices of a well-studied polytope as, e.g., the matching polytope or the travelli...
DAM
2000
13 years 8 months ago
2000
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...