1554 search results - page 8 / 311 » Parameterized Complexity and Approximation Algorithms |
140
click to vote
FORTE
2009
15 years 2 months ago
2009
Abstract. We propose a verification method for parameterized systems with global conditions. The method is based on context-sensitive constraints, a symbolic representation of infi...
138
click to vote
RSCTC
2000
Springer
15 years 8 months ago
2000
Springer
The optimization of rough set based classification models with respect to parameterized balance between a model's complexity and confidence is discussed. For this purpose, the...
161
click to vote
GECCO
2008
Springer
15 years 5 months ago
2008
Springer
Pair approximations have often been used to predict equilibrium conditions in spatially-explicit epidemiological and ecological systems. In this work, we investigate whether this ...
141
click to vote
WG
2010
Springer
15 years 2 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...
117
Voted
COCO
2006
Springer
15 years 8 months ago
2006
Springer
We establish a close connection between (sub)exponential time complexity and parameterized complexity by proving that the so-called miniaturization mapping is a reduction preservi...