549 search results - page 22 / 110 » On the Complexity of Restricted k-anonymity Problem |
ATAL
2006
Springer
15 years 1 months ago
2006
Springer
The ability to coordinate effectively is critical for agents to accomplish their goals in a multi-agent system. A number of researchers have modeled the coordination problem for m...
105
click to vote
CSR
2007
Springer
15 years 4 months ago
2007
Springer
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...
LICS
2007
IEEE
15 years 4 months ago
2007
IEEE
We introduce symmetric Datalog, a syntactic restriction of linear Datalog and show that its expressive power is exactly that of restricted symmetric monotone Krom SNP. The deep re...
AUTOMATICA
2002
14 years 9 months ago
2002
This paper considers the problem of designing a controller for an unknown plant based on input/output measurements. The new design method we propose is direct (no model identificat...
MST
2007
14 years 9 months ago
2007
In 1996, Khanna and Motwani [KM96] proposed three logic-based optimization problems constrained by planar structure, and offered the hypothesis that these putatively fundamental ...