1554 search results - page 20 / 311 » Parameterized Complexity and Approximation Algorithms |
DAC
2007
ACM
15 years 11 months ago
2007
ACM
In this paper we propose a novel parameterized macromodeling technique for analog circuits. Unlike traditional macromodels that are only extracted for a small variation space, our...
IPL
2008
14 years 10 months ago
2008
We describe a new algorithm for the problem of perfect sorting a signed permutation by reversals. The worst-case time complexity of this algorithm is parameterized by the maximum p...
101
click to vote
ACID
2006
14 years 11 months ago
2006
Matroid theory gives us powerful techniques for understanding combinatorial optimization problems and for designing polynomial-time algorithms. However, several natural matroid pr...
102
click to vote
EWRL
2008
14 years 11 months ago
2008
We consider reinforcement learning in the parameterized setup, where the model is known to belong to a parameterized family of Markov Decision Processes (MDPs). We further impose ...
EOR
2008
14 years 10 months ago
2008
Multicut is a fundamental network communication and connectivity problem. It is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimu...