-
用蒙特卡洛方法,求解出y=cos(x)/x在给定区间上的定积分值。
用蒙特卡洛方法,求解出y=cos(x)/x在给定区间上的定积分值。-By Monte Carlo method, the y = cos (x)/x in a given interval on the value of the definite integral.
- 2023-08-19 04:35:03下载
- 积分:1
-
《VC++ 常用数值算法》代码,包含众多常用算法,值得学习参考!...
《VC++ 常用数值算法》代码,包含众多常用算法,值得学习参考!-"VC numerical algorithm commonly used" code contains many commonly used algorithms, it is worth studying reference!
- 2022-01-23 11:04:10下载
- 积分:1
-
Labview编写的中值滤波程序,可用数据数字处理。
Labview编写的中值滤波程序,可用数据数字处理。-Written in Labview median filter process, available data digital processing.
- 2022-05-23 03:51:04下载
- 积分:1
-
这是一个图论Gomory-Hu算法!!!
This is a Gomory Hu algorithm-This is a Gomory Hu algorithm!!!
- 2022-03-14 12:08:08下载
- 积分:1
-
发现部分的总和
它是简单的源代码部分总和的计算解释。
(o (n),O(1)),在那里O (n)-准备,O (1)-计算结果
- 2022-08-25 08:12:33下载
- 积分:1
-
反编译工具
可以反编译 .network 之类的源文件 dll,打开解压 之后,把索要反编译的dll文件拖到里面就可以看到编译后的结果咯,效果还不错啊,可以试试,基本上跟源代码一样啊。。。。。。。。。
- 2023-03-09 11:45:03下载
- 积分:1
-
Modified Gram-Schmidt
Modified Gram-Schmidt (MGS)正交化法是利用已有正交基计算新的正交基。既能选择相关特征,又能排出已选特征对后续特征选择的影响。
- 2023-08-31 15:10:03下载
- 积分:1
-
敏感词wordbank
package com.yaozhou.sensitive.wordbank;import java.io.BufferedInputStream;import java.io.BufferedReader;import java.io.File;import java.io.FileInputStream;import java.io.FileNotFoundException;import java.io.IOException;import java.io.InputStream;import java.io.InputStreamReader;import java.util.ArrayList;import java.util.HashMap;import java.util.HashSet;import java.util.LinkedList;import java.util.List;import java.util.Map;import java.util.Properties;import java.util.Set;/** * @author Yao.Zhou* @version 创建时间:2016年12月21日 上午11:08:23 * 类说明 */@SuppressWarnings("unused")public class SensitiveWordBank {private static final String ENCODE = "UTF-8";private File path;private Map wordBankContainer;public SensitiveWordBank(String dir) {
- 2022-01-26 05:07:53下载
- 积分:1
-
the Capacitated Vehicle Routing Problem
The CVRP is a hard combinatorial optimisation problem. The scenario is that a set of depots contains goods to be delivered to customers by a fleet of trucks. Each customer wants a certain integer amount of goods called their demand and each truck can only carry a certain amount called its capacity. All trucks have the same capacity. The objective is to find a set of routes, one for each truck, which minimises the total distance travelled by all trucks (the 请点击左侧文件开始预览 !预览只提供20%的代码片段,完整代码需下载后查看 加载中 侵权举报
- 2022-06-15 10:54:51下载
- 积分:1
-
时域信号转换为频域信号的几个例子,本人都用过的,绝对能运行...
时域信号转换为频域信号的几个例子,本人都用过的,绝对能运行-Time-domain signal is converted to frequency domain signal a few examples, I have been used, absolutely can run
- 2023-05-04 14:45:03下载
- 积分:1