71 search results - page 10 / 15 » Kernelizations for Parameterized Counting Problems |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We motivate and analyse a new Tree Search algorithm, based on recent advances in the use of Gaussian Processes for bandit problems. We assume that the function to maximise on the ...
BMCBI
2010
13 years 7 months ago
2010
Background: The construction of interaction networks between proteins is central to understanding the underlying biological processes. However, since many useful relations are exc...
ASPLOS
2012
ACM
12 years 3 months ago
2012
ACM
Dynamic binary translation (DBT) is a powerful technique that enables fine-grained monitoring and manipulation of an existing program binary. At the user level, it has been emplo...
MFCS
2010
Springer
13 years 6 months ago
2010
Springer
The problem of finding a satisfying assignment for a 2-SAT formula that minimizes the number of variables that are set to 1 (min ones 2–sat) is NP-complete. It generalizes the w...
DAC
1999
ACM
13 years 11 months ago
1999
ACM
This paper presents a new algorithm for exact estimation of the minimum memory size required by programs dealing with array computations. Memory size is an important factor a ecti...