Please use this identifier to cite or link to this item:
http://cmuir.cmu.ac.th/jspui/handle/6653943832/54355
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Apitchaka Singjai | en_US |
dc.contributor.author | Pradorn Sureephong | en_US |
dc.date.accessioned | 2018-09-04T10:12:20Z | - |
dc.date.available | 2018-09-04T10:12:20Z | - |
dc.date.issued | 2015-01-01 | en_US |
dc.identifier.issn | 17563798 | en_US |
dc.identifier.issn | 1756378X | en_US |
dc.identifier.other | 2-s2.0-84938246762 | en_US |
dc.identifier.other | 10.1108/IJICC-06-2014-0029 | en_US |
dc.identifier.uri | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84938246762&origin=inward | en_US |
dc.identifier.uri | http://cmuir.cmu.ac.th/jspui/handle/6653943832/54355 | - |
dc.description.abstract | © Emerald Group Publishing Limited. Purpose – The purpose of this paper is to propose a combined technique of cumulative voting and numerical assignment to prioritize the services of the learning cloud service. Design/methodology/approach – The approach starts with requirement elicitation, then analyses of the requirements in terms of prioritization and finally classifies the priority of services into groups. Findings – As a result of the case study the requirements of the College of Art Media and Technology students has been classified into three service groups. Originality/value – This combined prioritized techniques can involve learners in the decision making process about learning cloud services utilization in the organizations. | en_US |
dc.subject | Computer Science | en_US |
dc.title | Prioritization technique for learning cloud services | en_US |
dc.type | Journal | en_US |
article.title.sourcetitle | International Journal of Intelligent Computing and Cybernetics | en_US |
article.volume | 8 | en_US |
article.stream.affiliations | Chiang Mai University | en_US |
Appears in Collections: | CMUL: Journal Articles |
Files in This Item:
There are no files associated with this item.
Items in CMUIR are protected by copyright, with all rights reserved, unless otherwise indicated.