9842 search results - page 169 / 1969 » Problem complexity |
174
click to vote
ORL
2008
15 years 6 months ago
2008
We define a generalized variant of the satisfiability problem (SAT) where each "clause" is an or-list of inequalities in n variables. The inequality satisfiability probl...
181
click to vote
COLT
2010
Springer
15 years 4 months ago
2010
Springer
We define a new model of quantum learning that we call Predictive Quantum (PQ). This is a quantum analogue of PAC, where during the testing phase the student is only required to a...
138
click to vote
ICST
2008
IEEE
16 years 19 days ago
2008
IEEE
This paper introduces a new method for generating test data that combines the benefits of equivalence partitioning, boundary value analysis and cause-effect analysis. It is suitab...
179
click to vote
SIAMJO
2008
15 years 6 months ago
2008
Given A := {a1, . . . , am} Rn and > 0, we propose and analyze two algorithms for the problem of computing a (1 + )-approximation to the radius of the minimum enclosing ball o...
162
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
Randomness extraction is the process of constructing a source of randomness of high quality from one or several sources of randomness of lower quality. The problem can be modeled ...