1322 search results - page 45 / 265 » Parameterized counting problems |
MST
2007
13 years 8 months ago
2007
Important variants of the Vertex Cover problem (among others, Connected Vertex Cover, Capacitated Vertex Cover, and Maximum Partial Vertex Cover) have been intensively studied in ...
DAGSTUHL
2007
13 years 10 months ago
2007
One of the standard basic steps in drawing hierarchical graphs is to invert some arcs of the given graph to make the graph acyclic. We discuss exact and parameterized algorithms fo...
COLT
1993
Springer
14 years 27 days ago
1993
Springer
We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using param...
MIG
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. Motion blending is a popular motion synthesis technique which interpolates similar motion examples according to blending weighs parameterizing high-level characteristics ...
GECCO
2005
Springer
14 years 2 months ago
2005
Springer
Any computational approach to design, including the use of evolutionary algorithms, requires the transformation of the domain-specific knowledge into a formal design representatio...