• 대한전기학회
Mobile QR Code QR CODE : The Transactions of the Korean Institute of Electrical Engineers
  • COPE
  • kcse
  • 한국과학기술단체총연합회
  • 한국학술지인용색인
  • Scopus
  • crossref
  • orcid
The Transactions of the Korean Institute of Electrical Engineers

The Transactions of the Korean Institute of Electrical Engineers

ISO Journal TitleTrans. Korean. Inst. Elect. Eng.
SCImago Journal & Country Rank

Journal Search

  1. Home
  2. Archive
  3. 2020-11 (Vol.69 No.11)
  4. 10.5370/KIEE.2020.69.11.1724
XML PDF INFO REF

References

1 
M. P. Papazoglou, D. Georgakopoulos, 2003, Service Oriented Computing, Communication of the ACM, Vol. 46, No. 10, pp. 25-28Google Search
2 
L. Papazoglou, M. Traverso, P. Dustdar, A. Schahram, F. Leymann, 2007, Service-Oriented Computing: State of the Art and Research Challenges, IEEE Computer, Vol. 40, pp. 38-45DOI
3 
L. Atzori, A. Iera, G. Morabito, 2010, The internet of things: A survey, Computer Networks, Vol. 54, No. 15, pp. 2787-2805DOI
4 
V. Issarny, N. Georgantas, S. Hachem, A. Zarras, P. Vassiliadist, M. Autili, M. Gerosa, A. Hamida, 2011, Service- oriented middleware for the future internet: state of the art and research directions, Journal of Internet Service and Application, Vol. 2, pp. 23-45Google Search
5 
H. Kil, R. Cha, W. Nam, 2016, Transaction history-based web service composition for uncertain QoS, International Journal of Web and Grid Services, Vol. 12, No. 1, pp. 42-62DOI
6 
W. Nam, R. Cha, H. Kil, 2016, Optimal algorithm for Internet-of-Things service composition based on response time, International Journal of Web and Grid Services, Vol. 12, No. 4, pp. 388-406DOI
7 
H. Kil, W. Nam, 2013, Efficient Anytime Algorithm for Large Scale QoS-aware Web Service Composition, Inter- national Journal of Web and Grid Services, Vol. 9, No. 1, pp. 82-106DOI
8 
A. Felner, 2011, Position paper: Dijkstra’s algorithm versus uniform cost search or a case against Dijkstra’s algorithm, In Proceedings of the 4th Annual Symposium on Com- binatorial Search, pp. 47-51Google Search
9 
G. Ramalingam, T. Reps, 1996, An incremental algorithm for a generalization of the shortest-path problem, Journal of Algorithms, Vol. 21, pp. 267-305DOI
10 
S. Koenig, M. Likhachev, D. Furcy, 2004, Lifelong planning A, Artificial Intelligence, Vol. 155, No. 1-2, pp. 93-146DOI
11 
W. Nam, H. Kil, D. Lee, 2011, On the computational complexity of behavioral description-based web service composition, Theoretical Computer Science, Vol. 412, No. 48, pp. 6736-6749DOI
12 
P. E. Hart, N. J. Nilsson, B. Raphael, 1968, A formal basis for the heuristic determination of minimum cost paths, IEEE Transactions on Systems Science and Cybernetics, Vol. 4, No. 2, pp. 100-107DOI
13 
S. Kona, A. Bansal, M. B. Blake, S. Bleul, T. Weise, 2009, WSC-2009: A quality of service-oriented web services challenge, In IEEE Conference on Commerce nd Enterprise Computing, pp. 478-490DOI
14 
S. Koenig, D. Furcy, C. Bauer, 2002, Heuristic search-based replanning, In Proceedings of the 6th International Con- ference on Artificial Intelligence Planning Systems, pp. 294-301Google Search
15 
S. Koenig, M. Likhachev, D. Furcy, 2004, Lifelong planning A, Artificial Intelligence, Vol. 155, No. 1-2, pp. 93-146DOI
16 
K. E. Bekris, K. I. Tsianos, L. E. Kavraki, 2009, Safe and distributed kinodynamic replanning for vehicular networks, Mobile Networks and Applications, Vol. 14, No. 3, pp. 292-308DOI
17 
M. Garcia, A. Viguria, A. Ollero, 2013, Dynamic graph- search algorithm for global path planning in presence of hazardous weather, Journal of Intelligent and Robotic Systems, Vol. 69, pp. 285-295DOI