메뉴 건너뛰기




Volumn 9, Issue 2, 2012, Pages 1-20

An optimal and complete algorithm for automatic web service composition

Author keywords

A* Algorithm (A Star Algorithm); Dependency Graph; Semantic Input Output Matching; Web Service Composition; Web Services

Indexed keywords

A-STAR ALGORITHM; COMPOSITION PROBLEM; CONTROL STRUCTURE; DEPENDENCY GRAPHS; DYNAMIC OPTIMIZATION; HEURISTIC SEARCH; INPUT-OUTPUT; MESSAGE STRUCTURES; NON-TRIVIAL; NUMBER OF SERVICES; OPTIMAL COMBINATION; OPTIMAL SOLUTIONS; SERVICE DEPENDENCY; SUBOPTIMAL SOLUTION; TIME RESTRICTION; WEB SERVICE COMPOSITION;

EID: 84870270168     PISSN: 15457362     EISSN: 15465004     Source Type: Journal    
DOI: 10.4018/jwsr.2012040101     Document Type: Article
Times cited : (31)

References (40)
  • 3
    • 33750322792 scopus 로고    scopus 로고
    • A genetic programming approach to support the design of service compositions
    • Aversano, L., & Taneja, K. (2006). A genetic programming approach to support the design of service compositions. International Journal of Computer Systems Science & Engineering, 21(4), 247-254. (Pubitemid 44622916)
    • (2006) Computer Systems Science and Engineering , vol.21 , Issue.4 , pp. 247-254
    • Aversano, L.1    Di Penta, M.2    Taneja, K.3
  • 8
    • 84871038488 scopus 로고    scopus 로고
    • Georgetown University. Retrieved from
    • Georgetown University. (2005). Introducing the Web service challenge. Retrieved from http://ws-challenge.georgetown.edu/ws-challenge/TechDetails.htm
    • (2005) Introducing the Web Service Challenge.
  • 9
    • 84871071616 scopus 로고    scopus 로고
    • Georgetown University. Retrieved from
    • Georgetown University. (2008a). Challenge results. Retrieved from http://cec2008.cs.georgetown.edu/wsc08/downloads/ChallengeResults.rar
    • (2008) Challenge Results.
  • 10
    • 84871100316 scopus 로고    scopus 로고
    • Georgetown University. Retrieved from
    • Georgetown University. (2008b). WSC results. Retrieved from http://cec2008.cs.georgetown.edu/wsc08/downloads/WSCResult.pdf
    • (2008) WSC Results.
  • 12
    • 84899829959 scopus 로고
    • A formal basis for the heuristic determination of minimum cost paths
    • doi:10.1109/TSSC.1968.300136
    • Hart, P., Nilsson, N., & Raphael, B. (1968). A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics, 4(2), 100-107. doi:10.1109/TSSC.1968.300136
    • (1968) IEEE Transactions on Systems Science and Cybernetics , vol.4 , Issue.2 , pp. 100-107
    • Hart, P.1    Nilsson, N.2    Raphael, B.3
  • 13
    • 34548672440 scopus 로고    scopus 로고
    • A graph-based framework for composition of stateless web services
    • DOI 10.1109/ECOWS.2006.2, 4031152, Proceedings of ECOWS 2006: Fourth European Conference on Web Services
    • Hashemian, S., & Mavaddat, F. (2006). A graph-based framework for composition of stateless Web services. In Proceedings of the European Conference on Web Services (pp. 75-86). Washington, DC: IEEE Computer Society. (Pubitemid 351164921)
    • (2006) Proceedings of ECOWS 2006: Fourth European Conference on Web Services , pp. 75-86
    • Hashemian, S.V.1    Mavaddat, F.2
  • 14
    • 77957256551 scopus 로고    scopus 로고
    • Highly scalable Web service composition using binary tree-based parallelization
    • July. Washington, DC: IEEE Computer Society
    • Hennig, P., & Balke, W.-T. (2010, July). Highly scalable Web service composition using binary tree-based parallelization. In Proceedings of the IEEE International Conference on Web Services (pp. 123-130). Washington, DC: IEEE Computer Society.
    • (2010) Proceedings of the IEEE International Conference on Web Services , pp. 123-130
    • Hennig, P.1    Balke, W.-T.2
  • 15
    • 36348947439 scopus 로고    scopus 로고
    • Web service composition as planning, revisited: in between background theories and initial state uncertainty
    • AAAI-07/IAAI-07 Proceedings: 22nd AAAI Conference on Artificial Intelligence and the 19th Innovative Applications of Artificial Intelligence Conference
    • Hoffmann, J., Bertoli, P., & Pistore, M. (2007). Web service composition as planning, revisited: In between background theories and initial state uncertainty. In Proceedings of the 22nd National Conference of the American Association for Artificial Intelligence (pp. 1013-1018). Palo Alto, CA: AAAI. (Pubitemid 350149702)
    • (2007) Proceedings of the National Conference on Artificial Intelligence , vol.2 , pp. 1013-1018
    • Hoffmann, J.1    Bertoli, P.2    Pistore, M.3
  • 19
    • 33845978454 scopus 로고    scopus 로고
    • A comparative illustration of AI planning-based Web services composition
    • Lee, D., & Kumara, S. R. T. (2005). A comparative illustration of AI planning-based Web services composition. SIGecom Exchanges, 5(5), 1-10.
    • (2005) SIGecom Exchanges , vol.5 , Issue.5 , pp. 1-10
    • Lee, D.1    Kumara, S.R.T.2
  • 20
    • 25144459001 scopus 로고    scopus 로고
    • AND/OR graph and search algorithm for discovering composite web services
    • Liang, Q., & Su, S. (2005). AND/OR graph and search algorithm for discovering composite Web services. International Journal of Web Services Research, 2(4), 48-67. doi:10.4018/jwsr.2005100103 (Pubitemid 41344357)
    • (2005) International Journal of Web Services Research , vol.2 , Issue.4 , pp. 48-67
    • Liang, Q.A.1    Su, S.Y.W.2
  • 23
    • 33750322792 scopus 로고    scopus 로고
    • A genetic programming approach to support the design of service compositions
    • Aversano, L., & Taneja, K. (2006). A genetic programming approach to support the design of service compositions. International Journal of Computer Systems Science & Engineering, 21(4), 247-254. (Pubitemid 44622916)
    • (2006) Computer Systems Science and Engineering , vol.21 , Issue.4 , pp. 247-254
    • Aversano, L.1    Di Penta, M.2    Taneja, K.3
  • 28
    • 84871038488 scopus 로고    scopus 로고
    • Georgetown University. Retrieved from
    • Georgetown University. (2005). Introducing the Web service challenge. Retrieved from http://ws-challenge.georgetown.edu/ws-challenge/TechDetails.htm
    • (2005) Introducing the Web Service Challenge.
  • 29
    • 84871071616 scopus 로고    scopus 로고
    • Georgetown University. Retrieved from
    • Georgetown University. (2008a). Challenge results. Retrieved from http://cec2008.cs.georgetown.edu/wsc08/downloads/ChallengeResults.rar
    • (2008) Challenge Results
  • 30
    • 84871100316 scopus 로고    scopus 로고
    • Georgetown University. Retrieved from
    • Georgetown University. (2008b). WSC results. Retrieved from http://cec2008.cs.georgetown.edu/wsc08/downloads/WSCResult.pdf
    • (2008) WSC Results.
  • 32
    • 84899829959 scopus 로고
    • A formal basis for the heuristic determination of minimum cost paths
    • doi:10.1109/TSSC.1968.300136
    • Hart, P., Nilsson, N., & Raphael, B. (1968). A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics, 4(2), 100-107. doi:10.1109/TSSC.1968.300136
    • (1968) IEEE Transactions on Systems Science and Cybernetics , vol.4 , Issue.2 , pp. 100-107
    • Hart, P.1    Nilsson, N.2    Raphael, B.3
  • 33
    • 34548672440 scopus 로고    scopus 로고
    • A graph-based framework for composition of stateless web services
    • DOI 10.1109/ECOWS.2006.2, 4031152, Proceedings of ECOWS 2006: Fourth European Conference on Web Services
    • Hashemian, S., & Mavaddat, F. (2006). A graph-based framework for composition of stateless Web services. In Proceedings of the European Conference on Web Services (pp. 75-86). Washington, DC: IEEE Computer Society. (Pubitemid 351164921)
    • (2006) Proceedings of ECOWS 2006: Fourth European Conference on Web Services , pp. 75-86
    • Hashemian, S.V.1    Mavaddat, F.2
  • 34
    • 77957256551 scopus 로고    scopus 로고
    • Highly scalable Web service composition using binary tree-based parallelization
    • July, Washington, DC: IEEE Computer Society
    • Hennig, P., & Balke, W.-T. (2010, July). Highly scalable Web service composition using binary tree-based parallelization. In Proceedings of the IEEE International Conference on Web Services (pp. 123-130). Washington, DC: IEEE Computer Society.
    • (2010) Proceedings of the IEEE International Conference on Web Services , pp. 123-130
    • Hennig, P.1    Balke, W.-T.2
  • 35
    • 36348947439 scopus 로고    scopus 로고
    • Web service composition as planning, revisited: in between background theories and initial state uncertainty
    • AAAI-07/IAAI-07 Proceedings: 22nd AAAI Conference on Artificial Intelligence and the 19th Innovative Applications of Artificial Intelligence Conference
    • Hoffmann, J., Bertoli, P., & Pistore, M. (2007). Web service composition as planning, revisited: In between background theories and initial state uncertainty. In Proceedings of the 22nd National Conference of the American Association for Artificial Intelligence (pp. 1013-1018). Palo Alto, CA: AAAI. (Pubitemid 350149702)
    • (2007) Proceedings of the National Conference on Artificial Intelligence , vol.2 , pp. 1013-1018
    • Hoffmann, J.1    Bertoli, P.2    Pistore, M.3
  • 39
    • 33845978454 scopus 로고    scopus 로고
    • A comparative illustration of AI planning-based Web services composition
    • Lee, D., & Kumara, S. R. T. (2005). A comparative illustration of AI planning-based Web services composition. SIGecom Exchanges, 5(5), 1-10.
    • (2005) SIGecom Exchanges , vol.5 , Issue.5 , pp. 1-10
    • Lee, D.1    Kumara, S.R.T.2
  • 40
    • 25144459001 scopus 로고    scopus 로고
    • AND/OR graph and search algorithm for discovering composite web services
    • Liang, Q., & Su, S. (2005). AND/OR graph and search algorithm for discovering composite Web services. International Journal of Web Services Research, 2(4), 48-67. doi:10.4018/jwsr.2005100103 (Pubitemid 41344357)
    • (2005) International Journal of Web Services Research , vol.2 , Issue.4 , pp. 48-67
    • Liang, Q.A.1    Su, S.Y.W.2


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