4908 search results - page 143 / 982 » On the Complexity of Optimal K-Anonymity |
171
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Internet search companies sell advertisement slots based on users' search queries via an auction. While there has been previous work on the auction process and its game-theor...
174
click to vote
DAC
2008
ACM
16 years 7 months ago
2008
ACM
In this paper, a novel automatic approach for the concurrent topology and routing optimization that achieves a high quality network layout is proposed. This optimization is based ...
154
click to vote
EMO
2006
Springer
15 years 10 months ago
2006
Springer
This paper presents results of extensive computational experiments in which evolutionary multiobjective algorithms were used to find Pareto-optimal solutions to a complex structura...
151
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
Optimum implementation of non-conventional wells allows us to increase considerably hydrocarbon recovery. By considering the high drilling cost and the potential improvement in we...
170
click to vote
CPAIOR
2007
Springer
16 years 19 days ago
2007
Springer
We study the complexity of combinatorial problems that consist of competing infeasibility and optimization components. In particular, we investigate the complexity of the connectio...