代码搜索：selection
找到约 9,869 项符合「selection」的源代码
代码结果 9,869
www.eeworm.com/read/360807/10077326
c selection.c
/*
* linux/drivers/char/selection.c
*
* This module exports the functions:
*
* 'int set_selection(const unsigned long arg)'
* 'void clear_selection(void)'
* 'int paste_selection(str
www.eeworm.com/read/360807/10077657
o selection.o
www.eeworm.com/read/164463/10106960
h selection.h
/*
* selection.h
*
* Interface between console.c, tty_io.c, vt.c, vc_screen.c and selection.c
*/
#ifndef _LINUX_SELECTION_H_
#define _LINUX_SELECTION_H_
#include
extern int
www.eeworm.com/read/358982/10172536
m selection.m
function selm = selection(popu,fitness,gap,pc,pm,tsels);
% 选择操作
popun = popu.size;
selm = zeros(popun,3); % popu.size如果是3则产生的selm是 3*3 全 0 矩阵
fit = fitness;
if ~isempty(find(fit
www.eeworm.com/read/358980/10172576
m selection.m
function selm = selection(popu,fitness,gap,pc,pm,tsels);
% 选择操作
popun = popu.size;
selm = zeros(popun,3); % popu.size如果是3则产生的selm是 3*3 全 0 矩阵
% Fitness values and sort
% % fit = zeros(1,
www.eeworm.com/read/162743/10277145
h _selection.h
#if !defined(AFX__SELECTION_H__99B144A1_93D9_4C73_8C1F_43005CBFDECE__INCLUDED_)
#define AFX__SELECTION_H__99B144A1_93D9_4C73_8C1F_43005CBFDECE__INCLUDED_
#if _MSC_VER > 1000
#pragma once
#endif
www.eeworm.com/read/162743/10277805
cpp _selection.cpp
// Machine generated IDispatch wrapper class(es) created by Microsoft Visual C++
// NOTE: Do not modify the contents of this file. If this class is regenerated by
// Microsoft Visual C++, your m
www.eeworm.com/read/426125/10284988
hh selection.hh
#include
#include
#include
#include
#include
#include
#include
www.eeworm.com/read/280828/10290839
h selection.h
// ---- Selection.h
#ifndef SELECTION_H
#define SELECTION_H
namespace DDJCProgrammingColumnSelection {
//////////////////////////////////////////////////////////////////////
// P is a user-define
www.eeworm.com/read/424747/10417791
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次，最后一个个体留给历代最优解