Search - columns

Search - columns - List

[AI-NN-PR] wupusworld DL : 0: 巫魔世界是一个被墙所环绕的二维格子世界，相邻格子相通，洞穴在左下角。每一个格子可以包含agent或物体。考虑到格子世界的大小对于本次问题的讨论不具绝对的影响，因此设定格子世界的行和列均为N，因此在本实验中，巫魔世界是一个N*N的二维格子，将世界中格子以行和列的二元组标示，因此洞穴入口在[1,1]。本程序实现了一个巫魔世界小游戏。-Umoja world is surrounded by a wall of two-dimensional lattice world, adjacent to the same lattice, holes in the bottom left corner. Each lattice can contain agent or object. Taking into account the lattice size of the world for this discussion does not have an absolute impact, so set the world lattice rows and columns are N, therefore in this experiment, Umoja is a world N* N of the two-dimensional lattice will be world of lattice rows and columns in the dual group marked, so the cave entrance in the [1,1]. This procedure implements a Umoja game world.
Date : 2025-12-26 Size : 35kb User : heavenflames
[AI-NN-PR] hanlo DL : 0: 如图所示放置3根柱子，其中一根从上往下按由小到大顺序串有若干个圆盘，要求通过3根柱子移动圆盘。若规定每次只能移动1片，且不许大盘放在小盘之上，最后要将圆盘从一根柱子移动到另一根柱子上。-Placed as shown in Figure 3 columns, in which a top-down according to the order from small to big series there are a number of disc, called for the adoption of three pillars for mobile disk. If the provisions of each can only move one, and not allowed on the market on small-cap, and finally to the disc from a pole to move to another post.
Date : 2025-12-26 Size : 23kb User : song821
[AI-NN-PR] gauss DL : 0: 输入一个几行几列的数组，然后用高斯算法对其进行求解-Enter a few lines and a few columns of the array, and then solve it with the Gaussian algorithm
Date : 2025-12-26 Size : 2kb User : 燕子
[AI-NN-PR] 01imp_accord-svm-source DL : 0: The sample application is able to perform both Classification and Regression using Support Vector Machines. It can read Excel spreadsheets and determines the task to be performed depending on the number of the columns in the sheet. If the input table contains two columns (e.g. X and Y) it will be interpreted as a regression problem X –> Y. If the input table contains three columns (e.g. x1, x2 and Y) it will be interpreted as a classification problem <x1,x2> belongs to class Y, Y being either 1 or -1.
Date : 2025-12-26 Size : 497kb User : jitesh
[AI-NN-PR] nearestneighbour DL : 0: Compute nearest neighbours (by Euclidean distance) to a set of points of interest from a set of candidate points. The points of interest can be specified as either a matrix of points (as columns) or indices into the matrix of candidate points. Points can be of any (within reason) dimension. nearestneighbour can be used to search for k nearest neighbours, or neighbours within some distance (or both) If only 1 neighbour is required for each point of interest, nearestneighbour tests to see whether it would be faster to construct the Delaunay Triangulation (delaunayn) and use dsearchn to lookup the neighbours, and if so, automatically computes the neighbours this way. This means the fastest neighbour lookup method is always used.
Date : 2025-12-26 Size : 30kb User : nadir
[AI-NN-PR] hannuota DL : 0: 汉诺塔。。传说婆罗门庙里有一个塔台，台上有3根标号为A,B,C的用钻石做成的柱子，在A柱子上放着64个金盘，每一个都比下面的略小一些。把A柱子上的金盘子全部移到C柱上的那一天就是世界末日。移到的条件是：一次只能移到一个金盘，移到过程中大金盘不能放在小金盘上面。庙里的僧人一直在移个不停。因为全部的移动是264－1次，如果每秒移动一次的话需要500亿年。-Tower of Hanoi. . Legend of a Brahmin temple tower, the platform has three labels as A, B, C of the columns made with diamonds, stood in the A pillar 64 gold plate, each slightly smaller than the following. A pillar of the golden plates to move all of column C is the end of the world that day. Moved to the condition that: you can only move to a gold disk, disk can not move the process on the golden plate Daikin above. Temple of monks have been moved off the hook. As all movement is 264-1 times, if the second move would require 50 billion a year.
Date : 2025-12-26 Size : 8kb User : yinlingzhi
[AI-NN-PR] game DL : 0: 一付扑克牌52张共4种花色，使用C++ 中的产生随机数的函数（参看rand(),srand()等函数的使用说明）一个随机数，选取一张牌，将其与最前面的牌交换位置，即将选取的牌放在最前面；然后对数组p余下的牌重复选取操作，直到所有牌均重排列；最后按13行*4列输出发牌结果-A pair of playing cards 52 of 4 kinds of colors, the use of C++, random number generation function (see rand (), srand () and other functions for use) a random number, select a card, with the top of its card exchange position, will select the top card on and then the rest of the array p card selection operation repeated until all the cards are re-arranged the last 4 columns by 13 rows* output the results of the licensing
Date : 2025-12-26 Size : 513kb User : kaishuiping
[AI-NN-PR] hannuotachengxu DL : 0: 首先把三根柱子按顺序排成品字型，把所有的圆盘按从大到小的顺序放在柱子A上，根据圆盘的数量确定柱子的排放顺序：若n为偶数，按顺时针方向依次摆放 A B C；若n为奇数，按顺时针方向依次摆放 A C B。-First, the three pillars of order to the finished fonts, all the disks in sequence on the pillar by A, according to the number of disk emission to determine the order of columns: if n is even, turn clockwise placed ABC if n is odd, in a clockwise direction in order placed ACB.
Date : 2025-12-26 Size : 2kb User : 刘晓晶
[AI-NN-PR] hannuota DL : 0: 一个塔台，台上有3根标号为A,B,C的用钻石做成的柱子，在A柱子上放着64个金盘，每一个都比下面的略小一些。把A柱子上的金盘子全部移到C柱上的那一天就是世界末日。移到的条件是：一次只能移到一个金盘，移到过程中大金盘不能放在小金盘上面。庙里的僧人一直在移个不停。因为全部的移动是264－1次，如果每秒移动一次的话需要500亿年-A tower on the stage with three labeled A, B, C of the columns made with diamonds, stood in the A pillar 64 gold plate, each slightly smaller than the following. A pillar of the golden plates to move all of column C is the end of the world that day. Moved to the condition that: you can only move to a gold disk, disk can not move the process on the golden plate Daikin above. Temple of monks have been moved off the hook. As all movement is 264-1 times, if the move once per second needs 500 million years, then
Date : 2025-12-26 Size : 83kb User : 王一帆
[AI-NN-PR] HRD DL : 0: 求解华容道最少步数，包括“横刀立马”、"指挥若定"、"将拥曹营"、"齐头并进"、"兵分三路"等各种开局。-Minimum number of steps to solve Huarong, including " Hengdao immediately," " commanding," " will pro-Cao Ying," " go hand in hand" , " soldiers in three columns," and other start.
Date : 2025-12-26 Size : 20kb User : actionLv
[AI-NN-PR] DQFX DL : 0: 。计算方法点群分析应用程序允许数据文件的最大行数（样品数）为2000，最大列数（变量数）为30。如果用户需要更大的行列数，必须修正源代码的数组空间。 -. The calculation of point-group analysis of the application allows the maximum number of rows of data files (sample number) 2000, the maximum number of columns (variables) is 30. If the user requires a greater number of ranks, you must amend the source code of an array of space.
Date : 2025-12-26 Size : 19kb User : zhudeli
[AI-NN-PR] encode-and-decode-of-shop-job DL : 0: 用于车间调度的编码和解码。 encode函数用于生成M*N的编码数组。M为机器数，N为工件数。 Jm数组的行，表示对应工件在不同机器上的加工顺序。数组内容为机器号。 T数组为加工时间数组。第M行第N列，表示第N号工件在第M号机器上的加工时间。程序采用先判断对应机器上是否有空间满足插空标准，处理后，再判断是否产生新的空间。 decode解码函数最终需要求得，在M个机器中，所用的最长时间，也就是最大完成时间，作为解码的结果。-For shop scheduling encoding and decoding. The encode function used to generate the array of M* N coding. M is the number of machines, N is the number of workpieces. Jm row of the array, which means that the corresponding workpiece machining sequences on different machines. The contents of the array is the number of the machine. T array is an array of processing time. The first N columns of the M-th row, which means that the processing time of the workpiece in the machine M N. The program uses to determine whether there is space to meet the inserted empty standard corresponding to the machine, processing, and then to determine whether a new space. decode decoding function will eventually need to be obtained, M machine, the best time, which is the maximum completion time, as a result of the decoding.
Date : 2025-12-26 Size : 2kb User : 郑世杰
[AI-NN-PR] main DL : 0: n个最小数问题，即对于给定的n*n个随机数，从中找出n个最小的数，且这n个数来自不同的行和列-N most decimal problems, namely, for a given n*n a random number, find the smallest number from n, and the N number from different rows and columns
Date : 2025-12-26 Size : 1kb User : 何一鸣
[AI-NN-PR] shangchuanranking DL : 0: 按照个体的目标函数值由小到大对它们进行排序并返回包含对应个体适应度值的列向量-According to the objective function value of the individual small to large to sort them and return contains columns for the individual fitness value
Date : 2025-12-26 Size : 2kb User :
[AI-NN-PR] gaot_and-material DL : 0: 最近在学习遗传算法工具箱，对比了多个工具箱之后，网上都说gaot工具箱最权威了，然后比较容易就下载下来了。可是其学习资料比较难下，而且安装有困难。我在论坛里没有搜索到相关资料，所以就冒昧的将这些资料上传上来了。本附件包含了gaot遗传算法工具箱、安装说明、及其使用指导。使用指导包括了三个pdf文件，第一是简单的讲解美国北卡罗来纳州立大学编写的《Genetic Algorithm Optimization Toolbox 》(GAOT遗传算法优化工具箱)的使用的方法，适合与初学者的。第二是《MATLAB遗传算法工具箱_GAOT_在水资源优化计算中的应用》是一个使用案例。最后是一本书《MATLAB6.5辅助优化计算与设计》的第五章有相关内容。虽然列了三个学习资料，但资料还是比较简单、浅薄，要想学好gaot工具箱还得靠工具箱中的m文件看其说明。本人也是菜鸟一个，和大家一起学习，所以这些资料还没有看，过一段时间之后才会有所涉及，所以有相关问题我也解决不了。希望对大家有所帮助。-After recently learning genetic algorithm toolbox, compared to more than one toolbox, toolbox gaot online say the most authoritative and relatively easy to download down. But it is more difficult to study materials under, and installation difficulties. I do not have to search for relevant information in the forum, so I will take the liberty of uploading this information will come up. This annex contains gaot genetic algorithm toolbox, installation instructions, directions for its use. Tutorial includes three pdf files, the first is simple to explain North Carolina State University prepared Genetic Algorithm Optimization Toolbox (GAOT Genetic Algorithm Optimization Toolbox) method to use, suitable for beginners. The second is MATLAB genetic algorithm toolbox _GAOT_ Water Resources Optimization Calculation is a use case. The last is a book MATLAB6.5 assisted optimization and design chapter related content. Although three columns learning materials, but the data is relatively sim
Date : 2025-12-26 Size : 6.92mb User : 陈炳任