Welcome![Sign In][Sign Up]
Location:
Search - 全排列和

Search list

[Mathimatics-Numerical algorithms算法分析和设计

Description: 经典算法之:连续邮资问题,全排列问题,有限期任务安排,整数划分问题,装载问题-classic algorithms : for the postage issue, all issues with a task deadline, integer division, loading problems
Platform: | Size: 3135 | Author: 常乐 | Hits:

[Other128bitminus

Description: 128乘法模拟器 c M位乘N位不带符号整数的阵列乘法中加法---移位操作的被加数矩阵.每一部分乘积项ab叫做一个被加数.m*n个被加数可以用m*n个”与门”并行的产生. 以5位乘5位不带符号的阵列乘法器(m=n=5)为例(如下图): FA为一位全加器,FA的斜线方向为进位输出,竖线方向为和输出,而所有被加数项的排列和正常的A*B=P乘法过程中的被加数矩阵相同.图中用矩形围成的阵列中最后一行构成一个行波进位加法器,其时间延迟为(n-1)2T.当然,为了缩短加法时间,最后一行的行波进位加法器也可以用先行进位加法器来代替.这种乘法器实现n位×n位时,需要n(n-1)个全加器和n2个”与”门.
Platform: | Size: 47357 | Author: fred | Hits:

[Other resourcesort

Description: 解决全排列的问题 可以包含特殊符号和一般的重复问题
Platform: | Size: 13407 | Author: 陈大哥 | Hits:

[Windows Develop递归输出全排列和集合的所有子集

Description: 递归实验,用递归输出全排列和集合的所有子集
Platform: | Size: 225 | Author: y_form@126.com | Hits:

[Other排列生成算法及其博文

Description: 排列生成算法及其博文 http://www.newsmth.net/pc/pccon.php?id=10001420&nid=269370 组合数学中的全排列深成算法历来是组合数学考试的重要考察点,因此在这里我简单的介绍一下6种全排列生成算法的详细过程,并借此比较它们之间的优劣之处。 不论是哪种全排列生成算法,都遵循着“原排列”→“原中介数”→“新中介数”→“新排列”的过程。其中中介数依据算法的不同会的到递增进位制数和递减进位制数。关于排列和中介数的一一对应性的证明我们不做讨论,这里仅仅给出了排列和中介数的详细映射方法。相信熟练掌握了方法就可以顺利通过这部分的考察。
Platform: | Size: 177152 | Author: 616451743@qq.com | Hits:

[Mathimatics-Numerical algorithms算法分析和设计

Description: 经典算法之:连续邮资问题,全排列问题,有限期任务安排,整数划分问题,装载问题-classic algorithms : for the postage issue, all issues with a task deadline, integer division, loading problems
Platform: | Size: 3072 | Author: 常乐 | Hits:

[Other128bitminus

Description: 128乘法模拟器 c M位乘N位不带符号整数的阵列乘法中加法---移位操作的被加数矩阵.每一部分乘积项ab叫做一个被加数.m*n个被加数可以用m*n个”与门”并行的产生. 以5位乘5位不带符号的阵列乘法器(m=n=5)为例(如下图): FA为一位全加器,FA的斜线方向为进位输出,竖线方向为和输出,而所有被加数项的排列和正常的A*B=P乘法过程中的被加数矩阵相同.图中用矩形围成的阵列中最后一行构成一个行波进位加法器,其时间延迟为(n-1)2T.当然,为了缩短加法时间,最后一行的行波进位加法器也可以用先行进位加法器来代替.这种乘法器实现n位×n位时,需要n(n-1)个全加器和n2个”与”门.-err
Platform: | Size: 47104 | Author: fred | Hits:

[Data structssort

Description: 解决全排列的问题 可以包含特殊符号和一般的重复问题-To solve the problem of the entire array can contain special symbols and the general problem of repeat
Platform: | Size: 242688 | Author: 陈大哥 | Hits:

[Data structsC

Description: 本文档容括了C(C++)所有算法,分为数值算法、图论算法、背包算法、排序算法、高精度算法、树的遍历、进制转换、全排列和组合生成、查找算法、贪心、回溯法框架、DFS框架、BFS框架、数据结构相关算法。并有实例源码-This document, including the capacity C (C ) for all algorithms, divided into numerical algorithms, graph theory, algorithm, knapsack algorithm, sorting algorithm, high-precision algorithms, tree traversal, binary conversion, the whole arrangement and combination of generation, search algorithm, greedy , backtracking framework, DFS framework, BFS framework, data structure-correlation algorithm. And examples of source
Platform: | Size: 15360 | Author: 海霞 | Hits:

[OtherCompose

Description: Compose:C++递归实现任意阶次的全排列P(n,n)和组合C(m,n)以及P(m,n)在VC6环境下编译并通过测试-Compose: C++ Recursive arbitrary order to achieve the full array P (n, n) and the combination of C (m, n) and P (m, n) in the environment VC6 compiled and tested
Platform: | Size: 10240 | Author: zhenyan | Hits:

[Data structsperm

Description: 利用回溯法求解背包问题和全排列的算法,用c++实现。-The use of retrospective method knapsack problem and the whole array of algorithms, using c++ realize.
Platform: | Size: 1024 | Author: 吕东 | Hits:

[OtherPerm

Description: 本程序实现了利用递归排序实现了数组的全排列,通过用户输入数组和选择排列的起始位置来完成输入-This procedure has the use of recursive order to achieve a wide array arranged, through the user input and selection of the array with the start position to complete the input
Platform: | Size: 870400 | Author: 耿锦威 | Hits:

[Windows Developpailie

Description: 依次输入exchange swap tianchongJ即可,若想修改全排列矩阵的大小,可在MATLAB中打开tianchongJ修改J和N -Exchange swap tianchongJ order to enter, If you want to modify the whole matrix with the size, can be opened in MATLAB in J and N modify tianchongJ
Platform: | Size: 1024 | Author: 张希 | Hits:

[Otherquanpailie

Description: 这是一个关于全排列的C++的程序,希望和大家交流一下。-This is a full array of C++ program, and you will exchange about.
Platform: | Size: 3072 | Author: xifeng | Hits:

[matlabquanpailie

Description: 依次输入exchange swap tianchongJ即可,若想修改全排列矩阵的大小,可在MATLAB中打开tianchongJ修改J和N。 -Enter exchange swap tianchongJ in turn can, If you want to modify the full array matrix size can be modified in MATLAB to open tianchongJ J and N.
Platform: | Size: 2048 | Author: masai | Hits:

[JSP/JavaDataStructure1

Description: 三个递归算法:1.用递归算法求前 n 个正整数的和;2.用递归算法求整形数组中前 n 个元素的和;3.递归实现全排列。-Three recursive algorithms: 1. Before seeking using recursive and n positive integers 2. With a recursive algorithm to solve the integer array of n elements and before 3. Recursive full array.
Platform: | Size: 11264 | Author: 蒙长江 | Hits:

[matlabMATLAB1

Description: MATLAB经典算法程序 经典程序。顶点覆盖近似算法,哈密尔顿回路,画等温线,模拟退火应用,生成全排列矩阵,随机数的产生,最大流和最小截,最短路和次短路,最短路径,最小生成树Prim算法-Classical algorithm MATLAB program
Platform: | Size: 40960 | Author: 陈真 | Hits:

[Sniffer Package capture310090452

Description: 实现的功能有用抓获包的的结果首先按五元组(源目标ip,源目标端口 ,协议类型)进行分类,然后可以通过参数给出在指定时间范围内,这些五元组的协议流的特征。例如:协议类型的话可以出来柱状图分析报的个数,排列。源地址和目的地址分析的可出来饼状图来分析个数和全排列。-Functions to achieve a useful outcome of the first captured packet according to the five tuple (source target ip, source destination port, protocol type) are classified, can then be given by parameters within the specified time, the five-flow characteristics of the protocol group . For example: Protocol type, then you can report out the number of histogram analysis, order. Analysis of the source and destination addresses can be out of a pie chart to analyze the number and the full array.
Platform: | Size: 2806784 | Author: 窦小敏 | Hits:

[MPIpailie_zuheCPPshixian

Description: 全排列和组合数C++函数的实现,全排列和组合数C++函数的实现-The realization of the full array and the combined number C++ function
Platform: | Size: 13312 | Author: 秋风落木 | Hits:

[Other1

Description: 自己写的简单11选5分析代码 全排列和简单数据统计 text1输入历史数据-Write your own simple analysis code 11 choose 5 The whole arrangement and simple statistics text1 input history data
Platform: | Size: 9216 | Author: 刘位 | Hits:
« 12 »

CodeBus www.codebus.net