549 search results - page 25 / 110 » On the Complexity of Restricted k-anonymity Problem |
SODA
2001
ACM
14 years 11 months ago
2001
ACM
We explore the natural question of whether all NP-complete problems have a common restriction under which they are polynomially solvable. More precisely, we study what languages a...
ICMLA
2004
14 years 11 months ago
2004
In some environments, a learning agent must learn to balance competing objectives. For example, a Q-learner agent may need to learn which choices expose the agent to risk and whic...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Deciding whether a graph can be embedded in a grid using only unitlength edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a numbe...
STACS
2001
Springer
15 years 2 months ago
2001
Springer
We consider the problem of computing an optimal range assignment in a wireless network which allows a specified source station to perform a broadcast operation. In particular, we ...
102
click to vote
CIE
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...