34 search results - page 3 / 7 » New Upper Bound Heuristics for Treewidth |
EVOW
2007
Springer
14 years 12 days ago
2007
Springer
We present a Lagrangian decomposition approach for the Knapsack Constrained Maximum Spanning Tree problem yielding upper bounds as well as heuristic solutions. This method is furth...
BMCBI
2007
13 years 6 months ago
2007
Background: Multiple sequence alignment is fundamental. Exponential growth in computation time appears to be inevitable when an optimal alignment is required for many sequences. E...
DAM
2008
13 years 6 months ago
2008
ct The average case analysis of algorithms usually assumes independent, identical distributions for the inputs. In [?], Kenyon introduced the random-order ratio, a new average case...
CCCG
2007
13 years 7 months ago
2007
We present a heuristic algorithm to compute approximate geodesic distances on a triangular manifold S containing n vertices with partially missing data. The proposed method comput...
AIPS
2006
13 years 7 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 ...