代码搜索：Best 开发教程
找到约 10,000 项符合「Best 开发教程」的源代码
代码结果 10,000
www.eeworm.com/read/486654/6524920
cpp 1554.cpp
/* This Code is Submitted by wywcgs for Problem 1554 on 2005-11-22 at 15:54:34 */
#include
#include
const int MAX = 1024;
const int L_MAX = 128;
const double eps = 1e-4;
www.eeworm.com/read/483246/6601563
m qgate.m
function ret=Qgate(individuals,best,binary,sizepop,lenchrom)
% 根据中的量子门调整策略编写
% quantum gate
global delta
for i=1:sizepop
for j=1:sum(lenchrom)
A=individuals.c
www.eeworm.com/read/483246/6601564
m hgate.m
function ret=Hgate(individuals,best,binary,sizepop,lenchrom)
% 根据编写
% H gate
global maxg
www.eeworm.com/read/483246/6601568
asv quantum.asv
function quantum
% This is quantum genetic algorithm(QGA)
% In this function ,it fulfils quantum genetic algorithm
clc;
clear;
global sizepop lenchrom
global judge
global maxgen gen
www.eeworm.com/read/483246/6601569
asv qgate.asv
function ret=Qgate(individuals,best,sizepop,lenchrom)
% 根据中的量子门调整策略编写
% quantum gate
global delta
for i=1:sizepop
for j=1:sum(lenchrom)
A=individuals.chrom(2*
www.eeworm.com/read/483246/6601571
m quantum.m
function quantum
% This is quantum genetic algorithm(QGA)
% In this function ,it fulfils quantum genetic algorithm
clc;
clear;
global sizepop lenchrom
global judge
global maxgen gen
www.eeworm.com/read/483246/6601574
asv qgate2.asv
function ret=Qgate2(individuals,best,sizepop,lenchrom)
% 根据自编量子门调整策略编写
% quantum gate
global delta
for i=1:sizepop
for j=1:sum(lenchrom)
A=individuals.chrom(2*i-1,j); % α
www.eeworm.com/read/483246/6601578
m qgate2.m
function ret=Qgate2(individuals,best,binary,sizepop,lenchrom)
% 根据自编量子门调整策略编写
% quantum gate
% 适应度越大越好
global delta
for i=1:sizepop
for j=1:sum(lenchrom)
A=individuals.chrom(
www.eeworm.com/read/483246/6601579
m qgate1.m
function ret=Qgate1(individuals,best,binary,sizepop,lenchrom)
% 根据编写
% quantum gate ( another )
global maxgen g
www.eeworm.com/read/483246/6601580
asv qgate1.asv
function ret=Qgate1(individuals,best,sizepop,lenchrom)
% 根据编写
% quantum gate ( another )
global maxgen gen
f