Search - ai - CodeBus

Search - ai - List

[Algorithm] A算法详细解答 DL : 0: 这里有人工智能的A*算法看能不能帮到你。。我是在里面得到了不少的经验的-here is the AI A* algorithm can do to help you. . I was there to be a lot of experience
Date : 2026-01-10 Size : 10kb User : 林小雨
[Algorithm] gobang_v1.0 DL : 0: 人工智能五子棋的实现。AI算法比较高，至少我下不过-Gobang the realization of artificial intelligence. AI algorithm is relatively high, at least I am, however, under
Date : 2026-01-10 Size : 170kb User : bz
[Algorithm] longest DL : 0: Problem B:Longest Ordered Subsequence A numeric sequence of ai is ordered if a1 < a2 < ... < aN. Let the subsequence of the given numeric sequence (a1, a2, ..., aN) be any sequence (ai1, ai2, ..., aiK), where 1 <= i1 < i2 < ... < iK <= N. For example, sequence (1, 7, 3, 5, 9, 4, 8) has ordered subsequences, e. g., (1, 7), (3, 4, 8) and many others. All longest ordered subsequences are of length 4, e. g., (1, 3, 5, 8). -Problem B: Longest Ordered SubsequenceA numeric sequence of ai is ordered if a1 <a2 <... <aN. Let the subsequence of the given numeric sequence (a1, a2, ..., aN) be any sequence (ai1, ai2, ..., aiK), where 1 <= i1 <i2 <... <iK <= N. For example, sequence (1, 7, 3, 5, 9, 4, 8) has ordered subsequences, eg, ( 1, 7), (3, 4, 8) and many others. All longest ordered subsequences are of length 4, eg, (1, 3, 5, 8).
Date : 2026-01-10 Size : 1kb User : hzf
[Algorithm] AStar DL : 0: 实现人工智能中的AI自动寻找路径，可以在实现起点和终点之间寻找最短的跨越障碍的路径-AI Artificial Intelligence to achieve automatic search path, you can achieve between the start and finish to find the shortest path across barriers
Date : 2026-01-10 Size : 259kb User : Liangyonghua
[Algorithm] 1-9 DL : 0: 1-9数字填入三个分式的a-i中，使a/bc+d/ef+g/hi=1成立-1-9 the number of fill in the three fraction of ai, so that a/bc+ d/ef+ g/hi = 1 to set up
Date : 2026-01-10 Size : 60kb User : tianyin
[Algorithm] hopfield DL : 0: Binary Hopfiled Networks programming in AI cla-Binary Hopfiled Networks programming in AI class
Date : 2026-01-10 Size : 9kb User : dongrui
[Algorithm] Gauss_Complex DL : 0: 采用全选主元高斯消去法，求解复系数线性方程组。其中ar存方程组复系数矩阵实部，ai存虚部。br存右端向量实部，返回解向量实部；bi存右端向量虚部，返回解向量虚部。-With full pivoting Gaussian elimination, solving linear equations. Ar equations which keep the real part of complex coefficient matrix, ai keep the imaginary part. br keep the real part of the right end of vector, returns solution vectors of the real part bi deposit right end of the vector imaginary part, imaginary part to return solution vector.
Date : 2026-01-10 Size : 2kb User : Shepard
[Algorithm] C_J_Complex DL : 0: 采用全选主元高斯－约当消去法求解复系数线性代数方程组。其中ar存放复系数矩阵实部，ai存放复系数矩阵虚部。br存放右端复常数向量实部，返回解向量实部；bi存放右端复常数向量虚部，返回解向量虚部。-With full pivoting Gauss- Jordan elimination method for solving linear algebraic equations with complex coefficients. Which ar stored real part of complex coefficient matrix, ai imaginary part of coefficient matrix storage complex. br right end storage complex real constant vector, returns solution vectors of real bi kept constant vector imaginary part of the right end of rehabilitation, return solution vector imaginary.
Date : 2026-01-10 Size : 1kb User : Shepard
[Algorithm] AI DL : 0: 导弹拦截飞机的源代码，通过算出两者间的距离，时间差，速度，利用拦截算法算出相关数值，从而实现-Aircraft missiles to intercept the source code, through the calculated distance between the two, the time difference, speed, calculated using the relevant numerical algorithm block in order to achieve
Date : 2026-01-10 Size : 4.15mb User : 哈哈哈
[Algorithm] AI DL : 0: 福州大学姜志渊编写的滑块求解系统（即8数码），有8种搜索算法。界面非常漂亮。-Fuzhou University Jiang Zhiyuan prepared slide solving system (ie, 8 digital), there are eight kinds of search algorithms. Interface is very beautiful.
Date : 2026-01-10 Size : 2.45mb User : 王桂平
[Algorithm] cinv DL : 0: 一般复矩阵求逆，cinvo.c中的static double ar[4][4]为复矩阵的实部，static double ai[4][4]为复矩阵的虚部。-General complex matrix inversion, cinvo.c the static double ar [4] [4] for the real part of complex matrix, static double ai [4] [4] for the imaginary part of complex matrix.
Date : 2026-01-10 Size : 1kb User : houmeng
[Algorithm] HeapMergeSort DL : 0: Sorting by Heapsort and Mergesort algorithms. =================================== Input file：H01dat.txt ---------------------------- 包含第一列為n a b 第二列以後為a1 a2 a3 a4 ...... an n：要排序的輸入資料數。 ai：要排序的資料，以space 或換行隔開，程式要能自行判斷資料輸入到n筆為止。 -------------------------------------Output：使用標準輸出〈即輸出到螢幕〉 -------------------------------------a：若a = 1，使用heapsort；若a = 2，使用mergesort。 b：若b = 1，則顯示排序後的結果〈由小到大〉；若b = 2 且a = 1，則輸出Heapsort前兩次的過程(包含Heapify 過程)；若b = 2 且a = 2，Megersort 則輸出前五次sort 的過程。 -Sorting by Heapsort and Mergesort algorithms. =================================== Input file: H01dat.txt--------------------------- nab the second column contains the first column after the a1 a2 a3 a4 ...... an n: to the number of input data sorted. ai: to sort the data, separated by space or newline, the program must be able to judge for themselves the information input to the n pen up.------------------------------------- Output: standard output < that is output to the screen> ------------------------------------ a: if a = 1, using the heapsort if a = 2, using mergesort. b: If b = 1, then display the results sorted < steeled> if b = 2 and a = 1, the output Heapsort during the last two (including Heapify process) if a = b = 2 and 2, Megersort sort the output process of the previous five.
Date : 2026-01-10 Size : 7kb User : cjwang
[Algorithm] Matrix-Chain_JAVA DL : 0: Matrix Chain Multiplication is perhaps the quintessential example of dynamic programming. The problem can be stated as follows: given a chain <A1, A2,..., An> of n matrices, where for i = 1, 2,...,n, matrix Ai has dimension pi-1 x pi, fully parenthesize the product A1A2...An in a way that minimizes the number of scalar multiplications.
Date : 2026-01-10 Size : 1kb User : Justas
[Algorithm] Matrix-multiplication-problems-with DL : 0: 给定n个矩阵{A1,A2,…,An}，其中Ai与Ai+1是可乘的，i=1,2,…,n-1。要算出这n个矩阵的连乘积A1A2…An。由于矩阵乘法满足结合律，故计算矩阵的连乘积可以有许多不同的计算次序。这种计算次序可以用加括号的方式来确定。若一个矩阵连乘积的计算次序完全确定，也就是说该连乘积已完全加括号，则可以依此次序反复调用2个矩阵相乘的标准算法计算出矩阵连乘积。本文的功能是采用动态规划算法，给出矩阵的一种最优的加括号方式，是计算量最小。-Given n matrices {A1, A2, ..., An}, where Ai and Ai+1 is a mere of, i = 1,2, ..., n-1. To calculate the n matrix with the product A1A2 ... An. Since matrix multiplication to meet with law, so the calculation of the matrix with the product can have many different calculation order. This calculation can be bracketed in order to determine ways. Even if the product of a matrix calculation to determine the complete sequence, that the product is fully bracketed with, so you can call the order of 2 repeated the standard matrix multiplication algorithm to calculate the matrix with the product. This feature is the use of dynamic programming algorithm, a matrix is given in parentheses best way is to calculate the minimum amount.
Date : 2026-01-10 Size : 13kb User : 阿四
[Algorithm] mgjyxl DL : 0: 第一个把专家青睐的数学模型技术（NNM 算法模型）引入词汇记忆软件中，并取得了巨大的成功。NNM 算法模型与经典的“艾滨豪斯遗忘曲线”真正的融合于一体，使得该著名的理论在计算机与数学模型下第一次得到了淋漓尽致的发挥。-First a mathematical model of the popular technology expert (NNM algorithm model) the introduction of vocabulary learning software, and has achieved great success. NNM algorithm model and the classic " Ai Bin House forgetting curve" true integration in one, making the well-known theory in computer and mathematical models has been most vividly the first time under play.
Date : 2026-01-10 Size : 34kb User : boobsoft
[Algorithm] code DL : 0: This contains c- c++ code for AI problems like 8 puzzle, 15 puzzle and nqueens problem
Date : 2026-01-10 Size : 9kb User : luffykaizoku
[Algorithm] chaosongchi DL : 0: 松弛法简称SOR方法，也叫张弛发，其基本思想是迭代，即在高斯方法已求出x(i),x(i-1)的基础上，组合新的序列，从而加快收敛速度。采用列主元素消去法是在Gauss消去法在强条件下进行的，即Ai非奇异，逐次消去一个未知数。只要方程组的系数矩阵非奇异，方程组就有唯一解。这样对列选主元，称为列主元素消去法。其应用条件为每次变化中主元素不等于且系数矩阵Ai非奇异。-Relaxation method referred to as SOR method, also called relaxation hair, the basic idea is iterative, that is, the Gaussian method has been derived x (i), x (i-1), based on the combination of the new sequence, thus speeding up the convergence rate . Out the main elements used in the Gauss elimination method is the elimination of the strong conditions, that is, Ai is nonsingular, successive elimination unknown. As long as the equations of non-singular coefficient matrix, equations have a unique solution. This column pivoting on, called out the main elements of elimination. The application conditions for each main element of change is not equal and non-singular coefficient matrix Ai.
Date : 2026-01-10 Size : 8kb User : 咪噜
[Algorithm] juzhenliancheng DL : 0: 给定n个矩阵A1，A2，…，An，其中，Ai与Aj+1是可乘的，i=1，2，…，n-l。你的任务是要确定矩阵连乘的运算次序，使计算这n个矩阵的连乘积A1A2…An时总的元素乘法次数达到最少。 -Given n matrices A1, A2, ..., An, which, Ai and Aj+1 is multiplicative in, i = 1,2, ..., nl. Your task is to determine the matrix multiplication operation with the order to calculate the product of n matrices even when A1A2 ... An element of the total number of multiplications to a minimum.
Date : 2026-01-10 Size : 135kb User : 张西
[Algorithm] LaVolpe_Path_Finder DL : 0: AI pathfinder for large maps - 2nd try. This is a unique approach and is fastest version.
Date : 2026-01-10 Size : 44kb User : frozenade
[Algorithm] AI-Kohonen DL : 0: AI Kohonen algorithm
Date : 2026-01-10 Size : 2kb User : iamIcarus

« 12 »