代码搜索：Best 开发教程
找到约 10,000 项符合「Best 开发教程」的源代码
代码结果 10,000
www.eeworm.com/read/269220/11105761
cpp f0507.cpp
//=====================================
// f0507.cpp
// 函数指针数组
//=====================================
#include
using namespace std;
//-------------------------------------
typedef vo
www.eeworm.com/read/269220/11105777
cpp f0508.cpp
//=====================================
// f0508.cpp
// 函数指针向量
//=====================================
#include
#include
using namespace std;
//-------------------------------
www.eeworm.com/read/414216/11124696
txt psoutfil.txt
Iter: 134 Best val: 9.79533469386637E-06 1/4/00 3:44:50 PM
Neighd. size (0=global): 0 Fnctn# 5 #Dims 2
Dim. 1 Pos. -1.491387E-04
Dim. 2 Pos. -5.451324E-04
Iter
www.eeworm.com/read/266538/11220010
java frequent.java
// Adrian Kuegel
// Date: 17. 6. 2007
// Complexity: O(n log n + q)
import java.io.*;
import java.util.*;
public class frequent {
public static void main(String [] args) throws Exception {
Scanne
www.eeworm.com/read/266529/11221238
cpp european.cpp
// Problem European railroad tracks
// Algorithm backtracking
// Runtime O(2^n * (n!)^2)
// Author Adrian Kuegel
// Date 2005.05.27
#include
#include
#include
www.eeworm.com/read/147715/12535216
txt 用于一维搜索的pso算法.txt
这是用来代替最速下降法中的黄金分割法的
虽然耗时较黄金分割法长,但是效果不是黄金分割法所能比较的
毕竟
www.eeworm.com/read/335332/12539627
java assigngrade.java
import javax.swing.JOptionPane;
public class AssignGrade {
/** Main method */
public static void main(String[] args) {
int numberOfStudents = 0; // The number of students
int[] scores; //
www.eeworm.com/read/147198/12577103
m ga.m
a=1,b=256,pc=0.6;pm=0.06;
popsize=20;stringlength=8;
maxgeneration=20;
% generation=0;
[pop]=initialise(popsize,stringlength,a,b);
tic;
for generation=0:1:maxgeneration
% nextpop=pop;
[bmax,b
www.eeworm.com/read/147198/12577107
asv ga.asv
a=1,b=256,pc=0.6;pm=0.06;
popsize=20;stringlength=8;
maxgeneration=20;
% generation=0;
[pop]=initialise(popsize,stringlength,a,b);
tic;
for generation=0:1:maxgeneration
% nextpop=pop;
[bmax,b