4908 search results - page 177 / 982 » On the Complexity of Optimal K-Anonymity |
159
click to vote
ICC
2007
IEEE
16 years 25 days ago
2007
IEEE
— In this paper, we extend the optimal worst-case QoS routing algorithm and metric definition given in [1]. We prove that in addition to the q-ary symmetric and q-ary erasure ch...
153
click to vote
CP
2007
Springer
16 years 20 days ago
2007
Springer
Defence trees and CP-net (ceteris paribus network) are two useful approaches that can be used to help a system administrator to analyze a security scenario and to give him a model ...
161
click to vote
ICCS
2007
Springer
16 years 20 days ago
2007
Springer
Abstract. This paper reviews recent developments in our project that are focused on dynamic data-driven methods for efficient and reliable simulation based optimization, which may...
200
click to vote
ICICIC
2006
IEEE
16 years 16 days ago
2006
IEEE
Multiple travelling salesman problem (MTSP) is a typical computationally complex combinatorial optimization problem,which is an extension of the famous travelling salesman problem...
167
click to vote
ICTAI
2006
IEEE
16 years 16 days ago
2006
IEEE
A new method for optimizing complex functions and systems is described that employs Learnable Evolution Model (LEM), a form of non-Darwinian evolutionary computation guided by mac...