Neighborhood Preserving Codes for Assigning Point Labels: Applications to Stochastic Search
暂无分享,去创建一个
[1] Uday Kumar Chakraborty,et al. An analysis of Gray versus binary encoding in genetic search , 2003, Inf. Sci..
[2] L. Darrell Whitley,et al. Properties of Gray and Binary Representations , 2004, Evolutionary Computation.
[3] Rajeev Motwani,et al. The PageRank Citation Ranking : Bringing Order to the Web , 1999, WWW 1999.
[4] L. Darrell Whitley,et al. Transforming the search space with Gray coding , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.
[5] J. David Schaffer,et al. Representation and Hidden Bias: Gray vs. Binary Coding for Genetic Algorithms , 1988, ML.
[6] Colin R. Reeves,et al. Genetic Algorithms and Neighbourhood Search , 1994, Evolutionary Computing, AISB Workshop.
[7] Martin Wattenberg,et al. Stochastic Hillclimbing as a Baseline Mathod for Evaluating Genetic Algorithms , 1995, NIPS.
[8] Sanjay Ghemawat,et al. MapReduce: Simplified Data Processing on Large Clusters , 2004, OSDI.
[9] Zoubin Ghahramani,et al. Learning from labeled and unlabeled data with label propagation , 2002 .
[10] Shigenobu Kobayashi,et al. Hybridization of genetic algorithm and local search in multiobjective function optimization: recommendation of GA then LS , 2006, GECCO '06.
[11] Kenneth Alan De Jong,et al. An analysis of the behavior of a class of genetic adaptive systems. , 1975 .
[12] Helena Ramalhinho Dias Lourenço,et al. Iterated Local Search , 2001, Handbook of Metaheuristics.
[13] Shankar Kumar,et al. Video suggestion and discovery for youtube: taking random walks through the view graph , 2008, WWW.
[14] J. Munkres. ALGORITHMS FOR THE ASSIGNMENT AND TRANSIORTATION tROBLEMS* , 1957 .
[15] H. Kuhn. The Hungarian method for the assignment problem , 1955 .
[16] Carla Savage,et al. A Survey of Combinatorial Gray Codes , 1997, SIAM Rev..