Time complexity of finding Compatible Wellness Groups in the Wellness Profile Model
This article describes the Wellness Profile Model. The two decision problems related to the model called the Compatible Wellness Group with Target Member Problem and the Compatible Wellness Group Problem are defined. We propose the two polynomial-time algorithms for solving the two problems here. Ou...
Saved in:
| Main Authors: | , |
|---|---|
| 格式: | Conference or Workshop Item |
| 語言: | English |
| 出版: |
IEEE Computer Society
2014
|
| 在線閱讀: | http://www.scopus.com/inward/record.url?eid=2-s2.0-84905376914&partnerID=40&md5=f4f36b6c70a0b7c9950b2429abda3115 http://cmuir.cmu.ac.th/handle/6653943832/37584 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| id |
th-cmuir.6653943832-37584 |
|---|---|
| record_format |
dspace |
| spelling |
th-cmuir.6653943832-375842014-12-09T05:49:24Z Time complexity of finding Compatible Wellness Groups in the Wellness Profile Model Juneam N. Kantabutra S. This article describes the Wellness Profile Model. The two decision problems related to the model called the Compatible Wellness Group with Target Member Problem and the Compatible Wellness Group Problem are defined. We propose the two polynomial-time algorithms for solving the two problems here. Our main contribution is to show that the time complexities of these two problems are in class P. © 2014 IEEE. 2014-12-09T05:49:24Z 2014-12-09T05:49:24Z 2014 Conference Paper 9781479929924 10.1109/ECTICon.2014.6839741 106689 http://www.scopus.com/inward/record.url?eid=2-s2.0-84905376914&partnerID=40&md5=f4f36b6c70a0b7c9950b2429abda3115 http://cmuir.cmu.ac.th/handle/6653943832/37584 English IEEE Computer Society |
| institution |
Chiang Mai University |
| building |
Chiang Mai University Library |
| country |
Thailand |
| collection |
CMU Intellectual Repository |
| language |
English |
| description |
This article describes the Wellness Profile Model. The two decision problems related to the model called the Compatible Wellness Group with Target Member Problem and the Compatible Wellness Group Problem are defined. We propose the two polynomial-time algorithms for solving the two problems here. Our main contribution is to show that the time complexities of these two problems are in class P. © 2014 IEEE. |
| format |
Conference or Workshop Item |
| author |
Juneam N. Kantabutra S. |
| spellingShingle |
Juneam N. Kantabutra S. Time complexity of finding Compatible Wellness Groups in the Wellness Profile Model |
| author_facet |
Juneam N. Kantabutra S. |
| author_sort |
Juneam N. |
| title |
Time complexity of finding Compatible Wellness Groups in the Wellness Profile Model |
| title_short |
Time complexity of finding Compatible Wellness Groups in the Wellness Profile Model |
| title_full |
Time complexity of finding Compatible Wellness Groups in the Wellness Profile Model |
| title_fullStr |
Time complexity of finding Compatible Wellness Groups in the Wellness Profile Model |
| title_full_unstemmed |
Time complexity of finding Compatible Wellness Groups in the Wellness Profile Model |
| title_sort |
time complexity of finding compatible wellness groups in the wellness profile model |
| publisher |
IEEE Computer Society |
| publishDate |
2014 |
| url |
http://www.scopus.com/inward/record.url?eid=2-s2.0-84905376914&partnerID=40&md5=f4f36b6c70a0b7c9950b2429abda3115 http://cmuir.cmu.ac.th/handle/6653943832/37584 |
| _version_ |
1681421373187031040 |