Search - max - CodeBus

Search - max - List

[Algorithm] 数列极差 DL : 0: 在黑板上写了N个正整数作成的一个数列，进行如下操作：每一次擦去其中的两个数a和b，然后在数列中加入一个数a×b+1，如此下去直至黑板上剩下一个数，在所有按这种操作方式最后得到的数中，最大的max，最小的为min，则该数列的极差定义为M=max-min。
Date : 2009-05-25 Size : 746byte User : henryyu3721@sohu.com
[Algorithm] cyuanchengxu DL : 0: 函数模板T max(T a, T b, T c),使之实现对任何类型数，能从三个数中求出最大数返回。设计各种类型数据(char，short，long，float，double)调用此函数模板。-function template T max (T a, b T, T c), to enable it to achieve any of several types, a few were from the three sought to return to the greatest number. Design data types (char, short, long, float, double) calling this function template.
Date : 2025-12-28 Size : 3kb User : gongwen
[Algorithm] qiufeixianxingfangchengzuzuixiaoerchengjiedeguangy DL : 0: 1.功能利用广义逆求解无约束条件下的优化问题(C语言) 2.参数说明 int m : 非线性方程组中方程个数 int n : 非线性方程组中未知数个数 double eps1 : 控制最小二乘解的精度要求 double eps2 : 用于奇异值分解中的控制精度要求 double x[n] : 存放非线性方程组解的初始近似值X(0),要求各分量不全为0 int ka : Ka＝max{m,n}+1 void (*f)() : 指向计算非线性方程组中各方程左端函数值的函数名(用户自编) void (*s)() : 指向计算雅可比矩阵的函数名 int ngin() : 函数返回一个标志值 3.文件说明 ngin.c函数文件 ngin0.c主函数文件-1. Using generalized inverse function for non-binding under the conditions of optimization problems (C) 2. Parameter Description int m : nonlinear equation group number int n equation : nonlinear equations were unknown number of double eps1 : Least Squares Solutions of control precision double eps2 : for the singular value decomposition of the control precision double x [n] : Nonlinear storage solutions of equations initial approximation of X (0), the requirements for the component failure 0 int ka : Ka = max (m, n) a void (* f) () : Calculation of nonlinear equations at the Group of the equation extreme value of the function name (user self) void (* s) () : at the Jacobian matrix calculation of the function name ngin int () : function returns a value of three signs. This document explains
Date : 2025-12-28 Size : 2kb User : 罗坤
[Algorithm] chmmbox_1_2 DL : 0: CHMMBOX, version 1.2, Iead Rezek, Oxford University, Feb 2001 Matlab toolbox for max. aposteriori estimation of two chain Coupled Hidden Markov Models. -CHMMBOX, version 1.2, Iead Rezek, Oxford University, Feb 2001 Matlab toolbox for max. aposteriori es timation of two chain Coupled Hidden Markov Mod els.
Date : 2025-12-28 Size : 804kb User : Joyce
[Algorithm] FormulaProcessor_beta1_CSharp DL : 0: 功能说明：次组件提供的功能有二： 1、解析出数学表达式中的参数 2、计算数学表达式此组件不但可以解析和计算数学表达式，还提供了一系列的数学基本函数，可应用于表达式中一块处理。提供的数学基本函数有：将值舍入到最接近的整数 rount(x)、向下取整函数 int(x)、向上取整 ceiling(x)、求两个数中最大数的函数 max(a,b)、求两个数中最小数的函数 min(a,b)、幂函数 pow(x,n)、求平方根的函数 sqrt(x)。下载地址：http://www.qiusuo365.com/qiusuo365/viewthread.php?tid=2422&extra=page％3D1-Functional Description : sub-components provided by the two functions : one, to figure out the mathematical expression of two parameters. calculate mathematical expression of this component will not only analytical and computational mathematical expression, but also provided a series of basic math functions, expression can be applied to a handle. The basic function of mathematics : the value of rounding to the nearest integer rount (x), downward for the entire function int (x), up from the entire ceiling (x), 2 for the largest number of the number of function max (a, b), 2 for the smallest number of the number of function min (a, b), power function pow (x, n), for the square root function sqrt (x). Download Address : http :// www.qiusuo365.com/qiusuo365/viewthread . php tid = 24
Date : 2025-12-28 Size : 3kb User : jason
[Algorithm] Matching-2 DL : 0: //给定整数n，产生所有[2n]上的匹配（matching） //将其视为一个所有块大小均为2的集合分拆 //以a_i表示其第i个元素所在的集合号 //输出格式为 a1 a2 a3 ... //满足 //a_{i+1} <= max { a1,a2,...a_i } + 1 -//a given integer n, have all [2n] on the matching (matching)// will be considered as an all pieces are two sets of a split// a_i said in its i elements of a collection of lies// output format for a1 a2 a3 ...// meet// a_ i (a)
Date : 2025-12-28 Size : 1kb User : 侯庆虎
[Algorithm] PlayingCards DL : 0: /*有一定数量total的扑克牌,现在两个人甲乙用这些扑克牌玩一个游戏，两人轮流从扑克牌中为放回地拿出几张扑克牌，每次最多拿max张，怎样拿才能保证第一个拿牌的人获胜，本程序提供了一种方法,程序默认甲是第一个拿牌的人*/-/* There are a certain number of cards total, and now B with these two people playing a poker game, the two take turns playing cards from the back to come up with for a few playing cards, each holding up to max sheets, how to take in order to to ensure that the first person holding a license to win, this procedure provides a method, procedure A default is the first person holding a license* /
Date : 2025-12-28 Size : 1kb User : 龚小江
[Algorithm] Max-IntMax-MinMin-Min DL : 0: 极小算法（Min-Min）、极大极小算法(Max-Min)、最大时间跨度算法（Max-Int）三种典型的映射算法的算法原理以及计算程序-Minimal algorithm (Min-Min), max-min algorithm (Max-Min), maximum time-span algorithm (Max-Int) three typical mapping algorithm and the algorithm of the calculation program
Date : 2025-12-28 Size : 106kb User : fuhaijun
[Algorithm] No33 DL : 0: 本章将首先介绍怎样在算法设计领域应用这一古老的策略，然后将利用这一策略解决如下问题：最小最大问题、矩阵乘法、残缺棋盘、排序、选择和一个计算几何问题——找出二维空间中距离最近的两个点。 -This chapter will first introduce how the field of algorithm design in the application of this ancient strategy, and then will use this strategy to solve the following problem: min max problem, matrix multiplication, incomplete chessboard, sort, select, and a computational geometry problems- to identify two-dimensional space in the nearest two points.
Date : 2025-12-28 Size : 37kb User : 张波
[Algorithm] No44 DL : 0: 本章将首先介绍怎样在算法设计领域应用这一古老的策略，然后将利用这一策略解决如下问题：最小最大问题、矩阵乘法、残缺棋盘、排序、选择和一个计算几何问题——找出二维空间中距离最近的两个点。 -This chapter will first introduce how the field of algorithm design in the application of this ancient strategy, and then will use this strategy to solve the following problem: min max problem, matrix multiplication, incomplete chessboard, sort, select, and a computational geometry problems- to identify two-dimensional space in the nearest two points.
Date : 2025-12-28 Size : 29kb User : 张波
[Algorithm] pinv DL : 0: //奇异值分解法求广义逆 //本函数返回值小于0表示在奇异值分解过程, //中迭代值超过了60次还未满足精度要求. //返回值大于0表示正常返回。 //a-长度为m*n的数组，返回时其对角线依次给出奇异值，其余元素为0 //m-矩阵的行数 //n-矩阵的列数 //aa-长度为n*m的数组，返回式存放A的广义逆 //eps-精度要求 //u-长度为m*m的数组，返回时存放奇异值分解的左奇异量U //v-长度为n*n的数组，返回时存放奇异值分解的左奇异量V //ka-整型变量，其值为max(n,m)+1 //调用函数：dluav()-//Singular value decomposition method for generalized inverse// this function return value is less than 0 in the singular value decomposition process,// in the iterative value of more than 60 are unable to meet the precision requirement.// Return value greater than 0 indicated a normal return.// a-length m* n array, return its diagonal singular value is given followed by the remaining elements to 0// m-matrix rows// n-matrix the number of rows// aa-length n* m array, retrievable storage A generalized inverse// eps-precision// u-length m* m of the array, return deposited the left singular value decomposition singular quantity U// v-length of n* n of the array, return deposited the left singular value decomposition singular volume V// ka-integer variables, its value is max (n, m)+ 1// call the function: dluav ()
Date : 2025-12-28 Size : 3kb User : 钟钟
[Algorithm] genetic_algorithm DL : 0: 基于求函数f(x,y,z)=xyz*sin(xyz)最大值问题的演示程序-Based on the demand function f (x, y, z) = xyz* sin (xyz) max demo issues
Date : 2025-12-28 Size : 7.1mb User : lty
[Algorithm] WLS_MM DL : 1: 加权最小二乘法&最大最小化优化算法 weighted least-squares + weighted min-max optimization -Weighted least square method
Date : 2025-12-28 Size : 2kb User : okboy
[Algorithm] hw2.cpp DL : 0: 用算法构造Langrange插值多项式和 Newton多项式，分别取两组插值节点，并与精确值比较，得出误差。并按如下形式输出 N=5 Max Error of grid (1) : XXXXXXXXXXXXXXXXX Max Error of grid (2) : XXXXXXXXXXXXXXXXX -Algorithm structure with Langrange polynomial interpolation polynomial and Newton, respectively, were interpolated from the node, and accurate value comparison, the error. The following forms of output and N = 5 Max Error of grid (1): XXXXXXXXXXXXXXXXX Max Error of grid (2): XXXXXXXXXXXXXXXXX
Date : 2025-12-28 Size : 1kb User : 欢迎
[Algorithm] MAX-MINAntSystem DL : 0: MAX MIN Ant System -MAX MIN Ant System ......
Date : 2025-12-28 Size : 47kb User : gladiator
[Algorithm] BestFirstSearch_HeapAlgo DL : 0: 1. 此程式執行將從路徑讀取一個文字檔 ( 路徑：C:INPUT.TXT ) 2. 執行結束會產生一個排序後的文字檔 ( 路徑：C:OUTPUT.TXT ) 3. 給定的初始盤面一定有解本程式採用的演算法策略為Best-first search with branch-and-bound algorithm 1. 使用Max heap 實作Priority queue 2. 使用bound function 估計目前盤面走至答案最少需要幾步第一部分所謂 heap property (或稱 heap condition) 是指每個 node 內的資料比它左右兩側 child nodes 內的資料都小 (但左右兩 child nodes 之間並無一定的關係)。雖說 heap 在觀念上是一棵 complete binary tree, 實際上是存在一個陣列當中 root 存在 A[1], 接下來將 A[2] 與 A[3] 由左到右依序補滿第二層, 再將 A[4], A[5], A[6], A[7] 由左到右依序補滿第三層…。-1. This program is running from the path to read a text file (path: C: INPUT.TXT) 2. Implementation of the end will produce a sorted text file (path: C: OUTPUT.TXT) 3. Given the initial disk of at least one solution The program uses the algorithm strategy Best-first search with branch-and-bound algorithm 1. Using the Max heap implement Priority queue 2. Bound function is estimated using the disk at least a few steps away to answer The first part The so-called heap property (or called heap condition) refers to the information within each node than its left and right child nodes of the information is small (about two child nodes, but there is no necessary relationship between). Although the concept of heap is a complete binary tree, in fact there exist root among an array A [1], then the A [2] and A [3] from left to right order of fill over the second layer, then A [4], A [5], A [6], A [7] from left to right order of filling up the third tier ....
Date : 2025-12-28 Size : 2kb User : zelda
[Algorithm] student DL : 0: 有10个学生，每个学生的数据包括学好，姓名，3门课程的成绩，从键盘输入10个学生数据，要求输出三门课程总平均成绩，以及最高分的学生的数据（包括学号，姓名，3门课程成绩，平均分数）。要求利用指向数组的指针的方法，用一个input函数输入5个学生数据，用一个average函数求总平均分，用max函数找出最高分学生数据，总平均分和最高分的学生数据都在主函数中输出-There are 10 students, each student s data, including master, name, 3 course was good, 10 students from the keyboard input data, the average of three courses required output results, and the highest points of the student data (including student number, name, 3 course grade, the average score). Require the use of an array of pointers pointing to the method, with an input function input 5 student data, with an average total average demand function, with the max function to find the highest score student data, the total average score and highest score of the student data in the main function output
Date : 2025-12-28 Size : 3kb User : yanyan
[Algorithm] MMAS DL : 0: 最大最小改进蚁群优化算法，c++工程，编译即可-Max Min Ant Colony Optimization Algorithm, c++ projects can be compiled
Date : 2025-12-28 Size : 821kb User : xuyc
[Algorithm] optimal-for-max-stable-set DL : 0: 对于常规的最大稳定集的算法进行优化，提出了基于多项式优化的最大稳定集算法-an optimal algorithm for max stable set
Date : 2025-12-28 Size : 29kb User : nihai
[Algorithm] optimal-for-max-cut-problem DL : 0: 对最大割问题提出二次优化的算法，介绍了基于多项式优化的最大割问题-an optimal algorithm for max-cut problem
Date : 2025-12-28 Size : 51kb User : nihai

« 12 3 »