21 search results - page 3 / 5 » Exploiting subproblem optimization in SAT-based MaxSAT algor... |
SOFTWARE
2011
13 years 11 days ago
2011
In the era of multicores, many applications that tend to require substantial compute power and data crunching (aka Throughput Computing Applications) can now be run on desktop PCs...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
Gaussian graphical models are of great interest in statistical learning. Because the conditional independencies between different nodes correspond to zero entries in the inverse c...
JAIR
2007
13 years 5 months ago
2007
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...
ATAL
2006
Springer
13 years 9 months ago
2006
Springer
Deciding what to branch on at each node is a key element of search algorithms. We present four families of methods for selecting what question to branch on. They are all informati...
WEA
2010
Springer
14 years 9 days ago
2010
Springer
Abstract We report on experiments with turning the branch-price-andcut framework SCIP into a generic branch-price-and-cut solver. That is, given a mixed integer program (MIP), our ...