7129 search results - page 32 / 1426 » Approximation Algorithms for Treewidth |
SIAMCO
2002
14 years 9 months ago
2002
As shown in [7], optimal control problems with either ODE or PDE dynamics can be solved efficiently using a setting of consistent approximations obtained by numerical discretizati...
RECOMB
2003
Springer
15 years 10 months ago
2003
Springer
Genetic linkage analysis is a challenging application which requires Bayesian networks consisting of thousands of vertices. Consequently, computing the likelihood of data, which i...
CIE
2007
Springer
15 years 3 months ago
2007
Springer
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
AIPS
2006
14 years 11 months ago
2006
We present a new algorithm for conformant probabilistic planning, which for a given horizon produces a plan that maximizes the probability of success under quantified uncertainty ...
WDAG
2009
Springer
15 years 4 months ago
2009
Springer
We present a distributed 2-approximation algorithm for the minimum vertex cover problem. The algorithm is deterministic, and it runs in (∆ + 1)2 synchronous communication rounds,...