代码搜索结果

; Code Composer Project File, Version 2.0 (do not modify or remove this line) [Project Settings] ProjectName="useraudio" ProjectDir="E:\qu\guaxiang\54x_prg\algorithm\exp01_audiofft\" ProjectType

---------------------------- audiofft.pjt - Debug ---------------------------- "c:\ti5x\c5400\cgtools\bin\cl500" -g -q -fr"E:/qu/guaxiang/54x_prg/algorithm/exp01_audiofft/Debug" -d"_DEBUG" -v548 -@

Genetic Algorithm Optimization Toolbox Genetic Algorithm Optimization Toolbox (GAOT) GAOT implements simulated evolution i

% Genetic Optimization Toolbox % % Main interface % ga.m The Genetic Algorithm % initialize.m Initialization function Used by ga.m % % Operators used during simulated

Genetic Algorithm Optimization Toolbox (GAOT) The following files are in the distribution: Main interface ga.m

**** MENU **** 1. Bully's Algorithm 2. Ring Algorithm 3. Exit Enter your choic

#!/bin/bash # gcd.sh: greatest common divisor # Uses Euclid's algorithm # The "greatest common divisor" (gcd) of two integers #+ is the largest integer that will divide both, leaving no rema

#!/bin/bash # primes.sh: Generate prime numbers, without using arrays. # Script contributed by Stephane Chazelas. # This does *not* use the classic "Sieve of Eratosthenes" algorithm, #+ but instead

function [f,dfdx] = fx3n(x) % fx3n Evaluate f(x) = x - x^(1/3) - 2 and dfdx for Newton algorithm f = x - x.^(1/3) - 2; dfdx = 1 - (1/3)*x.^(-2/3);

function [f,dfdx] = fx3n(x) % fx3n Evaluate f(x) = x - x^(1/3) - 2 and dfdx for Newton algorithm f = x - x.^(1/3) - 2; dfdx = 1 - (1/3)*x.^(-2/3);