최소 단어 이상 선택하여야 합니다.
최대 10 단어까지만 선택 가능합니다.
다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
NTIS 바로가기정보과학회논문지. Journal of KIISE. 소프트웨어 및 응용, v.32 no.10, 2005년, pp.974 - 983
권영근 (서울대학교 컴퓨터공학부) , 김용혁 (서울대학교 컴퓨터공학부) , 문병로 (서울대학교 컴퓨터공학부)
In genetic algorithms with lotus-based encoding, static gene reordering is to locate the highly related genes closely together. It helps the genetic algorithms to create and preserve the schema of high-quality effectively. In this paper, we propose a static reordering framework for linear locus-base...
* AI 자동 식별 결과로 적합하지 않은 문장이 있을 수 있으니, 이용에 유의하시기 바랍니다.
J. Bagley. The Behavior of Adaptive Systems Which Employ Genetic and Correlation Algorithms. PhD thesis, University of Michigan, Ann Arbor, MI, 1967
G. R. Harik and D. E. Goldberg. Learning linkage. In Foundations of Genetic Algorithms 4, pages 247-262, 1996
D. Goldberg, B. Korb, and K. Deb. Messy genetic algorithms: Motivation, analysis, and rst results. Complex System, Vol. 3, pages 493-530, 1989
T. N. Bui and B. R. Moon. Hyperplane synthesis for genetic algorithms. In Fifth International Conference on Genetic Algorithms, pages 102-109, July 1993
T. N. Bui and B. R. Moon. Genetic algorithm and graph partitioning. IEEE Trans. on Computers, Vol. 45, No.7, pages 841-855, 1996
B. R. Moon and C. K. Kim. A two-dimensional embedding of graphs for genetic algorithms. In International Conference on Genetic Algorithms, pages 204-211, 1997
P. Merz and B. Freisleben. Memetic algorithms and the tness landscape of the graph bi-partitioning problem. In Proceedings of the 5th International Conference on Parallel Problem Solving From Nature, 1998. Lecture Notes in Computer Science, Vol. 1498, pages 765-774, Springer-Verlag
R. Battiti and A. Bertossi. Greedy, prohibition, and reactive heuristics for graph partitioning. IEEE Trans. on Computers, Vol. 48, No.4, pages 361-385, 1999
Y. H. Kim and B. R. Moon. A hybrid genetic search for graph partitioning based on lock gain. In Genetic and Evolutionary Computation Conference, pages 167-174, 2000
M. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, 1979
D. Adolphson and T. Hu. Optimal linear ordering. SIAM J. Appl. Math., Vol. 25, No.3, pages 403-423, 1973
C. Cheng. Linear placement algorithms and applications to VLSI design. Networks, Vol. 17, pages 439-464, 1987
Y. Nagata and S. Kobayashi. Edge assembly crossover: A high-power genetic algorithm for the traveling salesman problem. In 7th International Conference on Genetic Algorithms, pages 450-457, 1997
S. Jung and B. R. Moon. Toward minimal restriction of genetic encoding and crossovers for the 2D Euclidean TSP. IEEE Transactions on Evolutionary Computation, Vol. 6, No.6, pages 557-565, 2002
D. I. Seo and B. R. Moon. Voronoi quantized crossover for traveling salesman problem. In Genetic and Evolutionary Computation Conference, pages 544-552, 2002
D. Goldberg and R. Lingle. Alleles, loci, and the traveling salesman problem. In First International Conference on Genetic Algorithms and Their Applications, pages 154-159, 1985
C. H. Papadimitriou and K. Steiglitz. Combinatorial Optimization: Algorithms and Complexity, Dover Publications, Inc., Mineola, New York, 1998
C. Alpert and A. B. Kahng. A general framework for vertex orderings, with applications to netlist clustering. In IEEE/ACM International Conference on Computer-Aided Design, pages 63-67, 1994
D. S. Johnson, C. Aragon, L. McGeoch, and C. Schevon. Optimization by simulated annealing: An experimental evaluation, Part 1, graph partitioning. Operations Research, Vol. 37, pages 865-892, 1989
T. N. Bui and B. R. Moon. A genetic algorithm for a special class of the quadratic assignment problem. The Quadratic Assignment and Related problems, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 16, pages 99-116, 1994
http://www.iwr.uniheidelberg.de/iwr/comopt/soft/TSPLIB95/TSPLIB.html
Y. Davidor. Epistasis variance: A viewpoint on ga-hardness. In Foundations of Genetic Algorithms 3, pages 23-35. Morgan Kaufmann, 1991
C. Reeves and C. Wright. An experimental design perspective on genetic algorithms. In Foundations of Genetic Algorithms 3, pages 7-22. Morgan Kaufmann, 1995
C. Reeves and C. .Wright. Epistasis in genetic algorithms: An experimental design perspective. In Proceedings of the Sixth International Conference on Genetic Algorithms, pages 217-224. Morgan Kaufmann, 1995
C. Fonlupt, D. Robilliard, and Philippe Preux. A bit-wise epistasis measure for binary search spaces. Lecture Notes in Computer Science, Vol. 1498, pages 47-56, 1998
M. Munetomo and D. Goldberg. Identifying linkage by nonlinearity check, 1998
M. Pelikan, D. Goldberg, and F.o Lobo. A survey of optimization by building and using probabilistic model. Technical Report 99018, IlliGAL, September 1999
T. N. Bui and B. R. Moon. On multi-dimensional encoding/crossover. In Sixth International Conference on genetic Algorithms, pages 49-56, 1995
A. B. Kahng and B. R. Moon. Toward more powerful recombinations. In Sixth International Conference on genetic Algorithms, pages 96-103, 1995
※ AI-Helper는 부적절한 답변을 할 수 있습니다.