-
process scheduling algorithm, the first adaptation, optimal adaptation algorithm...
进程调度算法，有首次适应，最优适应算法，最差适应算法-process scheduling algorithm, the first adaptation, optimal adaptation algorithm, the worst adaptation algorithm
- 2022-01-25 15:21:41下载
- 积分：1
-
dreamweaver插件3
dreamweaver插件3-Dreamweaver plug-3
- 2022-03-12 22:13:23下载
- 积分：1
-
This document describes the Windows, a hotkey, skillfully use them can bring to...
本文件介绍了Windows中的热键，熟练使用它们可以为我们带来极大的方便。-This document describes the Windows, a hotkey, skillfully use them can bring to us great convenience.
- 2022-04-02 05:39:00下载
- 积分：1
-
UNIX平台下使用C语言实现的检查主机hostID的函数，可用于程序的加密。...
UNIX平台下使用C语言实现的检查主机hostID的函数，可用于程序的加密。-UNIX platform using C language mainframe hostID inspection functions can be used to process the encryption.
- 2022-04-28 14:58:49下载
- 积分：1
-
Checkstyle can find : can not be used or surplus enter a space better place with...
Checkstyle 可寻找：・不能使用的或者多余的输入 ・空格更好的地方不使用跳格符，反之亦然 ・不遵循命名标准的变量、方法或者类 ・过分复杂的分配或者返回语句。它还有Eclipse下的插件。
-Checkstyle can find : can not be used or surplus enter a space better place without using jump Lattice website. named vice versa do not abide by the standards of variables, methods or category over-complicated distribution or return statement. It also has the Eclipse plugin.
- 2022-03-25 02:05:45下载
- 积分：1
-
运行时需要更改文件地址，一定要注意，否则运行不了
运行时需要更改文件地址，一定要注意，否则运行不了-running document addresses the need to change, we must pay attention, otherwise not running
- 2023-03-31 19:30:04下载
- 积分：1
-
蚁群算法的原理以及实现，提及到蚁群算法的7个特点。（c++）...
蚁群算法的原理以及实现，提及到蚁群算法的7个特点。（c++）-The principle of ant colony algorithm and the realization of a reference to the seven characteristics of ant colony algorithm. (C++)
- 2023-02-22 17:40:04下载
- 积分：1
-
文学修养，余秋雨文集，写得很深长，写得沉重。苍桑
文学修养，余秋雨文集，写得很深长，写得沉重。苍桑-literary accomplishment Yu Works, written long deep, heavy write. Cangsang
- 2022-05-16 18:56:38下载
- 积分：1
-
3889 invasion of 3389 vulnerabilities WIN2 input method
3889 入侵 3389漏洞 输入法 WIN2-3889 invasion of 3389 vulnerabilities WIN2 input method
- 2022-02-28 09:08:36下载
- 积分：1
-
/ *我已经编译两次，第二次的改进。改进思路…
/*本人先后编了两次，第二次进行了改进。改进的思想主要是注意到棋盘上每一点的下一可到达点的个数
（下称为权值）不同，对于可到达点较少（权值小）的点应该先跳上去，这样后来跳的点可跳的方向就比
较多，回溯的现象就比较少，这样就可以大幅度提高速度*/-/* I have compiled twice, the second time for improvements. Improved thinking is that every point on the chessboard of the next point can be reached by the number (hereinafter referred to as the right value), For less accessible spots (small weights) should be the first point and jumped out of the way and then jump to the point of jumping on the direction of more, Looking back on the phenomenon of relatively small, we can significantly improve the speed* /
- 2022-03-20 16:40:03下载
- 积分：1
