4908 search results - page 693 / 982 » On the Complexity of Optimal K-Anonymity |
184
click to vote
ICALP
2005
Springer
16 years 7 days ago
2005
Springer
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...
217
click to vote
SAB
2004
Springer
16 years 2 days ago
2004
Springer
While techniques exist for simulating swarming behaviors, these methods usually provide only simplistic navigation and planning capabilities. In this review, we explore the benefi...
181
click to vote
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
Encouraging exploration, typically by preserving the diversity within the population, is one of the most common method to improve the behavior of evolutionary algorithms with dece...
165
click to vote
DATE
1999
IEEE
15 years 11 months ago
1999
IEEE
Software programming languages, such as C/C++, have been used as means for specifying hardware for quite a while. Different design methodologies have exploited the advantages of f...
202
click to vote
DATE
1998
IEEE
15 years 11 months ago
1998
IEEE
As the "system-on-a-chip" concept is rapidly becoming a reality, time-to-market and product complexity push the reuse of complex macromodules. Circuits combining a varie...