4908 search results - page 89 / 982 » On the Complexity of Optimal K-Anonymity |
139
click to vote
GECCO
2007
Springer
16 years 13 days ago
2007
Springer
In this paper, we analyze two general-purpose encoding types, trees and graphs systematically, focusing on trends over increasingly complex problems. Tree and graph encodings are ...
146
click to vote
GMP
2006
IEEE
16 years 10 days ago
2006
IEEE
Side actions contribute to mold cost by resulting in an additional manufacturing and assembly cost as well as by increasing the molding cycle time. Therefore, generating shapes of ...
171
click to vote
ECP
1997
Springer
15 years 10 months ago
1997
Springer
A possibilistic approach of planning under uncertainty has been developed recently. It applies to problems in which the initial state is partially known and the actions have graded...
175
click to vote
BIBE
2009
IEEE
15 years 9 months ago
2009
IEEE
—The Possibilistic Latent Variable (PLV) clustering algorithm is a powerful tool for the analysis of complex datasets due to its robustness toward data distributions of different...
159
click to vote
ML
2002
ACM
15 years 6 months ago
2002
ACM
Additive clustering was originally developed within cognitive psychology to enable the development of featural models of human mental representation. The representational flexibili...