代码搜索：如何学习 Best？
找到约 10,000 项符合「如何学习 Best？」的源代码
代码结果 10,000
www.eeworm.com/read/282427/4101797
makefile 学习.makefile
// 本文件为IDE自动生成与工程对应的编译文件
// 编译参数
-efl_name=学习
-out_mode=runable
-d os_win32
-out="C:\Documents and Settings\Administrator\桌面\学习\发布版\学习.exe"
// 类库信息定义文件
C:\Documents and Settings\Administ
www.eeworm.com/read/282427/4101798
makefile 学习.makefile
// 本文件为IDE自动生成与工程对应的编译文件
// 编译参数
-dbg
-efl_name=学习
-out_mode=runable
-d os_win32
-out="C:\Documents and Settings\Administrator\桌面\桌面\学习\调试版\学习.exe"
// 类库信息定义文件
C:\Documents and Settings\A
www.eeworm.com/read/291164/8438776
c best.c
/*
* This file is part of John the Ripper password cracker,
* Copyright (c) 1996-99,2003 by Solar Designer
*/
/*
* Benchmark to detect the best algorithm for a particular architecture.
*/
#ifde
www.eeworm.com/read/291164/8438820
sh best.sh
#!/bin/sh
#
# This file is part of John the Ripper password cracker,
# Copyright (c) 1996-2000,2003,2005 by Solar Designer
#
[ $# -eq 5 ] || exit 1
MAKE=$1
DES_DEPEND=$2
DES_BS_DEPEND=$3
MD5_DEPEND=
www.eeworm.com/read/289518/8546722
bmp best.bmp
www.eeworm.com/read/289299/8560676
m best.m
% 2.7 求出群体中最大得适应值及其个体
%遗传算法子程序
%Name: best.m
%求出群体中适应值最大的值
function [bestindividual,bestfit]=best(pop,fitvalue)
[px,py]=size(pop);
bestindividual=pop(1,:);
bestfit=fitvalue(1);
for i=2:px
if
www.eeworm.com/read/387664/8660004
c best.c
/*
* GENESIS Copyright (c) 1986, 1990 by John J. Grefenstette
* This program may be freely copied for educational
* and research purposes. All other rights reserved.
*
* file: best.c
www.eeworm.com/read/386789/8727007
m best.m
% 2.7 求出群体中最大得适应值及其个体
%遗传算法子程序
%Name: best.m
%求出群体中适应值最大的值
function [bestindividual,bestfit]=best(pop,fitvalue)
[px,py]=size(pop);
bestindividual=pop(1,:);
bestfit=fitvalue(1);
for i=2:px
if
www.eeworm.com/read/285966/8799133
m best.m
% 2.7 求出群体中最大得适应值及其个体
%遗传算法子程序
%Name: best.m
%求出群体中适应值最大的值
function [bestindividual,bestfit]=best(pop,fitvalue)
[px,py]=size(pop);
bestindividual=pop(1,:);
bestfit=fitvalue(1);
for i=2:px
if