261 search results - page 41 / 53 » On Threshold BDDs and the Optimal Variable Ordering Problem |
MCS
2002
Springer
13 years 7 months ago
2002
Springer
In classifier combining, one tries to fuse the information that is given by a set of base classifiers. In such a process, one of the difficulties is how to deal with the variabilit...
SIGECOM
2009
ACM
14 years 2 months ago
2009
ACM
We study the problem of how to allocate m identical items among n > m agents, assuming each agent desires exactly one item and has a private value for consuming the item. We as...
CVPR
2010
IEEE
13 years 10 months ago
2010
IEEE
Abstract. This work addresses a class of total-variation based multilabeling problems over a spatially continuous image domain, where the data fidelity term can be any bounded fun...
CP
1995
Springer
13 years 11 months ago
1995
Springer
We present a new heuristic approach for maximal constraint satisfaction of overconstrained problems (MAX-CSP). This approach is based on a formulation of CSP as an optimization pro...
CSR
2007
Springer
14 years 1 months ago
2007
Springer
Consider a family of sets and a single set, called query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Strict time cons...