gaot

Traveeling sales man problem solved using genetic algorithm in matlab

This program computes the point locations where two curves intersect. The curves can be broken with NaNs or have vertical segments.

This is a fuzzy PID controller which combine fuzzy control and PID control(a fuzzy PID controller which combine fuzzy control and PID control)

This function is about optimization by conjugate method

掷骰子x，相同的骰子如果大于Y，得分为零，否则为个点数和。多次掷骰子观察概率情况(Dice x, the same dice if greater than Y, score zero points and one otherwise. Probability of observing multiple dice)

设计一维纳滤波器 (1)产生三组观测数据：首先根据s(n)=a s(n-1)+w(n)产生信号s(n)，将其加噪（信噪比分别为20dB,10 dB，6 dB），得到观测数据x1(n), x2(n), x31(n). (2)估计xi(n)，i=1,2,3的AR模型参数。假设信号长度为L，AR模型阶数为N，分析实验结果，并讨论改变L,N对实验结果的影响。 (A Wiener filter design (1) to produce three sets of observations: first generating a signal s (n) according to s (n) = as (n-1)+w (n), to add noise (20dB SNR, respectively , 10 dB, 6 dB), to obtain observational data x1 (n), x2 (n), x31 (n). (2) estimate xi (n), i = AR model parameters 1,2,3. Assuming the signal length L, AR model of order N, analysis of experimental results and discuss the impact changing L, N of the experimental results.)

rls-dfeeq.m 均衡算法 用RLS-DFE算法实现(rls-dfeeq.m Equalization Algorithms with the RLS-DFE)

PFC 的原理与分析设计 我们作比赛的资料(Principle and Analysis of PFC design we make the game data)

TSP的遗传算法实现。本案例是通过遗传算法实现旅行商问题(TSP genetic algorithm. Through genetic algorithm traveling salesman problem)

优化问题分类：（非）线性规划、整数规划、0-1 规划、（多）目标规划、（与时间有关的）动态规划、（系数是随机变量的）随机规划。 (Optimization problem categories: (non-) linear programming, integer programming ,0-1 plan, (multiple) goal programming, (and time-related) dynamic programming, (coefficient is a random variable) stochastic programming.)