代码搜索:selection

找到约 9,869 项符合「selection」的源代码

代码结果 9,869
www.eeworm.com/read/470729/6906732

h selection.h

/* * Copyright (C) 2004 Apple Computer, Inc. All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the follow
www.eeworm.com/read/470729/6906736

cpp selection.cpp

/* * Copyright (C) 2004 Apple Computer, Inc. All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the follow
www.eeworm.com/read/470452/6910813

m selection.m

%-------------------------------------------------- % 选择算子 %-------------------------------------------------- function new_gen = selection(old_gen,fitness,popsize)
www.eeworm.com/read/470452/6910827

asv selection.asv

%-------------------------------------------------- % 选择算子 %-------------------------------------------------- function new_gen = selection(old_gen,fitness,popsize)
www.eeworm.com/read/431959/6959696

m selection.m

% The select oprator function % function new_pop=select(pop,ada) ada_sum=0; ada_temp=0; r=0; i=0;j=0; for i=1:40 ada_sum=ada_sum+adapt(i); end for i=1:39 %选择39次,最后一个个体留给历代最优解
www.eeworm.com/read/124341/6965307

txt selection.txt

Apr 2003, S.Geerken@ping.de ========= Selection ========= The selection module (selection.[ch]) handles selections, as well as activation of links, which is closely related. General Overview =====
www.eeworm.com/read/124341/6965347

c selection.c

/* * File: selection.c * * Copyright 2003 Sebastian Geerken , * Eric Gaudet * * This program is free software; you can redistribute it and/o
www.eeworm.com/read/124341/6965415

h selection.h

#ifndef __SELECTION_H__ #define __SELECTION_H__ #include "dw_ext_iterator.h" #define SELECTION_EOW (1
www.eeworm.com/read/467941/6997097

java selection.java

/* * Selection.java * * Created on 2007
www.eeworm.com/read/467458/7003562

m selection.m

% 2.4 选择复制 % 选择或复制操作是决定哪些个体可以进入下一代。程序中采用赌轮盘选择法选择,这种方法较易实现。 % 根据方程 pi=fi/∑fi=fi/fsum ,选择步骤: % 1)在第 t 代,由(1)式计算 fsum 和 pi % 2)产生 {0,1} 的随机数 rand( .),求 s=rand( .)*fsum % 3)求 ∑fi≥s 中最小的 k ,则第 k 个个体被