4908 search results - page 251 / 982 » On the Complexity of Optimal K-Anonymity |
158
click to vote
INFOCOM
1994
IEEE
15 years 10 months ago
1994
IEEE
This paper is motivated by the need to support multiple service classes in fast packet-switched networks. We address the problem of characterizing and designing scheduling policie...
189
click to vote
PPSN
1992
Springer
15 years 10 months ago
1992
Springer
In this paper, we describe the application of a new type of genetic algorithm called the Structured Genetic Algorithm (sGA) for function optimization in nonstationary environments...
179
click to vote
ICLP
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. Reasoning about social networks (labeled, directed, weighted graphs) is becoming increasingly important and there are now models of how certain phenomena (e.g. adoption o...
196
Voted
FCT
2007
Springer
15 years 10 months ago
2007
Springer
We investigate issues regarding two hard problems related to voting, the optimal weighted lobbying problem and the winner problem for Dodgson elections. Regarding the former, Chris...
193
click to vote
CGO
2004
IEEE
15 years 10 months ago
2004
IEEE
Dynamic optimization systems store optimized or translated code in a software-managed code cache in order to maximize reuse of transformed code. Code caches store superblocks that...