代码搜索:selection
找到约 9,869 项符合「selection」的源代码
代码结果 9,869
www.eeworm.com/read/427751/8923650
m selection.m
%选择复制
%选择或复制操作决定哪些个体可以进入下一代.程序中采用赌轮盘选择法选择
function [newpop]=selection(pop,fitvalue)
totalfit=sum(fitvalue); %求适应度之和
fitvalue=fitvalue/totalfit;%单个个体被选择的概率
fitvalue=cumsum(fitvalue); %如fitvalue=[
www.eeworm.com/read/379619/9191539
p selection.p
www.eeworm.com/read/181026/9277126
m selection.m
function [max_fitness_temp_position,decimal_space_selected,binary_space_selected,maxfitness_selection]=selection(decimal_space,binary_space,fitness_value,bits)
%Selection Function Of Simple Genetic
www.eeworm.com/read/176166/9513362
c selection.c
static const char CVSID[] = "$Id: selection.c,v 1.25 2003/05/09 17:43:48 edg Exp $";
/*******************************************************************************
* *
* Copyright (C)
www.eeworm.com/read/176166/9513434
h selection.h
/* $Id: selection.h,v 1.5 2002/07/11 21:18:10 slobasso Exp $ */
#ifndef NEDIT_SELECTION_H_INCLUDED
#define NEDIT_SELECTION_H_INCLUDED
#include "nedit.h"
#include
#include
www.eeworm.com/read/371987/9526323
java selection.java
public class Selection extends Statement {
private Expression condition;
private Statement ifStatement, elseStatement;
public Selection(Expression c, Statement ts, Statement fs) {
cond
www.eeworm.com/read/370947/9574659
java selection.java
package sort_source;
public class Selection {
//super(1);
// 选择排序
public void selection_sort(int[] data) {
int out, in, min;
int n = data.length;
for (out = 0; out < n - 1; out++
www.eeworm.com/read/370947/9574688
class selection.class
www.eeworm.com/read/169818/9836451
m selection.m
function [newpop]=selection(pop,fitvalue)
global popsize;
fitvalue=hjjsort(fitvalue);
totalfit=sum(fitvalue); %求适应值之和
fitvalue=fitvalue/totalfit; %单个个体被选择的概率
fitvalue=cumsum(fitvalu
www.eeworm.com/read/167186/9978198