-
深度优先搜索算法解决八码难题
深度优先搜索算法解决八码难题-depth-first search algorithm to solve eight problems yards
- 2023-02-02 23:10:03下载
- 积分：1
-
找到2d_maxima
这个项目包含了CPP解决了2D-maxima的问题，你可以输入一个数组，这意味着一个SERIS离散点，一发现日最高点的2-D合作。 OFEN使用的agorithems是蛮力和分块，agorithem使用快速排序，从而让即将举办的x坐标点，用途比较y中两neiborhood点从位置后方前面。和agorithem的时间compexity是n日志（n）的。
- 2022-08-10 14:28:22下载
- 积分：1
-
巫魔问题求解，只是一个简单的框架，仅仅有一个很简单的算法...
巫魔问题求解，只是一个简单的框架，仅仅有一个很简单的算法-Wumpus problem solving
- 2022-04-10 08:53:37下载
- 积分：1
-
A Reader Anti-collision Protocol for RFID-Enhanced Wireless Sensor Networks
资源描述Abstract Considering rapid developments in the technologies of both radio-frequency identification
(RFID) systems and wireless sensor networks (WSN), an integration of the two
technologies may lead to the formation of an RFID-enhanced WSN which would possess
improved functions and capabilities. In the RFID-enhanced WSN, many reader-enhanced
nodes have increasingly been employed. In such networks, RFID data contains a lot of duplication,
because the same tag may be read multiple times, and collision may occur among
readers, while energy constraints are also a serious problem. These three could in turn cause
serious problems. In this paper, we have proposed our CSMA-based algorithm since it is light,
efficiently minimizes all kinds of reader collision, and eliminates the duplicate data. For this
purpose, we have used a separate control channel and a tag ID forwarding mechanism with a
special co
- 2023-05-06 18:20:03下载
- 积分：1
-
任意精度的数学库
任意精度的数学库 - Free precision mathematics storehouse
- 2022-01-26 03:10:09下载
- 积分：1
-
Hanoi非递归源码
Hanoi非递归源码-Hanoi non- recursive FOSS
- 2022-03-14 21:25:26下载
- 积分：1
-
矩阵类，可实现矩阵的各种运算，包括加减乘除、求逆等。
矩阵类，可实现矩阵的各种运算，包括加减乘除、求逆等。-Matrices can realize a variety of matrix operations, including multiplication and division addition and subtraction, inversion and so on.
- 2022-04-17 02:54:14下载
- 积分：1
-
Matlab routines
matlab 例程-Matlab routines
- 2022-03-01 18:56:43下载
- 积分：1
-
code to solve 8-queens problem
- 2022-03-18 08:23:55下载
- 积分：1
-
最短路径
Description 求出有n(1 < n < 600)个结点有向图中，结点1到结点n的最短路径。 Input 第一行有2个整数n和m(0 < m
- 2022-07-25 07:53:30下载
- 积分：1
