Time complexity of finding Compatible Wellness Groups in the Wellness Profile Model

Nopadon Juneam, Sanpawat Kantabutra
{"title":"Time complexity of finding Compatible Wellness Groups in the Wellness Profile Model","authors":"Nopadon Juneam, Sanpawat Kantabutra","doi":"10.1109/ECTICON.2014.6839741","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":347166,"journal":{"name":"2014 11th International Conference on Electrical Engineering/Electronics, Computer, Telecommunications and Information Technology (ECTI-CON)","volume":"124 1-2","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 11th International Conference on Electrical Engineering/Electronics, Computer, Telecommunications and Information Technology (ECTI-CON)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ECTICON.2014.6839741","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

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.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
在健康档案模型中寻找相容健康团体的时间复杂度
本文描述了健康概要模型。定义了与该模型相关的两个决策问题,即具有目标成员的相容健康组问题和相容健康组问题。我们提出了两种多项式时间算法来解决这两个问题。我们的主要贡献是证明了这两个问题的时间复杂度属于P类。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A TDMA baseband design for physiological signal transmission application in 0.18-μm CMOS technology Bandpass filters using stepped impedance resonators and stub loads for wide harmonics suppression Developing policies for channel allocation in Cognitive Radio Networks using Game Theory Hardware-based algorithm for Sine and Cosine computations using fixed point processor Time complexity of finding Compatible Wellness Groups in the Wellness Profile Model
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1