Search - max - CodeBus

Search - max - List

[AI-NN-PR] 模拟退火源码 DL : 0: 模拟退火算法模拟退火算法(Simulated Annealing,简称SA算法)是模拟加热熔化的金属的退火过程，来寻找全局最优解的有效方法之一。模拟退火的基本思想和步骤如下：设S＝{s1,s2,…,sn}为所有可能的状态所构成的集合， f：S—R为非负代价函数，即优化问题抽象如下：寻找s*∈S，使得f(s*)＝min f(si) 任意si∈S （1）给定一较高初始温度T，随机产生初始状态S （2）按一定方式，对当前状态作随机扰动，产生一个新的状态S’ S’＝S＋sign(η).δ 其中δ为给定的步长， η为[－1,1]的随机数-simulated annealing algorithm (Simulated Annealing, or SA algorithm) is a simulation of heating molten metal in the annealing process, to find the global optimum one of the effective ways. Simulated Annealing basic ideas and the steps are as follows : S = (s1, s2, ..., sn) for all possible state posed by the pool, f : S-R non-negative cost function, that is abstract optimization problems are as follows : Find S* s, making f (s*) = min f (si) arbitrary si S (1) to set a higher initial temperature T, randomly generated initial state S (2) of a certain form, the current state of random disturbance, have a new state S 'S' = S+ sign (). delta where given for the step, [-1,1] Random Number
Date : 2025-12-28 Size : 54kb User :
[AI-NN-PR] bayesfunction DL : 0: bayeserr - Computes the Bayesian risk for optimal classifier. ％ bayescln - Classifier based on Bayes decision rule for Gaussians. ％ bayesnd - Discrim. function, dichotomy, max aposteriori probability. ％ bhattach - Bhattacharya s upper limit of mean class. error. ％ pbayescln - Plots discriminat function of Bayes classifier.-bayeserr- Computes the Bayesian risk for o ptimal classifier. % bayescln- Classifier bas ed on Bayesian decision rule for Gaussians. Bayes% nd- Discrim. function, dichotomy. max aposteriori probability. % bhattach- Bhat tacharya s upper limit of mean class. error. pb% ayescln- Plots discriminat function of Bayes c lassifier.
Date : 2025-12-28 Size : 5kb User : 孟庆
[AI-NN-PR] zju-max-Ga DL : 0: 一个求函数最值得c程序，使用遗传算法。简解明了。非常实用。-a function for most c, the use of genetic algorithm. Mr Xie understand. Very practical.
Date : 2025-12-28 Size : 3kb User : 李冲
[AI-NN-PR] MAX_MIN_Ant_System DL : 0: matlab中求解最大最小问题的蚂蚁算法源代码。很有参考价值。-Matlab solution of the biggest problems the smallest ant algorithm source code. Great reference value.
Date : 2025-12-28 Size : 47kb User : 陈剑
[AI-NN-PR] spider DL : 0: 马克斯普朗克提供的机器学习程序包，主要是matlab代码，另外也调用了大量的weka代码和libsvm代码-Provided by the Max Planck Institute for machine learning package, mainly matlab code, also called a large number of weka code and code libsvm
Date : 2025-12-28 Size : 6.14mb User : De-Chuan Zhan
[AI-NN-PR] PSOt DL : 0: 微粒群工具箱PSOt为PSO的工具箱，该工具箱将PSO算法的核心部分封装起来，提供给用户的为算法的可调参数，用户只需要定义好自己需要优化的函数(计算最小值或者最大值)，并设置好函数自变量的取值范围、每步迭代允许的最大变化量(称为最大速度，Max_V)等，即可自行优化。-Particle Swarm PSOt Toolbox Toolbox for PSO, the PSO algorithm toolbox will be the core of the package, and made available to the user adjustable parameters for the algorithm, users only need to define their need to optimize the function (calculation of the minimum or max), and set a good function from the range of variables, each iteration step the maximum allowable variation (known as maximum speed, Max_V) and so on, can self-optimize.
Date : 2025-12-28 Size : 743kb User : dahai
[AI-NN-PR] GCluser DL : 0: 分级聚类算法：包括k-mean max-dist min-dist 程序使用方法：程序中打开文件“.dat”-》选择聚类方法-》显示数据 .dat文件格式：分成几类输入样本维数样本个数下面依次为样本特征向量-Hierarchical clustering algorithms: including k-mean max-dist min-dist procedure to use: program to open the file
Date : 2025-12-28 Size : 5.21mb User : 越越
[AI-NN-PR] KMEANS DL : 0: This directory contains code implementing the K-means algorithm using min-max distance.
Date : 2025-12-28 Size : 38kb User : lili
[AI-NN-PR] Fuzzy DL : 0: 模糊算法，实现了求交法计算模糊蕴含关系、最大最小法进行合成运算、求并法计算输出量的模糊集合、加权平均法计算实际的清晰控制量等部分的详细代码。-Fuzzy algorithm, the realization of the intersection method to calculate fuzzy implication relations, max-min method for synthesis of computing, and method for output fuzzy sets, the weighted average method to calculate the actual volume of clear control of part of the detailed code.
Date : 2025-12-28 Size : 165kb User : LCC
[AI-NN-PR] tenlei DL : 0: function [U,center,result,w,obj_fcn]= fenlei(data) [data_n,in_n] = size(data) m= 2 ％ Exponent for U max_iter = 100 ％ Max. iteration min_impro =1e-5 ％ Min. improvement c=3 [center, U, obj_fcn] = fcm(data, c) for i=1:max_iter if F(U)>0.98 break else w_new=eye(in_n,in_n) center1=sum(center)/c a=center1(1)./center1 deta=center-center1(ones(c,1),:) w=sqrt(sum(deta.^2)).*a for j=1:in_n w_new(j,j)=w(j) end data1=data*w_new [center, U, obj_fcn] = fcm(data1, c) center=center./w(ones(c,1),:) obj_fcn=obj_fcn/sum(w.^2) end end display(i) result=zeros(1,data_n) U_=max(U) for i=1:data_n for j=1:c if U(j,i)==U_(i) result(i)=j continue end end end -function [U, center, result, w, obj_fcn] = fenlei (data) [data_n, in_n] = size (data) m = 2 Exponent for U max_iter = 100 Max. iteration min_impro = 1e-5 Min. improvement c = 3 [center, U, obj_fcn] = fcm (data, c) for i = 1: max_iter if F (U)> 0.98 break else w_new = eye (in_n, in_n) center1 = sum (center)/ca = center1 (1) ./center1 deta = center-center1 (ones (c, 1),:) w = sqrt (sum (deta. ^ 2)) .* a for j = 1: in_n w_new (j, j) = w (j) end data1 = data* w_new [center, U, obj_fcn] = fcm (data1, c) center = center./w (ones (c, 1),:) obj_fcn = obj_fcn/sum (w. ^ 2) end end display (i) result = zeros (1, data_n) U_ = max (U) for i = 1: data_n for j = 1: c if U (j, i) == U_ (i) result (i) = j continue end end end
Date : 2025-12-28 Size : 3kb User : download99
[AI-NN-PR] hc-mmas-ubqp DL : 0: Short description: A MAX-MIN Ant System (MMAS) implemented in the Hyper-Cube Framework for the application to Unconstrained Binary Quadratic Programming (UBQP). Aim of the software: Educational (not high-performance) it shows how to implement a MMAS in the Hyper-Cube Framework. -Short description: A MAX-MIN Ant System (MMAS) implemented in the Hyper-Cube Framework for the application to Unconstrained Binary Quadratic Programming (UBQP). Aim of the software: Educational (not high-performance) it shows how to implement a MMAS in the Hyper-Cube Framework.
Date : 2025-12-28 Size : 313kb User : xiaochuzhe
[AI-NN-PR] max DL : 0: 计算4个股票中一年内每天的最大最大最小差值的源码，自己修改下可以利用-Calculation of the stock in year four of the largest daily max-min difference between the source that they can be modified to use
Date : 2025-12-28 Size : 3kb User : cxf
[AI-NN-PR] ACO.ZIP DL : 0: ACO algorythm. This software package provides an implementation of various Ant Colony Optimization (ACO) algorithms applied to the symmetric Traveling Salesman Problem (TSP). The ACO algorithms implemented are Ant System, Elitist Ant System, MAX-MIN Ant System, Rank-based version of Ant System, Best-Worst Ant System, and Ant Colony System.
Date : 2025-12-28 Size : 34kb User : Aco17
[AI-NN-PR] Code DL : 0: 最大流的压入与重标记算法,最短路程，最大费用的算法，-The Push-Relabel Algorithm max/min cuts
Date : 2025-12-28 Size : 1kb User : 文
[AI-NN-PR] clkmeans DL : 0: 将最大最小距离和k-means算法融合实现聚类-max-min distance and k-means
Date : 2025-12-28 Size : 218kb User : 玲
[AI-NN-PR] MAX-MINAntSystem DL : 0: 最大最小蚂蚁系统程序，供学习应用者参考。-Max-min ant system program for the learning applications in Taiwan.
Date : 2025-12-28 Size : 43kb User : zangtianlei
[AI-NN-PR] MMAS DL : 0: 最大最小蚁群算法求解TSP的实现在基本算法的基础上做少许更改即可。 1》初始化路段信息素为最大值 2》在增加信息素时只更新最优路径 3》在挥发信息素时，将所有路段的信息素值限制在最大最小值之间-Max Min Ant Colony
Date : 2025-12-28 Size : 54kb User : rock
[AI-NN-PR] GAslnhm DL : 0: 用来计算函数最大值的MATLAB的遗传算法-GA algorithm for computating max value
Date : 2025-12-28 Size : 8kb User : ny
[AI-NN-PR] original DL : 0: 这个程序是用遗传算法求函数的最大值的源码，很有参考价值-this code is about the max way to solve it out
Date : 2025-12-28 Size : 10kb User : 张媛媛
[AI-NN-PR] get-a-max-value-with-GA DL : 0: 用遗传算法来求解一个函数的最大值，简单易懂-get a max value of a fuction with the method of GA
Date : 2025-12-28 Size : 1kb User : 冯亮

« 12 3 »