Search - INT 1 - CodeBus

Search - INT 1 - List

[AI-NN-PR] 51个城市的tsp程序 DL : 0: 这是一个用蚁群算法来解决51个城市的tsp问题，该源码是用C++编写的，是一个非常有用的源代码 const int iAntCount=34;//ant numbers 蚂蚁数量 const int iCityCount=51;//城市数量 const int iItCount=500;//循环次数 const double Q=100;//信息素总量
Date : 2012-03-17 Size : 1.54kb User : cuifangsong
[AI-NN-PR] ulapack DL : 0: This collection of C++ templates wraps the FORTRAN or C interfaces for LAPACK so that they integrate with the Boost uBLAS library. Currently implements Cholesky decomposition, LU decomposition, inversion and determinant for general and positive-definite matrices. -This collection of templates wraps the C FOR RTRAN or C interfaces for LAPACK so that they int egrate with the Boost uBLAS library. Currently implements Cholesky decomposition. LU decomposition. inversion and determinant for general and posi tive- definite matrices.
Date : 2026-01-07 Size : 107kb User : sunxiaodian
[AI-NN-PR] tony DL : 0: 河內塔問題 #include<stdio.h> #include<stdlib.h> int fun_a(int) void fun_b(int,int,int,int) int main(void) { int n int option printf("題目二:河內塔問題\n") printf("請輸入要搬移的圓盤數目\n") scanf("％d",&n) printf("最少搬移的次數為％d次\n",fun_a(n)) printf("是否顯示移動過程? 是請輸入1,否則輸入0\n") scanf("％d",&option) if(option==1) { fun_b(n,1,2,3) } system("pause") return 0 } int fun_a(int n) { int sum1=2,sum2=0,i for(i=n i>1 i--) { sum1=sum1*2 } sum2=sum1-1 return sum2 } void fun_b(int n,int left,int mid,int right) { if(n==1) printf("把第％d個盤子從第％d座塔移動到第％d座塔\n",n,left,right) else { fun_b(n-1,left,right,mid) printf("把第％d個盤子從第％d座塔移動到第％d座塔\n",n,left,right) fun_b(n-1,mid,left,right) } } -err
Date : 2026-01-07 Size : 6kb User : 林小世
[AI-NN-PR] BPNN DL : 0: 用BP神经网络实现模糊控制规则为T=int[(e +ec)/2]的模糊神经网络控制器。可以改变隐层节点数和学习速率。网络训练算法是变学习速率法。-BP neural network with fuzzy control rules for the T = int [(e+ Ec)/2] of the fuzzy neural network controller. Can change the hidden layer nodes and learning rate. Network training algorithm is a variable learning rate method.
Date : 2026-01-07 Size : 4kb User : 韩梅
[AI-NN-PR] Dijkstra DL : 0: 用Dijkstra法求最短路径，有向图与无向图均可-void ShortestPath_DIJ( Node a ,Status i ,Status v0 ,Status*D ,Status*pre ) { int v,w,j,l=1 Status*final Status min final=(Status*)malloc( sizeof(Status)*i ) for(v=0 v<i v++) { final[v]=FALSE pre[v]=FALSE D[v]=a[v0][v] if(D[v]<10000) pre[v]=v0 }
Date : 2026-01-07 Size : 1kb User : 腾龙
[AI-NN-PR] contacts1 DL : 0: 利用线性表实现一个通讯录管理，通信录的数据格式如下： struct DataType { int ID //编号 char name[10] //姓名 char ch //性别 char phone[13] //电话 char addr[31] //地址 } 要求： ? 实现通讯录的建立、增加、删除、修改、查询等功能 ? 能够实现简单的菜单交互，即可以根据用户输入的命令，选择不同的操作。 ? 能够保存每次更新的数据（选作） ? 能够进行通讯录分类，比如班级类、好友类、黑名单等等（选作） ? 编写测试main()函数测试线性表的正确性 -An address book using the linear table implementation management, and communication of data recorded in the following format: struct DataType {int ID // No char name [10] // name char ch // sex char phone [13] // Phone char addr [31] // address} requirements: ? achieve the establishment of contacts, add, delete, modify, query and other functions to achieve a simple menu ? interaction, which can be based on user input commands, select a different operation. ? be able to save each update of data (selected for) ? contacts can be classified, such as the class category, friends class, black, etc. (selected for) ? writing test main () function to test the accuracy of the linear form
Date : 2026-01-07 Size : 2kb User : 贾森
[AI-NN-PR] XPoints DL : 0: 三个月的运行中该智能交易增长近 35倍仔细在货币对 EUR/USD图表中注视规律，你会发现柱的价格会产生转变： 1) rate = (High - Low) / MathAbs(Close-Open) 大于1 2) 低点 (Low)到通道的最低处 (价格可能上涨)或者高点(High)到通道的最高处(价格可能下降) 这种类型的柱被称作X-points. 指标按照参数寻找X-points， xrate (rate >= xrate) && (High-Low) >= xsize && (Up-Dn)>= xminupdn. 以 X-point 作为分析柱的信号来过滤虚假信号。虽然价格稍稍倾斜到预测方向，但柱的中间点和通道中间点之间的关系没有变化。 (查看指标代码) 参数: extern int per=3 - 通到创建的时间周期 extern double xrate=1.5 - 最小比例 extern double xsize=5.0 - 柱的最小高度 (High-Low) extern double xslope=0.0 - 下一个柱的最小增长 extern double xminupdn=10.0 - 通道的最小宽度 extern int xhour1=9 - 从通道内信号允许通过的最短时间 extern int xhour2=19 - 在通道内信号允许通过的最长时间 extern int xindent=15 - 图表中空格信号 (可以使用于止损)-The three-month run in an increase of nearly 35 times the expert Carefully in the currency pair EUR/USD chart, watching law, you will find that the price will have changed column: 1) rate = (High- Low)/MathAbs (Close-Open) greater than 1 2) low (Low) to the lowest channel (price likely to rise) or high (High) to the channel s highest point (the price may drop) This type of column is called X-points. Indicators in accordance with the parameters to find X-points, xrate (rate> = xrate) & & (High-Low)> = xsize & & (Up-Dn)> = xminupdn. The X-point as the analytical column to filter false signals the signal. While the price forecast slightly tilted to the direction, but the middle column point and the channel between the middle point of no change. (See indicator code) Parameters: extern int per = 3 - leads to the creation of the time period extern double xrate = 1.5 - the smallest proportion of extern double xsize = 5.0 - the minimum column height (
Date : 2026-01-07 Size : 1kb User : evanzhu
[AI-NN-PR] bashuma- DL : 0: 人工智能八数码问题实现八数码问题：在3×3的方格棋盘上，摆放着1到8这八个数码，有1个方格是空的，其初始状态如图1所示，要求对空格执行空格左移、空格右移、空格上移和空格下移这四个操作使得棋盘从初始状态到目标状态。 -#include <stdio.h>//定义变量 #include <stdlib.h>//定义变量 typedef struct s_node//定义创建节点 { struct s_node*father //定义父结点 struct s_node*prev struct s_node*next //定义下一个结点 int step //定义步骤为整形 int diff int weight int m[9] //定义m为9个整形数据 } node node*open_out(node*head) //open表输出节点 int open_insert(node*head, node*item) //定义open表插入节点为整形 int close_insert(node*head, node*item) //定义close表插入为整形 int inv_pair(int m[]) //定义m数据成对为整形 void swap(int*, int*) //定义空交换 int operate(int m[], int op) //定义操作 int diff(int m[], int n[])
Date : 2026-01-07 Size : 275kb User : 林莹莹
[AI-NN-PR] TSP DL : 0: tsp for (int i=0 i<M i++) S[i] = i S[M] = 0 T = 1000 //初始温度1000 Tl = 35000 //内循环次数35000 a = 0.93 //温度下降系数 k = 0 PreMin = 0 Path = GetPath(S) srand((unsigned)time( NULL )) cout<<"The initial Path Distence is: "<<Path<<endl return true -tsp for (int i=0 i<M i++) S[i] = i S[M] = 0 T = 1000 //初始温度1000 Tl = 35000 //内循环次数35000 a = 0.93 //温度下降系数 k = 0 PreMin = 0 Path = GetPath(S) srand((unsigned)time( NULL )) cout<<"The initial Path Distence is: "<<Path<<endl return true
Date : 2026-01-07 Size : 21kb User : ningning
[AI-NN-PR] lunwen DL : 0: 新一代高性能无人机飞控系统的研究与设计张小林赵宇博范力思-I n o r de r t o cau se t he U A V f lig ht co nt r o l sy st e m has t he f o r mida ble da t a- ha ndling ca pa cit y , t h e lo w po we r lo ss , t he st r o ng f le x ibilit y an d a hig he r int e g r at io n r a t e, pr o po sed o ne kind of t e chn ol og y ba sed on SO P C w hic h ca n so lv e t hes e p r ob lem s o n U A V f lig ht co n t r o l sy st e m. T r a nsf e r s m any N io s so f t pr o c ess o r . A lt e r a br in gi ng t he I P co r e a s w el l as t he per ip her y ha r dw a r e cir c uit . on e kind o f h ig h per f o r man ce f lig ht co nt r o l sy st em h as be en de sig ned. Co mpa r e s w it h t he t r a diti on al U A V co nt r o l sy s te m, t his o ne hav e ve r y st r o ng dat a handl ing capa cit y , t h e sma ll v o lume a nd lo w po w e r lo s s. T he a ct ua l fl ig ht r esul t indic at e d : Ea ch m odu la r de sig n is r ea so nab le, t he o ve r al l sy st em mo v e ment is st a ble. T his sy st e m ca n b e ser ve d a s t he ne x t g ene r
Date : 2026-01-07 Size : 606kb User : 天下
[AI-NN-PR] StateMachine DL : 0: 一个有限状态机的编程范例 StateMachine包状态机管理 IStateMachine.as 状态机接口 MyEvent_Control.as 消息管理,状态管理 MyEvent_Single.as 单个事件 Total.as 实现了状态机接口(IStateMachine)的基类,将其理解为抽象类比较好 A.as 继承基类(Total)的状态机,这个才是真正可用的 B.as 同A Main.as 调用,以及启动若要使用本状态机前提: 1.你的基类名字叫basis.as 2.你继承基类的名字static.as 对应: 1.basis.as -- 相当于 Total.as 2.static.as -- 相当于 A.as 类功能: 参考"类说明.txt" 注: 1.管理类为静态类使用“MyEvent_Control.istanceFun() ”来取到实例消息部分-公开 -- //供外部调用的发送消息 send() 状态机部分--公开 -- //绑定一个状态机 add_StateMachine(_idx) -- //开启状态机 Start_StateMachine(_modo:int=0,_idx=null) -- //状态更新 stateUpdate(_idx,str) 2.关于全局消息,和局部消息中 -- 使用 "e.sender" 来获取消息的发送者-A state machine programming paradigm StateMachine package management IStateMachine.as state machine interfaces MyEvent_Control.as message management finite state machine, state management MyEvent_Single.as single event Total.as implements a state machine interfaces (IStateMachine) base class, be understood as An abstract class is better A.as inherit the base class (Total) state machine, this is the real available B.as with A Main.as calls, and start to use the state machine premise: a name of your base class You inherit called basis.as 2 corresponds to the base class name static.as:. 1.basis.as- equivalent Total.as 2.static.as- functional equivalent A.as: Refer to " class description txt " Note: 1 static class management class to use." MyEvent_Control.istanceFun () " to get to the instance of the message part- publicly-// for external calls to send a message send () state machine part- publicly-// bind a state machine add_StateMachine (_idx)-// open state machine Star
Date : 2026-01-07 Size : 17kb User : 可了
[AI-NN-PR] ANN DL : 0: 先用BP神经网络算法对国民经济生产总值做预测，然后用灰色预测模型GM(1,1)做预测，最后将两者结合建立组合预测模型。-Firstly,the BP artificial neural network algorithm to predict the GDP and then construct the GM(1,1) model,at last build out the combined model to predict the GDP int the future.
Date : 2026-01-07 Size : 2kb User : 张玲玲
[AI-NN-PR] passlkst_box DL : 0: 编制具有如下原型的函数prime,用来判断整数n是否为素数：bool prime(int n) 而后编制主函数,任意输入一()
Date : 2026-01-07 Size : 6kb User : iteoate
[AI-NN-PR] suxpgil DL : 0: LCS,即最常公共子序列的的C语言解法,prepare_for_backdate(char,char,int,int)函数()
Date : 2026-01-07 Size : 716kb User : culbifatioz
[AI-NN-PR] work2.6 DL : 0: 实现控制规则为T=int（(e+e1)/2）的模糊神经网络控制器(A fuzzy neural network controller with T=int ((e+e1) /2) control rule is implemented.)
Date : 2026-01-07 Size : 1kb User : 随lab
[AI-NN-PR] 超级刷单王 DL : 0: 超级刷单王外部参数详解： extern int Profit = 70;//目标盈利点数，注意该EA按5位数报价的 extern int gi_maxbuy = 6;//买单最大单数，该EA理论上可以操作的上限为13，但是13单很吓人的！ extern int gi_maxsell = 6;//卖单的…… extern int gi_addstep = 50;//1-6单加码间距基数；加码间距= 基数×系数的单量次方；不过是否加仓还取决于上一根柱子的阴阳，也就是说实际的间距只要超过这个数就行，不一定等于这个数。 extern int Prosadka = 1500;//7-max 加仓间距基点数参考 extern int Povtor = 1;//下单错误后休眠分钟数 extern bool gi_lot_Personalized = FALSE;//是否人为设定第一单手数；若否，系统自动(warehouse still depends on the Yin and Yang of the previous column, that is to say, the actual spacing only needs to exceed this number, which is not necessarily equal to)
Date : 2026-01-07 Size : 98kb User : like8