549 search results - page 100 / 110 » On the Complexity of Restricted k-anonymity Problem |
ESM
1998
14 years 11 months ago
1998
This paper aims to and illustrate that simulation and queuing theory can and should go hand in hand for a variety of practical problems, both in daily-life and industry, which are...
SIGECOM
2010
ACM
14 years 10 months ago
2010
ACM
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
DEDS
2002
14 years 9 months ago
2002
Abstract. Detection and isolation of failures in large and complex systems such as telecommunication networks are crucial and challenging tasks. The problem considered here is that...
PODS
2006
ACM
15 years 10 months ago
2006
ACM
We study the randomized version of a computation model (introduced in [9, 10]) that restricts random access to external memory and internal memory space. Essentially, this model c...
ICDCS
1999
IEEE
15 years 2 months ago
1999
IEEE
To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given Quality-of...