A genetic algorithm for privacy preserving combinatorial optimization
暂无分享,去创建一个
[1] Brian W. Kernighan,et al. An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..
[2] Andrew Chi-Chih Yao,et al. Protocols for secure computations , 1982, FOCS 1982.
[3] David E. Goldberg,et al. Genetic Algorithms in Search Optimization and Machine Learning , 1988 .
[4] D. E. Goldberg,et al. Genetic Algorithm in Search , 1989 .
[5] Dirk Thierens,et al. Elitist recombination: an integrated selection recombination GA , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.
[6] Shigenobu Kobayashi,et al. Edge Assembly Crossover: A High-Power Genetic Algorithm for the Travelling Salesman Problem , 1997, ICGA.
[7] E. L. Nichols,et al. Introduction to Supply Chain Management , 1998 .
[8] Pascal Paillier,et al. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes , 1999, EUROCRYPT.
[9] Goldberg,et al. Genetic algorithms , 1993, Robust Control Systems with Genetic Algorithms.
[10] Shigenobu Kobayashi,et al. Deterministic Multi-step Crossover Fusion: A Handy Crossover Composition for GAs , 2002, PPSN.
[11] Makoto Yokoo,et al. Secure Generalized Vickrey Auction Using Homomorphic Encryption , 2003, Financial Cryptography.
[12] Marius-Calin Silaghi,et al. Distributed constraint satisfaction and optimization with privacy enforcement , 2004 .
[13] Oded Goldreich,et al. Foundations of Cryptography: Volume 2, Basic Applications , 2004 .
[14] Bart Goethals,et al. On Private Scalar Product Computation for Privacy-Preserving Data Mining , 2004, ICISC.
[15] Riccardo Pucella. Review of Foundations of Cryptography II : Basic Applications ∗ , 2005 .