-
GEP（函数发现等）
基于遗传算法的基因编程表达式，在函数发现这方面具有较好的表现。用C#实现，在做参数优化的时候用上GEP会取得更好的效果。
不同于GA，不会出现过早收敛
- 2022-01-31 12:28:25下载
- 积分：1
-
JPEG解码
JPEG的解压算法，可以帮助初学者明确了解JPEG格式信息，对照代码可以明白数据标识码在那边表示，也可以修改他们做出相应调整。对于刚接触JPEG格式的人来说是有用的。
- 2022-04-11 10:46:23下载
- 积分：1
-
复数(Complex Number)的四则运算
复数(Complex Number)的四则运算-Complex (Complex Number) 4 Operators
- 2022-01-25 22:40:20下载
- 积分：1
-
清华大学数学实验之线性方程组的数值求解幻灯片与MAT源码
清华大学数学实验之线性方程组的数值求解幻灯片与MAT源码-Tsinghua University, Experimental Math linear equations of the numerical solution of the slide with the MAT-source
- 2022-07-05 05:29:21下载
- 积分：1
-
unwraping image 2d
该代码基于matlab四方向图像展开算法。有些代码可能会请求python版本来实现一个图像处理，但需要这个版本。
- 2022-03-23 19:50:12下载
- 积分：1
-
GPS绝对单点定位
运用cos站接收的GPS数据解算出卫星的坐标，这是GPS定位的基础，只有知道卫星坐标才能通过卫星坐标后方交汇求出地面控制点的坐标
- 2023-06-23 04:55:03下载
- 积分：1
-
CRC
CRC-16校验源程序及算法分析-CRC-16 checksum algorithm analysis and source
- 2022-01-26 03:51:24下载
- 积分：1
-
交通仿真（排队论）小程序
This is the project of my course in the USA:
Customers
arrive at a service station (with a single server) according to the Poisson
process with a mean arrival rate of lambda = 0.3 (customers/min). Each customer
waits in queue (if present), proceeds to receive service upon his/her turn, and
departs the system when the service is completed. The service time is uniformly
distributed between 2.5 and 4.5 minutes. On each day, the service station is
open for two hours. Any customers in queue at the end of work hours are served
before closing the service station for the day. Use simulation (do 100
simulation runs) to determine
- 2023-02-02 14:55:04下载
- 积分：1
-
with C++ Builder bankers algorithm can process arbitrary importation of all type...
用C＋＋Builder实现的银行家算法可以任意 输入进程个数各类资源的个数输出安全序列-with C++ Builder bankers algorithm can process arbitrary importation of all types of resources the number of security Sequence Number output
- 2022-07-08 07:47:37下载
- 积分：1
-
Given a set A [1 ... n], and one from A to its own mapping f, to find the larges...
给定一集合A[1...n]和一个从A 到其自身的映射f,寻找元素个数最多的一个子集S属于A，并使得S 满足：
1．f 把S 映射到自身；
2．S 中没有两个元素映射到相同的元素。-Given a set A [1 ... n], and one from A to its own mapping f, to find the largest number of elements in a subset of S belongs to A, and makes the S satisfy: 1. f to S is mapped to itself 2. No two elements of S mapped to the same element.
- 2022-12-19 23:40:03下载
- 积分：1
|
联系客服（QQ：3324461878）
