4908 search results - page 340 / 982 » On the Complexity of Optimal K-Anonymity |
174
Voted
WCE
2007
15 years 8 months ago
2007
—In the design process of complex systems, the designer is solving an optimization problem, which involves different disciplines and where all design criteria have to be optimize...
169
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
147
click to vote
COMCOM
2008
15 years 6 months ago
2008
The primary focus of this paper is the design of efficient algorithm for the calculation of solution to the placement of proxies for performance optimization in hierarchical relia...
201
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
The combination of source coding with decoder side-information (Wyner-Ziv problem) and channel coding with encoder side-information (Gel'fand-Pinsker problem) can be optimall...
188
click to vote
SECON
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract--Due to technology or policy constraints, communications across network domains usually require the intervention of gateways, and their proper deployment is crucial to the...