메뉴 건너뛰기




Volumn 2012, Issue , 2012, Pages

A cost-effective planning graph approach for large-scale web service composition

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATE SOLUTION; BACKWARD PLANNING; COMPOSITE SERVICES; FEASIBLE SOLUTION; OUTPUT PARAMETERS; PLANNING GRAPHS; SEARCH ALGORITHMS; SERVICE COMPOSITIONS; SERVICE COSTS; SERVICE MATCHING; SIMULATION PLATFORM; WEB SERVICE COMPOSITION; WEB SERVICES ENVIRONMENT;

EID: 84861059492     PISSN: 1024123X     EISSN: 15635147     Source Type: Journal    
DOI: 10.1155/2012/783476     Document Type: Article
Times cited : (20)

References (15)
  • 3
    • 84856299846 scopus 로고    scopus 로고
    • Dynamic planning approach to automated web service composition
    • Kuzu M., Cicekli N. K., Dynamic planning approach to automated web service composition Applied Intelligence 2010 36 1 1 28
    • (2010) Applied Intelligence , vol.36 , Issue.1 , pp. 1-28
    • Kuzu, M.1    Cicekli, N.K.2
  • 5
    • 34249914762 scopus 로고    scopus 로고
    • Context optimization of AI planning for semantic Web services composition
    • DOI 10.1007/s11761-007-0010-3
    • Qiu L., Chang L., Lin F., Shi Z., Context optimization of AI planning for semantic Web services composition Service Oriented Computing and Applications 2007 1 2 117 128 (Pubitemid 46870984)
    • (2007) Service Oriented Computing and Applications , vol.1 , Issue.2 , pp. 117-128
    • Qiu, L.1    Chang, L.2    Lin, F.3    Shi, Z.4
  • 10
    • 0031074857 scopus 로고    scopus 로고
    • Fast planning through planning graph analysis
    • PII S0004370296000471
    • Blum A. L., Furst M. L., Fast planning through planning graph analysis Artificial Intelligence 1997 90 1-2 281 300 (Pubitemid 127398372)
    • (1997) Artificial Intelligence , vol.90 , Issue.1-2 , pp. 281-300
    • Blum, A.L.1    Furst, M.L.2
  • 11
    • 0035501435 scopus 로고    scopus 로고
    • Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP
    • DOI 10.1016/S0004-3702(01)00128-X, PII S000437020100128X
    • Kambhampati S., Do M. B., Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP Artificial Intelligence 2001 132 2 151 182 (Pubitemid 32951239)
    • (2001) Artificial Intelligence , vol.132 , Issue.2 , pp. 151-182
    • Do, M.B.1    Kambhampati, S.2
  • 14
    • 69249238806 scopus 로고    scopus 로고
    • WSBen: A web services discovery and composition benchmark toolkit
    • Oh S. C., Lee D., WSBen: A web services discovery and composition benchmark toolkit International Journal of Web Services Research 2009 6 1 1 19
    • (2009) International Journal of Web Services Research , vol.6 , Issue.1 , pp. 1-19
    • Oh, S.C.1    Lee, D.2
  • 15
    • 0942276880 scopus 로고    scopus 로고
    • Complex networks: Small-world, scale-free and beyond
    • Wang X. F., Chen G., Complex networks: Small-world, scale-free and beyond IEEE Circuits and Systems Magazine 2003 3 1 6 20
    • (2003) IEEE Circuits and Systems Magazine , vol.3 , Issue.1 , pp. 6-20
    • Wang, X.F.1    Chen, G.2


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