代码搜索:预置数

找到约 10,000 项符合「预置数」的源代码

代码结果 10,000
www.eeworm.com/read/185058/9059074

cpp insertsort.cpp

#include #include //其中定义随机数函数 void output(int table[],int n) //输出数组的n个元素 { cout
www.eeworm.com/read/183249/9174423

h globe.h

#define MAXCHANNEL 8 //最大语音通道数 #define ANY_DIG "1234567890#*" //任意按键 #define MaxCallerLen 15 //最大主叫长 #define MaxCalledLen 13 //最大被号长 #define MSGLENGTH MaxCalledLen //最大服务信息号长 #de
www.eeworm.com/read/182678/9195759

cpp p4-197.cpp

#include #include #include using namespace std; //返回一个Fibonacci数,其由generate_n()算法调用 int Fibonacci1(void) { static int r; static int f1 = 0; sta
www.eeworm.com/read/377514/9273616

m adapt_filter_arithmetic.m

t=500; %----设置迭代步数---- mu=0.1; %----设置步长---- nvar=0.01; noise=nvar*randn(1,t); %----设置噪声---- n=11; B=[0.3 0.9 0.3]; A=[1 0 0]; for k=1:t if rand>0.5 signal(k)=-1; else
www.eeworm.com/read/377494/9274474

m abspackedheight.m

function AbsPackedHeight % Gas Absorption in Packed Towers % 计算填料吸收塔的总传质单元数NOG % % 采用自适应Lobatto求积(Adaptive Lobatto quadrature)函数quadl()进行数值积分 % % Author: HUANG Huajiang % Copyright 2003 UN
www.eeworm.com/read/180877/9282172

cpp p4-197.cpp

#include #include #include using namespace std; //返回一个Fibonacci数,其由generate_n()算法调用 int Fibonacci1(void) { static int r; static int f1 = 0; sta
www.eeworm.com/read/180499/9304262

m yj8.m

%定义遗传算法参数 Dim=20; %变量维数 NIND=20; %个体数目(Number of individuals) Preci=20; %变量的二进制位数(Precision of variables) MAXGEN=100; %最大遗传代数(Maximum number of ge
www.eeworm.com/read/180499/9304270

m yj2.m

%定义遗传算法参数 NIND=40; %个体数目(Numbe of individuals) MAXGEN=500; %最大遗传代数(Maximum number of generations) NVAR=20; %变量的维数 PRECI=20; %变量的二进制位数(Precision
www.eeworm.com/read/376425/9317689

m abspackedheight.m

function AbsPackedHeight % Gas Absorption in Packed Towers % 计算填料吸收塔的总传质单元数NOG % % 采用自适应Lobatto求积(Adaptive Lobatto quadrature)函数quadl()进行数值积分 % % Author: HUANG Huajiang % Copyright 2003 UN
www.eeworm.com/read/179957/9326356

cpp p4-197.cpp

#include #include #include using namespace std; //返回一个Fibonacci数,其由generate_n()算法调用 int Fibonacci1(void) { static int r; static int f1 = 0; sta