搜索资源列表
conquer-and-divide-algorithm
- 本章描述了讲解了分治算法的基本思想和设计过程以及原理-Explain the basic idea and design process as well as the principle of divide and conquer algorithm described in this chapter
A-Genetic-Algorithm-Based-AGC-of-a-Restructured-P
- In this paper, the parameters of PID controller for Automatic Generation Control (AGC) is tuned according to Generic Algorithms (GAs) based performance indices in the restructured power systems. The key idea of the proposed method is to use the
decrypt
- I am trying to implement IDEA algorithm in C#, just to learn how it works. I have taken a 128 bit binary key and generated the 52 encryption keys using the following code:
Genetic-algorithm-optimization
- 遗传算法优化B P神经网络的目的是通过遗传算法得到更好的网络初始权值和阈值, 其 基本思想就是用个体代表网络的初始权值和阈值、 个体值初始化的B P神经网络的预测误差作为该个体的适应度值, 通过选择、 交叉、 变异操作寻找最优个体, 即最优的B P神经网络初始权值。除了遗传算法之外, 还可以采用粒子群算法、 蚁群算法等优化B P神经网络初始权值。-Genetic algorithm to optimize BP neural network is designed by means of g
ACM-algorithm
- 里面包含ACM源代码，并介绍了很多关于数据结构和算法的思想及案例。-ACM which contains the source code, and introduced a lot about the idea of data structures and algorithms and case.
IDEA
- IDEA加密代码，本文档详细介绍了IDEA的加密算法，并给出了C语言源代码，编译成功。-IDEA encryption code, the document details the IDEA encryption algorithm, and gives the C language source code, compile successfully.
IDEA
- IDEA（国际数据加密算法）加密算法,自己修改版本-IDEA（international data encryption algorithm） encryption algorithm, a modified version
IDEA
- IDEA加密算法的加密与解密功能，用一个密码类进行了实现-IDEA encryption algorithm for encryption and decryption functions, a class to implement a password
International-Data-Encryption-Algorithm
- IDEA was used as the symmetric cipher in early versions of the Pretty Good Privacy cryptosystem
Joseph-algorithm
- 约瑟夫算法：n个人围成一圈，每人有一个各不相同的编号，选择一个人作为起点，然后顺时针从1到k数数，每数到k的人退出圈子，圈子缩小，然后从下一个人继续从1到k数数，重复上面过程。求最后推出圈子的那个人原来的编号。 思路：按照上面的算法让人退出圈子，直到有n-1个人推出圈子，然后得到最后一个退出圈子的人的编号。 程序：坐成一圈的人的编号不需要按序排列-Joseph algorithm: n individuals in a circle, each with a different
IDEA
- IDEA的加密算法，用MFC的界面完成，求站长通过审核-IDEA encryption algorithm, using MFC' s interface is complete, ask webmasters approved
(SVM)-regression-algorithm
- 对比这么复杂的推导过程，SVM的思想确实那么简单。它不再像logistic回归一样企图去拟合样本点（中间加了一层sigmoid函数变换），而是就在样本中去找分隔线，为了评判哪条分界线更好，引入了几何间隔最大化的目标。-The derivation process of the contrast is so complex, the idea of SVM is so simple. It is no longer tried to like logistic regression fitting
bankers-algorithm
- 用JAVA实现的银行家算法的核心思想（非完整版）-JAVA implementation with the core idea of the banker s algorithm (non-full version)
Otsu-Algorithm
- Otsu方法是一种全局化的动态二值化方法，又叫大津法，是一种灰度图像二值化的常用算法。该算法的基本思想是：设使用某一个阈值将灰度图像根据灰度大小，分成目标部分和背景部分两类，在这两类的类内方差最小和类间方差最大的时候，得到的阈值是最优的二值化阈值。-Otsu method is a globally-oriented dynamic binary method, also known Otsu is a gray image binarization commonly used algorith
Watershed-Algorithm
- 分水岭分割方法，是一种基于拓扑理论的数学形态学的分割方法，其基本思想是把图像看作是测地学上的拓扑地貌，图像中每一点像素的灰度值表示该点的海拔高度，每一个局部极小值及其影响区域称为集水盆，而集水盆的边界则形成分水岭。-Watershed segmentation method is a mathematical morphology segmentation method based on topological theory, the basic idea is the image seen o
fft--algorithm(CPP)
- fft算法的实现，包括时域抽取和频域抽取。可以帮助学生快速了解fft算法的核心思想。-This software is a implementation of fft algorithm, which includes the time-domain and frequency-domain.Using this software, students can quickly understand the core idea of fft algorithm.
idea
- 关于idea算法加密工具实现的源码，详细解释了idea算法实现的过程和说明-About idea encryption algorithm tools to achieve the source code
algorithm-study
- 一篇学习算法与设计的过程中的学习笔记，基本囊括了当前算法设计中的重要思想与重点内容。-A notebook produced during my process of learing Algorithm Design and Analysis, including almost all the important idea of algorithm design.
divide-and-conquer-algorithm
- 分治算法的基本思想是将一个规模为N的问题分解为K个规模较小的子问题，这些子问题相互独立且与原问题性质相同。求出子问题的解，就可得到原问题的解。-The basic idea of divide and conquer algorithm is a scale problem is decomposed into N K a smaller sub-problems, these sub-problems are independent and original problems of the s
idea
- In cryptography, the International Data Encryption Algorithm (IDEA), originally called Improved Proposed Encryption Standard (IPES), is a symmetric-key block cipher designed by James Massey of ETH Zurich and Xuejia Lai and was first described in 1991