搜索结果

找到约 384 项符合 Problem 的查询结果

电子书籍 彩票中的数学lottery problem.pdf

彩票中的数学lottery problem.pdf
https://www.eeworm.com/dl/cadence/ebook/168385.html
下载: 61
查看: 1035

Java编程 This program is using Genetic Algorithm to solve the Travlling Salesman Problem. It gives the bes

This program is using Genetic Algorithm to solve the Travlling Salesman Problem. It gives the best path route within a specified time. usage: java Evolver <seconds> <city file> <config file> Author: Liu Yang
https://www.eeworm.com/dl/633/170728.html
下载: 121
查看: 1044

人工智能/神经网络 - XCS for Dynamic Environments + Continuous versions of XCS + Test problem: real multiplexer +

- XCS for Dynamic Environments + Continuous versions of XCS + Test problem: real multiplexer + Experiments: XCS is explored in dynamic environments with different magnitudes of change to the underlying concepts. +Reference papers: H.H. Dam, H.A. Abbass, C.J. Lokan, Evolutionary Online Data Mini ...
https://www.eeworm.com/dl/650/171622.html
下载: 99
查看: 1070

系统设计方案 The Dynamic Assignment Problem

The Dynamic Assignment Problem,动态排班问题,使用到了各个智能算法
https://www.eeworm.com/dl/678/173009.html
下载: 130
查看: 1030

人工智能/神经网络 solve the 8-puzzle problem using A* algorithm. Definitely written by my self, also include BGI graph

solve the 8-puzzle problem using A* algorithm. Definitely written by my self, also include BGI graphics library output.
https://www.eeworm.com/dl/650/176530.html
下载: 149
查看: 1245

人工智能/神经网络 use genetic ant algorithm to slove TSP problem

use genetic ant algorithm to slove TSP problem
https://www.eeworm.com/dl/650/176905.html
下载: 43
查看: 1026

人工智能/神经网络 A matlab code for a reinforment learning routing problem

A matlab code for a reinforment learning routing problem
https://www.eeworm.com/dl/650/176908.html
下载: 115
查看: 1085

其他 源自 adaptive filter theory 書本上problem範例。

源自 adaptive filter theory 書本上problem範例。
https://www.eeworm.com/dl/534/180380.html
下载: 83
查看: 1046

数学计算 /* * EULER S ALGORITHM 5.1 * * TO APPROXIMATE THE SOLUTION OF THE INITIAL VALUE PROBLEM: * Y = F

/* * EULER S ALGORITHM 5.1 * * TO APPROXIMATE THE SOLUTION OF THE INITIAL VALUE PROBLEM: * Y = F(T,Y), A<=T<=B, Y(A) = ALPHA, * AT N+1 EQUALLY SPACED POINTS IN THE INTERVAL [A,B]. * * INPUT: ENDPOINTS A,B INITIAL CONDITION ALPHA INTEGER N. * * OUTPUT: APPROXIMATION W TO Y AT THE (N+1) VALUES OF T. * ...
https://www.eeworm.com/dl/641/186529.html
下载: 43
查看: 1052

文件格式 producer-consumer problem 的源码

producer-consumer problem 的源码
https://www.eeworm.com/dl/639/186824.html
下载: 75
查看: 1029