-
8 皇后问题python解决
8 皇后问题在 python 中
八皇后益智是的放置八个问题象棋 请点击左侧文件开始预览 ！预览只提供20%的代码片段，完整代码需下载后查看 加载中 侵权举报
- 2023-03-16 10:00:04下载
- 积分：1
-
C#编写的随机数发生器
该代码用了三种不同的算法生成你想要的随机数序列个数，包括乘同余方法、乘同余组合发生器；其中的参数是在蒙特卡罗方法在实验核物理这本书中以及“蒙特卡洛方法中随机数发生器和随机抽样方法的研究.金畅"这篇文献中找到的。本人实验多次，经检测两种方法生成的随机数的均匀性符合要求，且用此随机数进行已知分布的抽样也能达到要求。
- 2023-03-26 16:00:02下载
- 积分：1
-
modbus协议crc校验计算工具
modbus协议crc校验计算工具安装labview2012基数一般用默认值，不用修改填写数值，就可以得到结果数值和结果都是16进制的结果要高低字节需要自己调整
- 2022-07-02 15:43:59下载
- 积分：1
-
捕鱼达人的C++代码
这个是在校期间的一份代码，主要是是实现捕鱼达人的功能，主要的技术是通过使用cocos2d来实现代码，还有就是采用的是c++的代码编写的，实现了捕鱼达人的基本功能，有实现鱼的游动，获得金币等功能。
- 2022-11-05 13:00:20下载
- 积分：1
-
oh. Very cattle, most people do not give him
线形的哦。很牛的，一般人不给他-oh. Very cattle, most people do not give him
- 2023-07-24 00:15:02下载
- 积分：1
-
Pilot Contamination Reduction
应用背景This paper considers the problem of interference mitigation in multi-cell multi-antenna time division duplex (TDD) wireless systems for downlink transmission. An efficient way to obtain channel state information (CSI) at the base station is by using uplink pilots and reciprocity of the downlink channel.
At the same time, it has been shown that pilots from different cells contaminate each other, resulting in corruption of precoding matrices used by base stations, and high inter-cell interference. This paper studies the effects of shifting the location of pilots in time frames used in neighboring cells, and its effectiveness in obtaining better channel estimates, and, thereby, inter-cell
interference reduction.关键技术Wireless cellular network designs with multiple antennas have been adopted by several modern wireless systems, which aim for high throughput as well as high
- 2023-07-07 06:45:03下载
- 积分：1
-
simhash算法实现
应用背景
利用ansj simhash进行分词和去重
关键技术ansj分词使用非常方便，只需要下载相应的jar包就可以，simhash能够快速去重。
- 2022-03-12 13:58:05下载
- 积分：1
-
解决微分方程组/代数方程组Fortran算法
解决微分方程组/代数方程组Fortran算法-This code solves a system of differential/algebraic equations of the form G(T,Y,YPRIME) = 0.
- 2022-05-15 04:45:22下载
- 积分：1
-
0 / 1背包问题是一个N P
0 / 1背包问题是一个N P-复杂问题，为了解决该问题，，将用回溯算法解决该问题。既然想选择一个对象的子集，将它们装入背包，以便获得的收益最大，则解空间应组织成子集树的形状（如图1 6 - 2所示）。该回溯算法与4 . 2节的装载问题很类似。首先形成一个递归算法，去找到可获得的最大收益。然后，对该算法加以改进，形成代码。改进后的代码可找到获得最大收益时包含在背包中的对象的集合。-0/1 knapsack problem is a P-complex issues, in order to solve the problem, and will be used backtracking algorithm to solve the problem. As to the choice of a subset of object, they will load a backpack, in order to obtain the greatest profits, the solution should be organized into space subset of the shape of the tree (Figure 1 6-2 below). The backtracking algorithms and 4. Two loading problem is very similar. Forming a recursive algorithm to get the maximum benefit available. Then, this algorithm is modified to form code. Improved code can be found at the maximum benefits included in the backpack of a collection of objects.
- 2022-02-26 09:06:08下载
- 积分：1
-
电磁波传播
以麦克斯韦电磁场与电磁波的旋度方程组为理论支持，通过编程来实现电磁波场传播的模拟研究。
- 2022-08-21 15:56:10下载
- 积分：1
