Search - COST 2

Search - COST 2 - List

[AI-NN-PR] 模拟退火源码 DL : 0: 模拟退火算法模拟退火算法(Simulated Annealing,简称SA算法)是模拟加热熔化的金属的退火过程，来寻找全局最优解的有效方法之一。模拟退火的基本思想和步骤如下：设S＝{s1,s2,…,sn}为所有可能的状态所构成的集合， f：S—R为非负代价函数，即优化问题抽象如下：寻找s*∈S，使得f(s*)＝min f(si) 任意si∈S （1）给定一较高初始温度T，随机产生初始状态S （2）按一定方式，对当前状态作随机扰动，产生一个新的状态S’ S’＝S＋sign(η).δ 其中δ为给定的步长， η为[－1,1]的随机数-simulated annealing algorithm (Simulated Annealing, or SA algorithm) is a simulation of heating molten metal in the annealing process, to find the global optimum one of the effective ways. Simulated Annealing basic ideas and the steps are as follows : S = (s1, s2, ..., sn) for all possible state posed by the pool, f : S-R non-negative cost function, that is abstract optimization problems are as follows : Find S* s, making f (s*) = min f (si) arbitrary si S (1) to set a higher initial temperature T, randomly generated initial state S (2) of a certain form, the current state of random disturbance, have a new state S 'S' = S+ sign (). delta where given for the step, [-1,1] Random Number
Date : 2025-12-25 Size : 54kb User :
[AI-NN-PR] 231565262 DL : 0: 对于个顶点的连通网可以建立许多不同的生成树，每一棵生成树都可以是一个通信网。现在，我们要选择总的耗费最小的那棵树，这就是我们说的最小生成树。本次课程设计就是设计这样的生成树，-for network connectivity can be established in many different spanning tree, every one spanning tree can be a communications network. Now, we have to choose the least total cost of the tree, this is what we call the minimum spanning tree. The curriculum design is to design such a spanning tree,
Date : 2025-12-25 Size : 1kb User : 大垃圾
[AI-NN-PR] LeHeHe2009_2_17 DL : 0: 华泰证券公司股票交易时有关费用明细及交易利润得到。有关费率可根据实际开户公司更改-Huatai Securities Company stock when the cost details and trading profits. The relevant rates can be changed according to the actual account
Date : 2025-12-25 Size : 38kb User : 高继林
[AI-NN-PR] TravelingSalespersonProblem_TSP_codes DL : 0: Traveling Salesperson Problem Our branch-and-strategy splits a branch and bound solution into two groups: one group including a particular arc and the other excluding this arc. 1.Each splitting incurs a lower bound and we shall traverse the searching tree with the "lower" lower bound. 2.If a constant subtracted from any row or any column of the cost matrix, an optimal solution does not change.
Date : 2025-12-25 Size : 132kb User : 黃文岩
[AI-NN-PR] minmax DL : 0: 最小费用最大流算法可以用-Minimum cost maximum flow algorithm can be used
Date : 2025-12-25 Size : 3kb User : 陈燕
[AI-NN-PR] Supply_Chain_Management DL : 0: 供应链管理实用建模方法及数据挖掘本书包括：经济全球化及企业竞争优势、供应链管理理论、供应链本流及其定量分析方法、提高供应链管理的运作绩效等内容。简明目录： 1.经济全球化及企业竞争优势/2.供应链管理理论/3.供应链成本流及其定量分析方法/4.提高供应链管理的运作绩效/5.几种数据驱动型建模方法/6.产品供应链中的数据挖掘技术/7.供应链契约//参考文献-Supply Chain Management Modeling and Data Mining practical book include: Economic Globalization and competitive advantage, supply chain management, supply chain and the quantitative analysis of the flow, improve operational performance in supply chain management and so on. Concise catalog: 1. Economic globalization and competitive advantage/2. Supply chain management theory/3. Supply chain cost stream and its quantitative analysis/4. Improve the operational performance of supply chain management/5. Several data-driven construction model approach/6. product supply chain data mining/7. Supply Chain Contract// References
Date : 2025-12-25 Size : 3mb User : showna
[AI-NN-PR] minipar-0.5-Windows DL : 0: 基于依赖的英文词法分析器，能分出词的此性，句子单词的关系-The program is provided "as is" without warranty of any kind, either expressed or implied, including, but not limited to, the implied warranties of merchantability and fitness for a particular purpose. The entire risk as to the quality and performance of the program is with you. Should the program prove defective, you assume the cost of all necessary servicing, repair or correction.
Date : 2025-12-25 Size : 9.19mb User : ganxingchao
[AI-NN-PR] a-star-and--program DL : 0: 采用C语言编写，带源程序demo，本程序算法侧重使用a star实际解决在静态路网中以最快的速度，最小的代价搜寻地图或迷宫的最佳路径（可能不唯一），重点在于游戏中的NPC自动寻路-Using C language with source code demo, the program algorithm focuses a star practical solutions in the static road network to the fastest speed, minimize the cost of searching for the best map or maze path (may not be unique), with emphasis on the game automatically find its way in the NPC
Date : 2025-12-25 Size : 15kb User : 万松林
[AI-NN-PR] VRP DL : 0: 蚁群算法，2-opt，解决车辆路径问题（vrp）的matlab代码，修正了原始代码忽略初始节点下一节点cost的问题，但是对某些测试数据集存在车辆数大于或小于的标准问题。-Ant colony algorithm ,2-opt, vehicle routing problem (vrp) matlab code, amended the original code ignores the initial node next node cost problems, but for some test data sets exist more or less than the number of vehicles of standard questions.
Date : 2025-12-25 Size : 2kb User : lijian
[AI-NN-PR] ba_shu_ma_wen_ti DL : 0: 用人工智能领域中经典的A*算法解决了人工智能中常见的八数码问题。本文首先介绍了八数码问题,然后对A*算法进行了解释。针对八数码问题给出并证明了路径不存在时的条件,并事先作了判定。定义了灵活的估价函数,分析了估价函数对程序效率的影响,并对Closed表进行了若干优化,提高了搜索效率,取得了较好的效果。-With the field of artificial intelligence in the classic A* algorithm to solve a common artificial intelligence eight digital problem. This paper introduces the eight digital issues, and then the A* algorithm is explained. For eight digital path is not given and proved the presence of the conditions and made a determination in advance. Valuation function defines a flexible, cost function analysis of the impact of the program efficiency, and Closed table several optimized to improve search efficiency, and achieved good results.
Date : 2025-12-25 Size : 692kb User : pw
[AI-NN-PR] Cluster_K-means DL : 0: k中心算法的基本过程是:首先为每个簇随意选择一个代表对象，剩余的对象根据其与每个代表对象的距离（此处距离不一定是欧氏距离，也可能是曼哈顿距离）分配给最近的代表对象所代表的簇；然后反复用非代表对象来代替代表对象，以优化聚类质量。聚类质量用一个代价函数来表示。当一个中心点被某个非中心点替代时，除了未被替换的中心点外，其余各点被重新分配。-The basic process k center algorithm is: First free to choose a delegate object for each cluster, the rest of the object based on its distance each of which represents the object (here the distance is not necessarily a Euclidean distance, Manhattan distance may be) allocated to Recently representatives object represents a cluster and then repeatedly with representatives of non-objects instead represents the object, in order to optimize the quality of clustering. Clustering quality is represented by a cost function. When a center is a non-center alternative, in addition to not replace the center, the rest of the points to be reallocated.
Date : 2025-12-25 Size : 2.76mb User : 闫鑫