-
Beamforming algorithm in MATLAB to achieve under the
波束形成算法在MATLAB下的实现源代码
-Beamforming algorithm in MATLAB to achieve under the
- 2023-01-25 15:05:03下载
- 积分:1
-
经典小游戏源代码
用vc++实现的
欢迎使用
经典小游戏源代码
用vc++实现的
欢迎使用-small game classic source code used to achieve vc welcome to use!
- 2022-09-18 13:00:03下载
- 积分:1
-
Astro3.zip
重载==运算的例子
Asycls11.zip
异步处理类, C++代码
addzip06.zip
在程序开发...
Astro3.zip
重载==运算的例子
Asycls11.zip
异步处理类, C++代码
addzip06.zip
在程序开发中使用文件压缩技术
addresschange.zip
这是一个用来改变ip地址和硬件地址的小程序
a10_src.zip
DirectDraw游戏编程的最佳入门范例
aComressEX.zip
用了三种比较简单的压缩算法。-Astro3.zip Heavy == operator example Asycls11.zip asynchronous class and the C code addzip06.zip developers use compression technology addresschange.zip This is a change for ip address and the hardware addresses of small programs a10_src.zip DirectDraw game programming the best example aComressEX.zip entry with three relatively simple compression algorithm.
- 2022-04-22 16:46:13下载
- 积分:1
-
FFT程序用C语言编写的程序,方法,这是一个信号…
该程序用C语言编写了DFT、FFT程序,该程序是信号运用的基本程序-The program was prepared with the C language DFT, FFT program, which is a signal to use the basic procedures for
- 2022-08-03 14:46:46下载
- 积分:1
-
ε-贪婪的行动选择
epsilon greedy action selec
- 2022-01-27 21:20:19下载
- 积分:1
-
squid
squid-2.4 for linux7.2
- 2022-01-31 10:16:39下载
- 积分:1
-
one very simple game of pool, use the direction keys to control plate at about m...
一款非常简单的撞球游戏,使用方向键控制板块左右弹动小球即可得分。-one very simple game of pool, use the direction keys to control plate at about moving the ball can score.
- 2022-02-06 10:27:34下载
- 积分:1
-
VC is a beautiful MM prepared the jigsaw puzzle, top fun, and I hope everyone li...
是一个VC编写的漂亮MM的拼图游戏,顶好玩的,希望大家喜欢-VC is a beautiful MM prepared the jigsaw puzzle, top fun, and I hope everyone likes
- 2022-02-25 05:48:10下载
- 积分:1
-
程序描述:这个程序利用89S51连接DAC0800,然后通过Timer0
的控制不停地送出三角波 */...
程序描述:这个程序利用89S51连接DAC0800,然后通过Timer0
的控制不停地送出三角波 */-Description: 89S51 use this procedure to connect DAC0800, and then through the Timer0 kept out of the control triangle wave* /
- 2022-01-21 06:04:51下载
- 积分:1
-
本算法使用分治法求解最近点对问题。事先用O(nlogn)时间对x坐标进行排序,使得所有的点是按x坐标从小到大排好序的(x坐标相同时y坐标小的排前),然后取下标小...
本算法使用分治法求解最近点对问题。事先用O(nlogn)时间对x坐标进行排序,使得所有的点是按x坐标从小到大排好序的(x坐标相同时y坐标小的排前),然后取下标小于n/2属于左边的点集PL,取下标大于n/2属于右边的点集PR,即用O(1)时间就可以将规模为n的问题分解为两个规模为n/2的、同类型的子问题。分割完毕之后就可以采用分治法,分别求出PL和PR中的最近点对,最终通过递归实现。-This algorithm uses divide and conquer to solve the problem closest point. Prior to use O (nlogn) time to sort the x coordinate so that all points are based on x coordinates from small to large sorted (x coordinates with the same y coordinates of the small, the top), and then remove the standard is less than n/2 the set of points belonging to the left PL, remove the standard is greater than n/2 set of points belonging to the right of PR, that is to use O (1) time can be the problem size n divided into two size n/2, the same type The sub-problems. Segmentation can be used after completion of sub-rule method, respectively, find the PL and PR in the last points and eventually through the recursion.
- 2022-01-25 16:01:13下载
- 积分:1