메뉴 건너뛰기




Volumn , Issue , 2008, Pages 691-699

An efficient syntactic web service composition algorithm based on the planning graph model

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION; SYNTACTICS; WORLD WIDE WEB;

EID: 57749199062     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICWS.2008.134     Document Type: Conference Paper
Times cited : (84)

References (11)
  • 1
    • 57749202039 scopus 로고    scopus 로고
    • http://ws-challenge. org.
  • 2
    • 0028498153 scopus 로고
    • The computational complexity of prepositional STRIPS planning
    • T. Bylander. The computational complexity of prepositional STRIPS planning. Artificial Intelligence, 69(1-2), 1994.
    • (1994) Artificial Intelligence , vol.69 , Issue.1-2
    • Bylander, T.1
  • 4
    • 11044239442 scopus 로고    scopus 로고
    • Current Solutions for Web Service Composition
    • N. Milanovic and M. Malek. Current Solutions for Web Service Composition. IEEE Internet Computing, 8(6), 2004.
    • (2004) IEEE Internet Computing , vol.8 , Issue.6
    • Milanovic, N.1    Malek, M.2
  • 5
    • 34047229359 scopus 로고    scopus 로고
    • Web Service Planner (WSPR): An Effective and Scalable Web Service Composition Algorithm
    • S. Oh, D. Lee, and S. Kumara. Web Service Planner (WSPR): An Effective and Scalable Web Service Composition Algorithm. International Journal of Web Services Research, 4(1), 2007.
    • (2007) International Journal of Web Services Research , vol.4 , Issue.1
    • Oh, S.1    Lee, D.2    Kumara, S.3
  • 7
    • 33846014731 scopus 로고    scopus 로고
    • Web Service Composition via Logic-based Program Synthesis. PhD thesis, Department of Computer and Information Science, Norwegian University of Science and Technology
    • J. Rao. Semantic Web Service Composition via Logic-based Program Synthesis. PhD thesis, Department of Computer and Information Science, Norwegian University of Science and Technology, 2004.
    • (2004) Semantic
    • Rao, J.1
  • 9
    • 33847228183 scopus 로고    scopus 로고
    • retrieved in 2004
    • W3C. WSDL Specification, 2003, retrieved in 2004. http://www.w3.org/TR/ wsdl/.
    • (2003) W3C. WSDL Specification
  • 10
    • 63749119962 scopus 로고    scopus 로고
    • Y. Yan and X.R. Zheng. A Planning Graph Based Algorithm for Semantic Web Service Composition. In IEEE Joint Conference on E-Commerce Technology (CEC'08) and Enterprise Computing, E-Commerce and E-Services (EEE'08), accepted, 2008.
    • Y. Yan and X.R. Zheng. A Planning Graph Based Algorithm for Semantic Web Service Composition. In IEEE Joint Conference on E-Commerce Technology (CEC'08) and Enterprise Computing, E-Commerce and E-Services (EEE'08), accepted, 2008.
  • 11
    • 34248525624 scopus 로고    scopus 로고
    • Efficient Algorithms for Web Services Selection with End-to-End QoS Constraints
    • T. Yu, Y. Zhang, and K.J. Lin. Efficient Algorithms for Web Services Selection with End-to-End QoS Constraints. ACM Transactions on the Web, 1(1), 2007.
    • (2007) ACM Transactions on the Web , vol.1 , Issue.1
    • Yu, T.1    Zhang, Y.2    Lin, K.J.3


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