检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:王征应
出 处:《High Technology Letters》2000年第4期76-79,共4页高技术通讯(英文版)
摘 要:The delay constrained least cost multicast routing problem is introduced and then a related genetic algorithm is proposed. Finally, simulation results are shown to prove that the genetic algorithm is fast and effective.The delay constrained least cost multicast routing problem is introduced and then a related genetic algorithm is proposed. Finally, simulation results are shown to prove that the genetic algorithm is fast and effective.
关 键 词:MULTICAST ROUTING NP COMPLETE problem GENETIC algorithmX
分 类 号:TN914.5[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15