代码搜索:Num

找到约 10,000 项符合「Num」的源代码

代码结果 10,000
www.eeworm.com/read/292008/8383301

java multithread.java

package lab2; public class MultiThread extends Thread { private Matrix matrix = null; int num1,num2; int start,end; MultiThread(int n1,int n2,Matrix m) { super(); num1 = n1; num
www.eeworm.com/read/192305/8388373

m exa120501.m

%-------------------------------------------------------------------------- % exa120501.m, for example 12.5.1 and fig12.5.3 %-----------------------------------------------------------------------
www.eeworm.com/read/192305/8388534

m exa120502.m

%-------------------------------------------------------------------------- % exa120502.m, for example 12.5.2 and fig12.5.4 %-----------------------------------------------------------------------
www.eeworm.com/read/291639/8406362

h drv.h

/* leddrv.h - the header file with the ioctl definitions. * * The declarations here have to be in a header file, because * they need to be known both to the kernel module * (in leddrv.c) a
www.eeworm.com/read/291639/8406406

h eintdrv.h

/* timerdrv.h - the header file with the ioctl definitions. * * The declarations here have to be in a header file, because * they need to be known both to the kernel module * (in leddrv.c)
www.eeworm.com/read/291636/8406611

m myga.m

function [f,x]=myga(num,bounds,N,CP,P) %[f,x]=ga(num,bounds,fun,N,CP,P) %[f,x]=myga([],bounds,[],[],[]) %该遗传算法适用于: % 目标函数为求最大值,且解非负整数解 %bounds 边界约束 %Myfun 为目标函数 %num
www.eeworm.com/read/291636/8406660

m myga.m

function [f,x]=myga(num,bounds,N,CP,P) %[f,x]=ga(num,bounds,fun,N,CP,P) %[f,x]=myga([],bounds,[],[],[]) %该遗传算法适用于: % 目标函数为求最大值,且解非负整数解 %bounds 边界约束 %Myfun 为目标函数 %num
www.eeworm.com/read/291577/8408640

java gameworld.java

package bluetoochgame; import javax.microedition.lcdui.*; /** * Title: * Description: * Copyright: Copyright (c) 2005 * Company: * @author not attributab
www.eeworm.com/read/291471/8416863

cpp huffman.cpp

#include "stdio.h" #include "stdlib.h" #include "string.h" typedef struct{ double weight; int parent,lchild,rchild; }HTnode,*HTree; void InitData(); void select(HTree HT, int len, int* index
www.eeworm.com/read/191902/8417041

txt classification.txt

Ada_Boost@Num iter, type, params:@[100,'Stumps',100]@L Backpropagation_Batch@Nh, Theta, Convergence rate:@[5, 0.1, 0.1]@L Backpropagation_CGD@Nh, Theta:@[5, 0.1]@L Backpropagation_Quickprop@Nh, The