4131 search results - page 152 / 827 » The Generalized Max-Controlled Set Problem |
150
click to vote
KBS
2007
15 years 6 months ago
2007
Many combinatorial problems can be modelled as Constraint Satisfaction Problems (CSPs). Solving a general CSP is known to be NP-complete, so closure and heuristic search are usual...
220
click to vote
EDBT
2011
ACM
14 years 10 months ago
2011
ACM
Data integration systems offer users a uniform interface to a set of data sources. Previous work has typically assumed that the data sources are independent of each other; however...
168
click to vote
FCT
2007
Springer
15 years 10 months ago
2007
Springer
We study the multi-dimensional version of the bin packing problem with conflicts. We are given a set of squares V = {1, 2, . . . , n} with sides s1, s2, . . . , sn [0, 1] and a co...
176
click to vote
CIKM
2010
Springer
15 years 4 months ago
2010
Springer
In this paper, we study a novel problem Collective Active Learning, in which we aim to select a batch set of "informative" instances from a networking data set to query ...
184
click to vote
SIAMJO
2011
15 years 1 months ago
2011
Abstract. The condition number of a Gram matrix defined by a polynomial basis and a set of points is often used to measure the sensitivity of the least squares polynomial approxim...