100 search results - page 10 / 20 » Combination of Lower Bounds in Exact BDD Minimization |
119
click to vote
COMPGEOM
1992
ACM
15 years 1 months ago
1992
ACM
Suppose we are given a sequence of n points in the Euclidean plane, and our objective is to construct, on-line, a connected graph that connects all of them, trying to minimize the...
JGO
2010
14 years 4 months ago
2010
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
RECOMB
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Side-chain prediction is an important subproblem of the general protein folding problem. Despite much progress in side-chain prediction, performance is far from satisfact...
SAS
2009
Springer
15 years 10 months ago
2009
Springer
The Java programming language requires that out-of-bounds array accesses produce runtime exceptions. In general, this requires a dynamic bounds check each time an array element is...
NETWORKS
2008
14 years 9 months ago
2008
The resource-constrained elementary shortest path problem arises as a pricing subproblem in branch-and-price algorithms for vehicle routing problems with additional constraints. W...