790 search results - page 52 / 158 » Subexponential Parameterized Algorithms |
139
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
This paper presents a mutation-based evolutionary algorithm that evolves genotypic genes for regulating developmental timing of phenotypic values. The genotype sequentially genera...
215
click to vote
ICALP
2005
Springer
15 years 11 months ago
2005
Springer
Given a graph G = (V, E) and positive integral vertex weights w : V → N, the max-coloring problem seeks to find a proper vertex coloring of G whose color classes C1, C2, . . . ,...
227
click to vote
ICALP
2011
Springer
14 years 9 months ago
2011
Springer
We give new algorithms for a variety of randomly-generated instances of computational problems using a linearization technique that reduces to solving a system of linear equations...
129
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
Abstract. A parametric weighted graph is a graph whose edges are labeled with continuous real functions of a single common variable. For any instantiation of the variable, one obta...
179
click to vote
COLT
2006
Springer
15 years 10 months ago
2006
Springer
We describe a new approach for understanding the difficulty of designing efficient learning algorithms. We prove that the existence of an efficient learning algorithm for a circui...