790 search results - page 65 / 158 » Subexponential Parameterized Algorithms |
158
click to vote
DATE
2007
IEEE
16 years 14 days ago
2007
IEEE
In this paper we introduce a new algorithm for model order reduction in the presence of parameter or process variation. Our analysis is performed using a graph interpretation of t...
143
click to vote
IWPEC
2009
Springer
16 years 20 days ago
2009
Springer
In the p-Set Splitting problem we are given a universe U, a family F of subsets of U and a positive integer k and the objective is to find a partition of U into W and B such that...
170
click to vote
IWPEC
2009
Springer
16 years 20 days ago
2009
Springer
Given an undirected graph with n nodes, the Maximum Leaf Spanning Tree problem is to find a spanning tree with as many leaves as possible. When parameterized in the number of leav...
147
click to vote
WG
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. In the context of protein engineering, we consider the problem of computing an mRNA sequence of maximal codon-wise similarity to a given mRNA (and consequently, to a give...
170
click to vote
CP
2006
Springer
15 years 9 months ago
2006
Springer
The paper presents a method for generating solutions of a constraint satisfaction problem (CSP) uniformly at random. The main idea is to express the CSP as a factored probability d...