GUI4GUI

OFDM qpsk,16qam and 64 qam code

Ant Colony Optimization (ACO) is an optimization metaheuristic based on the foraging behavior of ants. This metaheuristic was originally proposed to find good solutions to discrete combinatorial problems. Many extensions of the ACO heuristic for continuous domain have been proposed, but even those that claim close similarity with classical (discrete domain) ACO, like ACOR, do not use the heuristic information called visibility, commonly used in the original ACO algorithm. In this paper, we show the importance of the visibility in ACO, by proposing ACOℝ -V , a variant of ACOR that performs better in a number of benchmark functions.

power sharing method with droop controler

matlab量化择时模型回测代码，matlab量化择时模型回测代码(Optional model to quantify when backtesting matlab code)

移动渐近线方法的源程序，里面包含两个子程序(Methods of Moving Asymptotes,incloding two programs : mmasub.m and subsolv.m)

图片，很经常用的一副matlab里面的图片(Picture, it is often used inside a pair of matlab Photos)

Simple Scheduling using ICA (Imperialist competitive algorithm)

Identification of a muffle furnace

四阶龙格库塔法解内弹道方程，具有很好的精度，程序通俗易懂(Fourth-order Runge-Kutta method solution trajectory equation for interior_ballstic,)

matlab codes to solve single variable unconstrained optimization problem using five methods