메뉴 건너뛰기




Volumn 2, Issue , 2002, Pages 1564-1569

Letting ants labeling point features

Author keywords

[No Author keywords available]

Indexed keywords

GENETIC ALGORITHMS;

EID: 84901461128     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2002.1004475     Document Type: Conference Paper
Times cited : (20)

References (19)
  • 1
    • 0027009348 scopus 로고
    • Trails and U-turns in the selection of the shortest path by the ant Lasius Niger
    • R. Beckers, J. L. Deneubourg, and S. Goss. Trails and U-turns in the selection of the shortest path by the ant Lasius Niger. Joumal of TheoreticalBiology, 159:397-415, 1992.
    • (1992) Joumal of TheoreticalBiology , vol.159 , pp. 397-415
    • Beckers, R.1    Deneubourg, J.L.2    Goss, S.3
  • 2
    • 0008533256 scopus 로고
    • Placing text labels on maps and diagrams
    • P. S. Heckbert, editor Academic Press
    • J. Christensen, J. Marks, and S. Shieber. Placing text labels on maps and diagrams. In P. S. Heckbert, editor, Graphic Gems IV, pages 497-504. Academic Press, 1994.
    • (1994) Graphic Gems , vol.4 , pp. 497-504
    • Christensen, J.1    Marks, J.2    Shieber, S.3
  • 3
    • 0029332494 scopus 로고
    • An empirical study of algorithms for point-feature label placement
    • J. Christensen, J. Marks, and S. Shieber. An empirical study of algorithms for point-feature label placement. ACM Transactions on Graphics, 14(3):203-232, 1995.
    • (1995) ACM Transactions on Graphics , vol.14 , Issue.3 , pp. 203-232
    • Christensen, J.1    Marks, J.2    Shieber, S.3
  • 6
    • 84976797397 scopus 로고
    • A rule-based system for dense-map name placement
    • J. Doerschler and H. Freeman. A rule-based system for dense-map name placement. Communications offhe ACM, 35(1):68-79,1992.
    • (1992) Communications Offhe ACM , vol.35 , Issue.1 , pp. 68-79
    • Doerschler, J.1    Freeman, H.2
  • 7
    • 0033084695 scopus 로고    scopus 로고
    • Ant algorithms for discrete optimization
    • M. Dorigo, G. Di Caro, and L. M. Gambardella. Ant algorithms for discrete optimization. Artificial Lije, 5(2):137-172, 1999.
    • (1999) Artificial Lije , vol.5 , Issue.2 , pp. 137-172
    • Dorigo, M.1    Di Caro, G.2    Gambardella, M.L.3
  • 8
    • 0031122887 scopus 로고    scopus 로고
    • Ant colony system: A cooperative learning approach to the traveling salesman problem
    • M. Dorigo and L. M. Gambardella. Ant colony system: A cooperative learning approach to the traveling salesman problem." IEEE Transactions on Evolutionary Computation, 1(1):5346, 1997.
    • (1997) IEEE Transactions on Evolutionary Computation , vol.1 , Issue.1 , pp. 5346
    • Dorigo, M.1    Gambardella, M.L.2
  • 11
    • 0019999398 scopus 로고
    • An algorithm for automatic name placement around point data
    • S. A. Hirsch. An algorithm for automatic name placement around point data. The American Cartographer, 9(1):5-17, 1982.
    • (1982) The American Cartographer , vol.9 , Issue.1 , pp. 5-17
    • Hirsch, S.A.1
  • 12
    • 84900523880 scopus 로고
    • Positioning names on maps
    • E. Imhof. Positioning names on maps. The American Cartographer, 2(2):128-144, 1975.
    • (1975) The American Cartographer , vol.2 , Issue.2 , pp. 128-144
    • Imhof, E.1
  • 13
    • 84957040810 scopus 로고    scopus 로고
    • Optimal labelling of point features in the slider model
    • D.-Z. Du, P. Eades, V. Estivill-Castro, X. Lin, and A. Sharma, editors LNCS Springer
    • G. W. Klau and P. Mutzel. Optimal labelling of point features in the slider model. In D.-Z. Du, P. Eades, V. Estivill-Castro, X. Lin, and A. Sharma, editors, Proceedings of the 6th Annual International Computing and Combinatorics Conference, volume 1858 of LNCS, pages 340-350. Springer, 2000.
    • (2000) Proceedings of the 6th Annual International Computing and Combinatorics Conference , vol.1858 , pp. 340-350
    • Klau, G.W.1    Mutzel, P.2
  • 14
    • 0003408307 scopus 로고    scopus 로고
    • The computational complexity of cartographic label placement
    • Center for Research in Computing Technology, Cambridge, MA
    • J. Marks and S. Shieber. The computational complexity of cartographic label placement. Technical Report TR-05-91,Harvard University, Center for Research in Computing Technology, Cambridge, MA, 199 1.
    • Technical Report TR-05-91 Harvard University , vol.1 , pp. 199
    • Marks, J.1    Shieber, S.2
  • 17
    • 0000704159 scopus 로고    scopus 로고
    • Placing text labels on maps and diagrams using genetic algorithms with masking
    • O. V. Verner, R. L. Wainwright, and D. A. Schoenefeld. Placing text labels on maps and diagrams using genetic algorithms with masking. INFORMS Joumal on Computing, 9(3):266-275, 1997.
    • (1997) INFORMS Joumal on Computing , vol.9 , Issue.3 , pp. 266-275
    • Verner, O.V.1    Wainwright, R.L.2    Schoenefeld, D.A.3
  • 18
    • 0002290002 scopus 로고
    • The logic of automated map lettering
    • P. Yoeli. The logic of automated map lettering. The Cartographic Journal, 9(2):99-108, 1972.
    • (1972) The Cartographic Journal , vol.9 , Issue.2 , pp. 99-108
    • Yoeli, P.1
  • 19
    • 0025493779 scopus 로고
    • The solution of large 0-1 integer programming problems encountered in automated cartography
    • S. Zoraster. The solution of large 0-1 integer programming problems encountered in automated cartography. Operations Research, 38(5):752-759, 1990.
    • (1990) Operations Research , vol.38 , Issue.5 , pp. 752-759
    • Zoraster, S.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.