资源列表
[pratikbilgievi.com]_Ataturk
- Please read your package and describe
aaaaa
- The directory you selected may be incorrect, please re-select:
TDSR-LATEST-CODE
- The reliable data delivery is a challenging task in Wireless Sensor Networks (WSNs) due to dynamic and unpredictable changing behaviors of nodes. The traditional cryptographic and authentication based schemes can’t be adopted due to their associated
TAODV-LATEST-CODE
- The reliable data delivery is a challenging task in Wireless Sensor Networks (WSNs) due to dynamic and unpredictable changing behaviors of nodes. The traditional cryptographic and authentication based schemes can’t be adopted due to their associated
dijkstra_short-path-algo
- Dijkstra s algorithm is an algorithm for finding the shortest paths between nodes in a graph, which may represent, for example, road networks. It was conceived by computer scientist Edsger W. Dijkstra in 1956 and published three years later.[1][2]
hopbyhop-shortest-path
- Dijkstra thought about the shortest path problem when working at the Mathematical Center in Amsterdam in 1956 as a programmer to demonstrate capabilities of a new computer called ARMAC. His objective was to choose both a problem as well as an answer
kalman
- 卡尔曼滤波例程，基于温度的卡尔曼优化例程，使温度值收敛-Kalman filter routines, temperature-based Kalman optimization routines
shortenergyvoice
- matlab计算语音，音频短时能量代码,提取公式和计算过程，做题演示-matlab caculate the short ennergy of voice
POWERFLOW
- 通用潮流计算算法，从5到300节点都能用。没有稀疏化。-General power flow calculation algorithm, 5 to 300 nodes can be used. No sparse
COMPOW
- （一）在MATLAB环境下建立任意节点数n在不同通信半径r下的无线传感器网络连通图。 （二）在MATLAB环境下仿真相同通信半径、不同节点数的无线传感网络的连通率，以及相同节点数、不同通信半径下的无线传感网络的连通率。 -COMPOW Algorithm
leachCluster
- 实现基本leach分簇，每个节点带有能耗，根据每次数据交换的能耗处理能量，可以记录第一个节点死亡的时间-leach cluster
563_0
- SimMech2ndPart and zhiroskob.xlsx in matlab