메뉴 건너뛰기




Volumn 1, Issue 1, 2004, Pages 1-20

A Spanning Tree Based Approach to Identifying Web Services

Author keywords

genetic algorithm; graph partitioning; spanning tree; web services; web services identification

Indexed keywords


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

References (28)
  • 1
    • 0000606343 scopus 로고
    • Reusability-based Strategy for Development of Information Systems: Implementation Experience of a Bank
    • Apte, U. & Sankar, C. S. (1990). Reusability-based Strategy for Development of Information Systems: Implementation Experience of a Bank. MIS Quarterly. 14(4), 421–433.
    • (1990) MIS Quarterly , vol.14 , Issue.4 , pp. 421-433
    • Apte, U.1    Sankar, C.S.2
  • 8
    • 0001274890 scopus 로고
    • A Comprehensive Model for the Design of Distributed Computer Systems
    • Jain, H. (1987). A Comprehensive Model for the Design of Distributed Computer Systems. IEEE Transactions on Software Engineering. SE-13(10), 1092 -1104.
    • (1987) IEEE Transactions on Software Engineering , vol.SE-13 , Issue.10 , pp. 1092-1104
    • Jain, H.1
  • 11
    • 85001684464 scopus 로고    scopus 로고
    • Web Service Identification - A Multi-objective Genetic Algorithm Based Approach
    • School of Business Administration, University of Wisconsin - Milwaukee
    • Jain, H., Zhao, H., & Chinta, N. R. (2003b). Web Service Identification - A Multi-objective Genetic Algorithm Based Approach. Working paper. School of Business Administration, University of Wisconsin - Milwaukee.
    • (2003) Working paper
    • Jain, H.1    Zhao, H.2    Chinta, N.R.3
  • 12
    • 4243187148 scopus 로고    scopus 로고
    • Fulfilling the Web Services Promise
    • Kreger, H. (2003). Fulfilling the Web Services Promise. Communications of the ACM. 46(6), 29–34.
    • (2003) Communications of the ACM , vol.46 , Issue.6 , pp. 29-34
    • Kreger, H.1
  • 13
    • 70350674995 scopus 로고
    • On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem
    • Kruskal, J. B. (1956). On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem. Proceedings of the American Mathematical Society. 7, 48–50.
    • (1956) Proceedings of the American Mathematical Society , vol.7 , pp. 48-50
    • Kruskal, J.B.1
  • 14
    • 0042417060 scopus 로고    scopus 로고
    • A Goal-driven Approach to Enterprise Component Identification and Specification
    • Levi, K. & Arsanjani, A. (2002). A Goal-driven Approach to Enterprise Component Identification and Specification. Communications of the ACM. 45(10), 45–52.
    • (2002) Communications of the ACM , vol.45 , Issue.10 , pp. 45-52
    • Levi, K.1    Arsanjani, A.2
  • 16
    • 4243066375 scopus 로고    scopus 로고
    • The Web Services Debase:.Net vs. J2EE
    • Miller, G. (2003). The Web Services Debase:.Net vs. J2EE. Communications of the ACM. 46(6), 64–67.
    • (2003) Communications of the ACM , vol.46 , Issue.6 , pp. 64-67
    • Miller, G.1
  • 17
  • 18
    • 84911584312 scopus 로고
    • Shortest Connection Networks and Some Generalizations
    • Prim, R. C. (1957). Shortest Connection Networks and Some Generalizations. Bell Systems Technical Journal. 36, 1389–1401.
    • (1957) Bell Systems Technical Journal , vol.36 , pp. 1389-1401
    • Prim, R.C.1
  • 21
    • 0003278278 scopus 로고    scopus 로고
    • Graph Partitioning for High Performance Scientific Simulations
    • In J. Dongarra et al. (Ed.) Morgan Kaufmann
    • Schloegel, K., Karypis, G., & Kumar, V. (2000). Graph Partitioning for High Performance Scientific Simulations. In J. Dongarra et al. (Ed.), CRPC Parallel Computing Handbook. Morgan Kaufmann.
    • (2000) CRPC Parallel Computing Handbook
    • Schloegel, K.1    Karypis, G.2    Kumar, V.3
  • 22
    • 0000852513 scopus 로고
    • Multiobjective Optimization Using Nondominated Sorting in Genetic Algorithms
    • Srinivas, N. & Deb, K. (1994). Multiobjective Optimization Using Nondominated Sorting in Genetic Algorithms. Evolutionary Computation. 2(3), 221–248.
    • (1994) Evolutionary Computation , vol.2 , Issue.3 , pp. 221-248
    • Srinivas, N.1    Deb, K.2
  • 24
    • 84936886574 scopus 로고    scopus 로고
    • Version 1.7
    • Tata Consultancy Services (1999). ADEX modeling Framework, Version 1.7.
    • (1999) ADEX modeling Framework
  • 25
    • 85001674770 scopus 로고    scopus 로고
    • Component-based Software Development: Design, Retrieval, and Assembly
    • November
    • Vitharana, P., Zahedi, F., & Jain, H. (2003, November). Component-based Software Development: Design, Retrieval, and Assembly. Communications of the ACM.
    • (2003) Communications of the ACM
    • Vitharana, P.1    Zahedi, F.2    Jain, H.3
  • 26
    • 1642626927 scopus 로고    scopus 로고
    • The Web Services Debase: J2EE vs.Net
    • Williams, J. (2003). The Web Services Debase: J2EE vs.Net. Communications of the ACM. 46(6), 59–63.
    • (2003) Communications of the ACM , vol.46 , Issue.6 , pp. 59-63
    • Williams, J.1


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