Search - max - CodeBus

Search - max - List

[OS program] Dynamic_Array DL : 0: 动态数组实现, 包括了一个小例子.关键结构如下: typedef struct Nameval Nameval struct Nameval{ char *name int value } struct NVtab{ int nval /* current number of values */ int max /* allocated number of values */ Nameval *nameval /* array of name-value pairs */ }nvtab enum {NVINIT = 1, NVCROW = 2} -achieve dynamic array, including one small example. The key is structured as follows : typedef struct Nameval Nameval struct Nameval (char * name) int value struct (int NVtab nval / * current number of values * / int max / * allocated number of values * / Nameval nameval * / * array of name-value pairs * /) (NVINIT nvtab enum = 1, NVCROW = 2)
Date : 2008-10-13 Size : 4.01kb User : 洋场河
[OS program] get_host_netcard_info DL : 0: Visual studio.net，可以获得主机网卡的基本信息，MAX地址,IP地址，网关.-Visual studio.net, may obtain the main engine net card the basic information, the MAX address, the IP address, the gateway
Date : 2008-10-13 Size : 107.68kb User : 林林
[OS program] 2345 DL : 0: 算法介绍: **数据结构: 1.可利用资源向量Available 2.最大需求矩阵Max 3.分配矩阵Allocation 4.需求矩阵Need **功能介绍: 模拟实现Dijkstra的银行家算法以避免死锁的出现.分两部分组成: 第一部分:银行家算法(扫描) 1．如果Request<=Need,则转向2 否则,出错 2．如果Request<=Available,则转向3,否则等待 3．系统试探分配请求的资源给进程 4．系统执行安全性算法第二部分:安全性算法 1.设置两个向量 (1).工作向量:Work=Available(表示系统可提供给进程继续运行所需要的各类资源数目) (2).Finish:表示系统是否有足够资源分配给进程(True:有 False:没有).初始化为False 2.若Finish[i]=False&&Need<=Work,则执行3 否则执行4(I为资源类别) 3.进程P获得第i类资源,则顺利执行直至完成!并释放资源: Work=Work+Allocation Finish[i]=true 转2 4. 若所有进程的Finish[i]=true,则表示系统安全否则,不安全!
Date : 2008-10-13 Size : 1.69kb User : wang shao hua
[OS program] Dynamic_Array DL : 1: 动态数组实现, 包括了一个小例子.关键结构如下: typedef struct Nameval Nameval struct Nameval{ char *name int value } struct NVtab{ int nval /* current number of values */ int max /* allocated number of values */ Nameval *nameval /* array of name-value pairs */ }nvtab enum {NVINIT = 1, NVCROW = 2} -achieve dynamic array, including one small example. The key is structured as follows : typedef struct Nameval Nameval struct Nameval (char* name) int value struct (int NVtab nval/* current number of values*/int max/* allocated number of values*/Nameval nameval*/* array of name-value pairs* /) (NVINIT nvtab enum = 1, NVCROW = 2)
Date : 2025-12-28 Size : 4kb User : 洋场河
[OS program] 2345 DL : 0: 算法介绍: **数据结构: 1.可利用资源向量Available 2.最大需求矩阵Max 3.分配矩阵Allocation 4.需求矩阵Need **功能介绍: 模拟实现Dijkstra的银行家算法以避免死锁的出现.分两部分组成: 第一部分:银行家算法(扫描) 1．如果Request<=Need,则转向2 否则,出错 2．如果Request<=Available,则转向3,否则等待 3．系统试探分配请求的资源给进程 4．系统执行安全性算法第二部分:安全性算法 1.设置两个向量 (1).工作向量:Work=Available(表示系统可提供给进程继续运行所需要的各类资源数目) (2).Finish:表示系统是否有足够资源分配给进程(True:有 False:没有).初始化为False 2.若Finish[i]=False&&Need<=Work,则执行3 否则执行4(I为资源类别) 3.进程P获得第i类资源,则顺利执行直至完成!并释放资源: Work=Work+Allocation Finish[i]=true 转2 4. 若所有进程的Finish[i]=true,则表示系统安全否则,不安全! -err
Date : 2025-12-28 Size : 1kb User : wang shao hua
[OS program] mrmr-ftest DL : 0: This a code for feature selection. Which combines minimum redundency and max relevance and Ftest. Originally it is written for gene selection but can be used for any kind of feature selection.-This is a code for feature selection. Which combines minimum redundency and max relevance and Ftest. Originally it is written for gene selection but can be used for any kind of feature selection.
Date : 2025-12-28 Size : 2kb User : vida
[OS program] 1 DL : 0: 从内存BLOCK开始，存放着256个字节的带符号数。编写程序，找出绝对值最大的数，将其存入MAX中-BLOCK starting from memory, placing a 256-byte signed number. Write a program to identify the largest absolute number of its deposit MAX
Date : 2025-12-28 Size : 1kb User : 郭长青
[OS program] wimax1 DL : 0: more information about Wi Max
Date : 2025-12-28 Size : 966kb User : aman
[OS program] simplex DL : 0: 此程序运用单纯形法计算目标函数为max型，约束条件全为小于等于型的线性规划问题，求解得到正确的结果。-This program uses the simplex method to calculate the objective function as max-type constraints are all less than or equal to the type of linear programming problem solving to get the correct results.
Date : 2025-12-28 Size : 2kb User : 萌萌
[OS program] max DL : 0: 这个文件是破解马克斯不能再360浏览器播放的插件。-This file is no longer 360 crack Marx play browser plug-ins.
Date : 2025-12-28 Size : 9kb User : 罗伟
[OS program] generic-algorithm DL : 0: 本程序试用遗传算法来解决Rosenbrock函数全局最大值计算问题-solve the max problem of Rosenbrock function
Date : 2025-12-28 Size : 2kb User : 张小平
[OS program] Project DL : 0: this is a good project to get min and max in c++ so this is a matrix
Date : 2025-12-28 Size : 1kb User : alireza
[OS program] Max-flow DL : 0: 在这个函数的编制中存在一个细节，当任取一个已标号未检查的点的时候，我取的最靠前的点。如果加进随机选取的语句，每次运行程序可能会出现不同的最大流结果。-There is a detail in the preparation of this function, and when I take a point that has not been checked, I take the closest point. If you add a randomly selected statement, you may run a different maximum flow result each time you run the program.
Date : 2025-12-28 Size : 1kb User : 223