88 search results - page 3 / 18 » An Overview of Techniques for Designing Parameterized Algori... |
TCS
2010
13 years 4 months ago
2010
Iterative Compression has recently led to a number of breakthroughs in parameterized complexity. Here, we show that the technique can also be useful in the design of exact exponen...
WG
2010
Springer
13 years 4 months ago
2010
Springer
Abstract. We study the Arc-Preserving Subsequence (APS) problem with unlimited annotations. Given two arc-annotated sequences P and T, this problem asks if it is possible to delete...
DAC
2005
ACM
13 years 7 months ago
2005
ACM
Variability of process parameters makes prediction of digital circuit timing characteristics an important and challenging problem in modern chip design. Recently, statistical stat...
TAMC
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Kernelizations are an important tool in designing fixed parameter algorithms for parameterized decision problems. We introduce an analogous notion for counting problems,...
IFIP
2001
Springer
13 years 10 months ago
2001
Springer
: One of the most important problems in SOC platforms design is that of defining strategies for tuning the parameters of a parameterized system so as to obtain the Pareto-optimal s...