4131 search results - page 42 / 827 » The Generalized Max-Controlled Set Problem |
CORR
2006
Springer
15 years 2 months ago
2006
Springer
We consider semi-supervised classification when part of the available data is unlabeled. These unlabeled data can be useful for the classification problem when we make an assumpti...
115
click to vote
IJCAI
2003
15 years 3 months ago
2003
We examine the approach of encoding planning problems as CSPs more closely. First we present a simple CSP encoding for planning problems and then a set of transformations that can...
SAC
2006
ACM
15 years 8 months ago
2006
ACM
Non-linear AE-solution sets are a special case of parametric systems of equations where universally quantified parameters appear first. They allow to model many practical situat...
111
click to vote
MST
2006
15 years 1 months ago
2006
We prove that the exact versions of the domatic number problem are complete for the levels of the boolean hierarchy over NP. The domatic number problem, which arises in the area of...
146
click to vote
ANTS
2006
Springer
15 years 5 months ago
2006
Springer
The discrete logarithm problem (DLP) generalizes to the constrained DLP, where the secret exponent x belongs to a set known to the attacker. The complexity of generic algorithms f...