|
|||||
|
|
| 基于Logistic回归模型和凝聚函数的多示例学习算法 | |
| 引用本文： | 贺建军,王欣,顾宏,王哲龙.基于Logistic回归模型和凝聚函数的多示例学习算法[J].大连理工大学学报,2010,50(5):788-793. |
| 作者姓名： | 贺建军 王欣 顾宏 王哲龙 |
| 作者单位： | 1. 大连理工大学,数学科学学院,辽宁,大连,116024;中国计量学院,数学系,浙江,杭州,310018 2. 内蒙古工业大学,理学院,内蒙古,呼和浩特,010021 3. 大连理工大学,数学科学学院,辽宁,大连,116024 |
| 基金项目： | 内蒙古工业大学科研基金 |
| 摘 要： | 实时多媒体网络中,带延迟与延迟抖动约束的斯坦利树问题是一个研究热点.这种带约束的斯坦利树被证明是NP-完全问题.提出了一种基于禁忌搜索的带延迟与延迟抖动约束最小代价组播路由算法.实验结果表明,该算法对于实际网络是有效的.这种方法使得IP组播把数据同时发送到组成员时有效地利用了网络资源. |
| 关 键 词： | 组播 禁忌搜索 延迟约束 延迟抖动约束 |
An algorithm for multi-instance learning based on Logistic regression model and aggregate function |
|
| HE Jianjun,WANG Xin,GU Hong,WANG Zhelong.An algorithm for multi-instance learning based on Logistic regression model and aggregate function[J].Journal of Dalian University of Technology,2010,50(5):788-793. | |
| Authors: | HE Jianjun WANG Xin GU Hong WANG Zhelong |
| Abstract: | The delay and delay variation-bounded Steiner tree problem is animportant multicast routing issue in real-time multimedia networks.Such a constrained Steiner tree problem is known to be NP-complete.A multicast routing algorithm is presented,which is based on tabu search to produce routing trees having a minimal network cost under delay and delay variation constraints.The approach makes IP multicast utilize resources efficiently in delivering data to a group of members simultaneously. |
| Keywords: | multicast tabu search delay constraint delay variation constraint |
| 本文献已被 万方数据 等数据库收录！ | |
| 点击此处可从《大连理工大学学报》浏览原始摘要信息 | |
| 点击此处可从《大连理工大学学报》下载全文 | |
