메뉴 건너뛰기




Volumn 2001-January, Issue , 2001, Pages 1235-1239

Cadastre map assembling: A puzzle game resolution

Author keywords

Document analysis; Document database; L1 norm optimisation

Indexed keywords

COMBINATORIAL OPTIMIZATION;

EID: 78951495992     PISSN: 15205363     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDAR.2001.953979     Document Type: Conference Paper
Times cited : (8)

References (12)
  • 2
    • 33747446938 scopus 로고
    • PhD dissertation, Université Paris V - René Descartes Paris
    • MP. Deseilligny, "Lecture automatique de Cartes", PhD dissertation, Université Paris V - René Descartes, vol 2., Paris, 1994, pp25-59
    • (1994) Lecture Automatique de Cartes , vol.2 , pp. 25-59
    • Deseilligny, M.P.1
  • 4
    • 84902201752 scopus 로고    scopus 로고
    • A raster-based approach for the automatic interpretation of topographic maps
    • Columbus, USA
    • Frischknecht, S., Kanani, E., Carosio, A., 1998. "A raster-based approach for the automatic interpretation of topographic maps". IAPRS, Vol. 32, Part 3/1, Columbus, USA, pp. 523-530.
    • (1998) IAPRS , vol.32 , pp. 523-530
    • Frischknecht, S.1    Kanani, E.2    Carosio, A.3
  • 6
    • 84976801242 scopus 로고
    • Algorithm 478: Solution of an overdetermined system of equations in the LI norm
    • I. Barrodale and F. D. Roberts, "Algorithm 478: Solution of an Overdetermined System of Equations in the LI norm," CACM 17, 1974, pp. 319-320.
    • (1974) CACM 17 , pp. 319-320
    • Barrodale, I.1    Roberts, F.D.2
  • 8
    • 0006899753 scopus 로고
    • Finding a shortest solution for the NxN extension of the 15-puzzle is intractable
    • Philadelphia, Pa
    • D. Ratner & M. Warmuth, "Finding a shortest solution for the NxN extension of the 15-puzzle is intractable", in Proceedings of AAAI 1986, Philadelphia, Pa, 1986.
    • (1986) Proceedings of AAAI 1986
    • Ratner, D.1    Warmuth, M.2
  • 10
    • 0000840830 scopus 로고    scopus 로고
    • A 2-approximation algorithm for genome rearrangements by reversals and transpositions
    • Q.P. Gu, S. Peng, H. Sudborough, "A 2-approximation algorithm for genome rearrangements by reversals and transpositions", Theor. Comput. Science 210 (1999) pp. 327-339.
    • (1999) Theor. Comput. Science , vol.210 , pp. 327-339
    • Gu, Q.P.1    Peng, S.2    Sudborough, H.3
  • 11
    • 84951800696 scopus 로고
    • DNA mapping algorithms: Clone sequencing
    • Oct.
    • H H. Lewis, Will Gillett, "DNA Mapping Algorithms: Clone Sequencing", WUCS-91-34, Oct. 1991
    • (1991) WUCS-91-34
    • Lewis, H.H.1    Gillett, W.2
  • 12
    • 84957701606 scopus 로고
    • Parallel search for combinatorial optimization: Genetic algorithms, simulated annealing and GRASP
    • P. Pardalos, L. Pitsoulis, T. Mavridou, and M. Resende, "Parallel search for combinatorial optimization: Genetic algorithms, simulated annealing and GRASP", in Computer Science, 980 (1995), pp. 317-331.
    • (1995) Computer Science , vol.980 , pp. 317-331
    • Pardalos, P.1    Pitsoulis, L.2    Mavridou, T.3    Resende, M.4


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