搜索资源列表
idl_envi5.0
- 这个文档实现了大气的气溶胶反演路线，而且包括了详细的实现方法，为在该方面从事研究的人员提供很好的参考-This document implements the atmospheric aerosol retri route, and includes a detailed implementation method, in the area to provide a good reference for the researchers engaged in the study
Happiness-is-the-trap
- 幸福是陷阱.路斯-哈里斯，这是一本脍炙人口的书籍：它不同于大部分主流文化，认为直接以幸福为目标实际上可能会让你痛苦。本书提供了另一条路线，它能避免你在情感上走弯路，指引你迈向丰富、充实和有意义的生活。-Happiness is the trap Luz- Harris, this is a well-known books: It is different most of the mainstream culture that directly happiness as the goal ma
getroutetxt
- 显示路由表的程序. Iphlpapi.lib-show route table. Iphlpapi.lib
rip-and-rsdf-report-summary
- the summarize of the computer network experiment anbout RID and RSDF route realized
ma2014
- Against path optimization problem for wireless sensor network, this paper proposes a path optimization strategy for wireless sensor network based on improved shuffled frog leaping algorithm. The shuffled frog leaping algorithm was used as wireles
FESHER
- Energy consumption is prominent and critical issue faced by wireless sensor networks. The maximum amount of energy is consumed when the sensors communicate with each other. Therefore energy efficient routing mechanisms are required. In this paper
Closer-Destination-Selection-Scheme-for-Mobile.ra
- In wireless sensor networks (WSNs), the benefits of exploiting the sink mobility to prolong network lifetime have been well recognized. In physical environments, all kinds of obstacles could exit in the sensing field. Therefore, a research challeng
Cluster-Based-Routing-for-the-Mobile-Sink-in
- In wireless sensor networks (WSNs), the bene ts of exploiting the sink mobility to prolong network lifetime have been well recognized. In physical environments, all kinds of obstacles could exit in the sensing field. Therefore, a research challenge i
route-algorithm-fpga-imp
- 详细介绍硬件路由设计算法及FPGA的实现方法-Detailed introduce routing algorithm and FPGA implementation method
Traveling-Salesman-Problem---Nearest-Neighbor
- Nearest Neighbour algorithm for a TSP with 7 cities. The solution changes as the starting point is changed The nearest neighbour (NN) algorithm (a greedy algorithm) lets the salesperson choose the nearest unvisited city as his next move. This algor