-
用于协议状态机的编程参考,可以用于协议设计。
用于协议状态机的编程参考,可以用于协议设计。-agreement for the state machine programming reference design can be used in the agreement.
- 2022-12-23 22:50:03下载
- 积分:1
-
24小时打铃控制器,定点报时。而且报时采用的声音信号频率不同。便于区分。...
24小时打铃控制器,定点报时。而且报时采用的声音信号频率不同。便于区分。-24-hour bell beat controller
- 2022-09-25 17:10:03下载
- 积分:1
-
自己做的小东西,传上来和大家分享一下,谢谢大家!
自己做的小东西,传上来和大家分享一下,谢谢大家!-xiaodong,zijizuode
- 2022-01-26 17:49:42下载
- 积分:1
-
该程序实现了一个简单的运动目标识别程序,这是主程序文件
该程序实现了一个简单的运动目标识别程序,这是主程序文件-the program a simple moving target identification procedures, this document is the main program
- 2022-03-11 13:44:56下载
- 积分:1
-
布线问题(应用中的分支定界算法)
布线问题(分支限界算法应用)-Wiring problems (branch and bound algorithm for the application)
- 2022-08-12 11:45:56下载
- 积分:1
-
汇编下的环境建立和的运行,调用汇编,和汇编调用程序
汇编下的环境建立和的运行,调用汇编,和汇编调用程序-Compilation of environmental establishment and operation, call the compilation, and compile the procedure call
- 2022-03-24 19:52:51下载
- 积分:1
-
MOCA方案介绍,moca为当前使用比较多的EOC解决方案,供大家参考!...
MOCA方案介绍,moca为当前使用比较多的EOC解决方案,供大家参考!-MOCA program introduction, moca for the current use of a relatively large number of EOC solution, for your reference!
- 2022-03-07 10:30:31下载
- 积分:1
-
统计学习理论及应用课堂讲稿
统计学习理论及应用课堂讲稿-来自麻省理工学院得好资料~-Statistical learning theory and application of classroom lectures- good information from the Massachusetts Institute of Technology ~
- 2023-06-22 23:25:04下载
- 积分:1
-
Find prime numbers prepared by screening the function: void sieve (bool isPrime...
编写筛选查找素数函数:
void sieve(bool isPrime[], int n)
其中isPrime[ ]为一个布尔型数组,n为数组大小。由于2是第一个素数,
所以设置isPrime[0]和isPrime[1]的值为false,并设置其余的元素初值为true。
然后对从4到n-1的每一个i,判断i是否能够被2整除,如果i能够被2整除,则设置isPrime[i]为false。
对从2到n/2的每一个可能的数值重复以上处理,当操作结束时,所有值为true的isPrime[i]所对应的i就是素数,它们将是从筛子中掉下来的。-Find prime numbers prepared by screening the function: void sieve (bool isPrime [], int n) which isPrime [] as a Boolean array, n is the size of the array. Because 2 is the first prime number, so set the isPrime [0], and isPrime [1] a value of false, and set the initial value of the remaining elements of true. And then from 4 to n-1 for each i, to determine whether i can be divisible by 2, if i can be divisible by 2, then set the isPrime [i] is false. From 2 to n/2 possible values for each one to repeat the above processing, when the operation ended, all the true value of the isPrime [i] corresponding to i is a prime number, they will be falling from the sieve in the past.
- 2023-03-02 04:45:03下载
- 积分:1
-
软件用来观测和比较源yuv视频序列,可同时打开36段视频
软件用来观测和比较源yuv视频序列,可同时打开36段视频-Software used for observation and comparison of source yuv video sequence can be opened at the same time 36 video
- 2022-03-20 01:27:37下载
- 积分:1