1963 search results - page 60 / 393 » The Maximum Solution Problem on Graphs |
EVOW
2009
Springer
14 years 3 months ago
2009
Springer
The Maximum Parsimony problem aims at reconstructing a phylogenetic tree from DNA, RNA or protein sequences while minimizing the number of evolutionary changes. Much work has been ...
AAAI
2008
13 years 11 months ago
2008
Recent research has shown the benefit of framing problems of imitation learning as solutions to Markov Decision Problems. This approach reduces learning to the problem of recoveri...
COCOA
2008
Springer
13 years 10 months ago
2008
Springer
Abstract: Recently, there have been significant theoretical progresses towards fixed-parameter algorithms for the DOMINATING SET problem of planar graphs. It is known that the prob...
AUSAI
2005
Springer
14 years 2 months ago
2005
Springer
In this work, we develop a multi-exchange heuristic based on an estimation improvement graph embedded in a simulated annealing to solve a problem arising in plant location planning...
MFCS
2004
Springer
14 years 2 months ago
2004
Springer
We study the on-line versions of two fundamental graph problems, maximum independent set and minimum coloring, for the case of disk graphs which are graphs resulting from intersect...