76 search results - page 9 / 16 » Counting Solutions of Knapsack Constraints |
66
Voted
DATE
2008
IEEE
15 years 4 months ago
2008
IEEE
Abstract—Embedded system secondary storage size is often constrained, yet storage demands are growing as a result of increasing application complexity and storage of personal dat...
ESA
2006
Springer
15 years 1 months ago
2006
Springer
The class Max (r, 2)-CSP consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m binary clauses, we presen...
EUC
2004
Springer
15 years 1 months ago
2004
Springer
In archiectural synthesis, scheduling and resource allocation are important steps. During the early stage of the design, imprecise information is unavoidable. Under the imprecise ...
ICDT
2001
ACM
15 years 2 months ago
2001
ACM
In fast OLAP applications it is often advantageous to provide approximate answers to range queries in order to achieve very high performances. A possible solution is to inquire sum...
80
Voted
ATMOS
2007
14 years 11 months ago
2007
We face a real-world train unit assignment problem for an operator running trains in a regional area. Given a set of timetabled train trips, each with a required number of passenge...