메뉴 건너뛰기




Volumn , Issue , 2014, Pages 1529-1534

Product oriented integration of heterogeneous mobility services

Author keywords

[No Author keywords available]

Indexed keywords

INTELLIGENT SYSTEMS; INTELLIGENT VEHICLE HIGHWAY SYSTEMS;

EID: 84937130548     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITSC.2014.6957650     Document Type: Conference Paper
Times cited : (34)

References (11)
  • 1
    • 84910033102 scopus 로고    scopus 로고
    • Mein haus, mein pool, meine mobilität
    • M. Bentenrieder, "Mein Haus, mein Pool, meine Mobilität," Automotive Agenda, Vol. 3, no. 4, pp. S.34-43, 2010.
    • (2010) Automotive Agenda , vol.3 , Issue.4 , pp. 34-43
    • Bentenrieder, M.1
  • 4
    • 0346487427 scopus 로고    scopus 로고
    • Information system integration
    • W. Hasselbring, "Information system integration," Communications of the ACM, Vol. 43, no. 6, pp. 32-38, 2000.
    • (2000) Communications of the ACM , vol.43 , Issue.6 , pp. 32-38
    • Hasselbring, W.1
  • 7
    • 77952581340 scopus 로고    scopus 로고
    • Business models, business strategy and innovation
    • Apr.
    • D. J. Teece, "Business Models, Business Strategy and Innovation," Long Range Planning, Vol. 43, no. 2-3, pp. 172-194, Apr. 2010.
    • (2010) Long Range Planning , vol.43 , Issue.2-3 , pp. 172-194
    • Teece, D.J.1
  • 8
    • 84899829959 scopus 로고
    • A formal basis for the heuristic determination of minimum cost paths
    • IEEE Transactions on July
    • P. Hart, N. Nilsson, and B. Raphael, "A formal basis for the heuristic determination of minimum cost paths," Systems Science and Cybernetics, IEEE Transactions on, Vol. 4, no. 2, pp. 100-107, July 1968.
    • (1968) Systems Science and Cybernetics , vol.4 , Issue.2 , pp. 100-107
    • Hart, P.1    Nilsson, N.2    Raphael, B.3
  • 9
    • 20744448516 scopus 로고    scopus 로고
    • Computing the shortest path: A search meets graph theory
    • ser. SODA '05. Philadelphia, PA, USA: Society for Industrial and Applied Mathematics [Online]. Available
    • A. V. Goldberg and C. Harrelson, "Computing the shortest path: A search meets graph theory," in Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, ser. SODA '05. Philadelphia, PA, USA: Society for Industrial and Applied Mathematics, 2005, pp. 156-165. [Online]. Available: http://dl.acm.org/citation.cfm?id=1070432.1070455
    • (2005) Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms , pp. 156-165
    • Goldberg, A.V.1    Harrelson, C.2
  • 10
    • 84894366809 scopus 로고    scopus 로고
    • Generalised time-dependent graphs for fully multimodal journey planning
    • 2013 16th International IEEE Conference on, Oct
    • J. Hrncir and M. Jakob, "Generalised time-dependent graphs for fully multimodal journey planning," in Intelligent Transportation Systems-(ITSC), 2013 16th International IEEE Conference on, Oct 2013, pp. 2138-2145.
    • (2013) Intelligent Transportation Systems-(ITSC) , pp. 2138-2145
    • Hrncir, J.1    Jakob, M.2


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