根据有无固定基础设施
根据有无固定基础设施，无线局域网又可分为BSS (Basic Service Set)和IBSS (Independent Basic Service Set)。我们要研究的ad hoc网络属于后者。...
Min-Sum技术资料
📦 资源总数：159
💻 源代码：52396
📚 Min-Sum全部资料 (159个)
本文档提供JSR120无线消息API规范的说明
本文档提供JSR120无线消息API规范的说明，也描述Sum的RI的API....
Waterfilling algorithm (from [Palomar and Fonollosa, Trans-SP2004]) to compute: pi = (mu*ai - bi
Waterfilling algorithm (from [Palomar and Fonollosa, Trans-SP2004]) to compute: pi = (mu*ai - bi...
北京大学ACM比赛题目 In 1742, Christian Goldbach, a German amateur mathematician, sent a letter to Leonhard
北京大学ACM比赛题目 In 1742, Christian Goldbach, a German amateur mathematician, sent a letter to Leonhard ...
设计一个程序完成求1－100的累加和
设计一个程序完成求1－100的累加和，结果送到SUM单元中...
KMEANS Trains a k means cluster model.CENTRES = KMEANS(CENTRES, DATA, OPTIONS) uses the batch K-mean
KMEANS Trains a k means cluster model.CENTRES = KMEANS(CENTRES, DATA, OPTIONS) uses the batch K-mean...
杭电 ACM 1002 I have a very simple problem for you. Given two integers A and B, your job is to calcul
杭电 ACM 1002 I have a very simple problem for you. Given two integers A and B, your job is to calcul...
中南赛区ACM竞赛题 Description Given a two-dimensional array of positive and negative integers, a sub-rec
中南赛区ACM竞赛题 Description Given a two-dimensional array of positive and negative integers, a sub-rec...
利用凌阳单片机中计算从从1到100进行累加
利用凌阳单片机中计算从从1到100进行累加，并把计算结果保存在[Sum]单元里...
动态规划的方程大家都知道
动态规划的方程大家都知道，就是 f[i,j]=min{f[i-1,j-1],f[i-1,j],f[i,j-1],f[i,j+1]}+a[i,j] 但是很多人会怀疑这道题的后效性而放弃动规做法。 ...