28 search results - page 3 / 6 » On the Minimum Common Integer Partition Problem |
TCS
2010
13 years 6 months ago
2010
We study the following variant of the bin packing problem. We are given a set of items, where each item has a (non-negative) size and a color. We are also given an integer paramet...
CAV
2012
Springer
11 years 10 months ago
2012
Springer
Abstract. A minimum satisfying assignment of a formula is a minimumcost partial assignment of values to the variables in the formula that guarantees the formula is true. Minimum sa...
ICML
2010
IEEE
13 years 9 months ago
2010
IEEE
We propose a novel boosting algorithm which improves on current algorithms for weighted voting classification by striking a better balance between classification accuracy and the ...
ISSS
1997
IEEE
14 years 1 days ago
1997
IEEE
Integer Linear Programming ILP is commonly used in high level and system level synthesis. It is an NP-Complete problem in general cases . There exists some tools that give an o...
WAOA
2005
Springer
14 years 1 months ago
2005
Springer
An instance of the classical Stable Roommates problem (sr) need not admit a stable matching. This motivates the problem of finding a matching that is “as stable as possible”, ...