3250 search results - page 7 / 650 » Parameterized Learning Complexity |
FAW
2008
Springer
13 years 11 months ago
2008
Springer
We study the parameterized complexity of an NP-complete geometric covering problem called d-dimensional Rectangle Stabbing where we are given a set of axis-parallel d-dimensional h...
CIAC
2010
Springer
13 years 6 months ago
2010
Springer
We study the parameterized complexity of the problems of determining whether a graph contains a k-edge subgraph (k-vertex induced subgraph) that is a -graph for -graphs being one ...
AAAI
2012
12 years 6 days ago
2012
The early classifications of the computational complexity of planning under various restrictions in STRIPS (Bylander) and SAS+ (B¨ackstr¨om and Nebel) have influenced followin...
AAAI
2008
14 years 4 days ago
2008
We argue that parameterized complexity is a useful tool with which to study global constraints. In particular, we show that many global constraints which are intractable to propag...
COCOON
2000
Springer
14 years 2 months ago
2000
Springer
We consider the parameterized complexity of the following problem under the framework introduced by Downey and Fellows[4]: Given a graph G, an integer parameter k and a non-trivial...