代码搜索：Select
找到约 10,000 项符合「Select」的源代码
代码结果 10,000
www.eeworm.com/read/359263/10159075
m select.m
function path=Select(path,SelectP)
[row,col]=size(path);
roulette=cumsum(SelectP);
for i=1:row
tempP=rand(1);
for j=1:length(roulette)
if tempP
www.eeworm.com/read/359260/10159139
m select.m
function y=select(fit,N)
P=rand(1,N);
for i=1:N
tem_p=find(fit>=P(i));
s(i)=tem_p(1);
end
y=s;
www.eeworm.com/read/163252/10168412
m select.m
function [y]=select(x,sumfit)
% variable 'x' stands for fitness
popsize=length(x);
sum=0;
pick=rand(1);
% avgfit=x./sumfit
for m=1:popsize+1 % this design is not perfect,because there
www.eeworm.com/read/163079/10176506
c select.c
/*
* This file contains the procedures for the handling of select
*
* Created for Linux based loosely upon Mathius Lattner's minix
* patches by Peter MacDonald. Heavily edited by Linus.
*/
www.eeworm.com/read/358191/10194291
out select.out
The 1 element is 1
The 2 element is 2
The 3 element is 2
The 4 element is 3
The 5 element is 4
The 6 element is 7
The 7 element is 8
The 8 element is 9
The 9 element is 10
The 10 element is 1
www.eeworm.com/read/358191/10194549
cpp select.cpp
// find k'th smallest element
#include
#include "select.h"
void main(void)
{
int y[16] = {20, 30, 4, 2, 9, 7, 1, 2, 10, 3, 40, 22, 12, 14, 8, 100};
int n = 15, x;
www.eeworm.com/read/358191/10194641
h select.h
// file select.h
// find the k'th smallest element
#ifndef Select_
#define Select_
#include "xcept.h"
#include "swap.h"
template
T select(T a[], int l, int r, int k)
{// Return
www.eeworm.com/read/357514/10207314