549 search results - page 7 / 110 » On the Complexity of Restricted k-anonymity Problem |
TCS
2008
14 years 9 months ago
2008
We investigate the complexity of finding Nash equilibria in which the strategy of each player is uniform on its support set. We show that, even for a restricted class of win-lose ...
JAPLL
2010
14 years 4 months ago
2010
The satisfiability problem of hybrid logics with the downarrow binder is known to be undecidable. This initiated a research program on decidable and tractable fragments. In this p...
AIPS
2008
15 years 2 days ago
2008
The causal graph is a directed graph that describes the variable dependencies present in a planning instance. A number of papers have studied the causal graph in both practical an...
ESANN
2006
14 years 11 months ago
2006
A probabilistic, ``neural'' approach to sensor modelling and classification is described, performing local data fusion in a wireless system for embedded sensors using a ...
WAOA
2005
Springer
15 years 3 months ago
2005
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set...