Search - COST 2

Search - COST 2 - List

[Other] pathfinding DL : 0: prolog 找路例子程序： === === === Part 1-Adding connections Part 2-Simple Path example | ?- path1(a,b,P,T). will produce the response: T = 15 P = [a,b] ? Part 3 - Non-repeating path As an example, the query: ?- path2(a,h,P,T). will succeed and may produce the bindings: P = [a,depot,b,d,e,f,h] T = 155 Part 4 - Generating a path below a cost threshold As an example, the query: ?- path_below_cost(a,[a,b,c,d,e,f,g,h],RS,300). returns: RS = [a,b,depot,c,d,e,g,f,h] ? RS = [a,c,depot,b,d,e,g,f,h] ? no ================================== -prolog to find a way examples : ==================================== Part 1-Adding connections Part 2- Simple Path example |- path1 (a, b, P, T). will produce the response : T = 15, P = [a, b] Part 3-Non-repeating path As an example, the query :-path2 (a, h, P, T). will succeed and may produce the bindings : P = [a, depot, b, d, e, f, h] T = 155 Part 4-Generating a path below a cost threshold As an example, the query :-path_below_cost (a, [a, b, c, d, e, f, g, h], RS, 300). returns : RS = [a, b, depot, c, d, e , g, f, h] RS = [a, c, depot, b, d, e, g, f, h] no =====================
Date : 2025-12-25 Size : 2kb User : Fa
[Other] jiegousheji_4 DL : 0: 对不用其他装配零件而永久性联结的塑料零件的装配可采用焊接方法。焊接方法的选择依据以下几种标准：根据模塑零件的几何形状，所使用的原料, 成本、总生产周期的综合因素，装配部位所要求的机械性能和外观质量。-right no other assembly parts and the permanent link to the assembly of plastic parts available welding methods. Welding method of choice based on the following criteria : Molded parts of the geometry, the use of raw materials, cost, Total production cycle by a combination of factors, the assembly of parts required by the mechanical properties and appearance of quality.
Date : 2025-12-25 Size : 133kb User : 凌峰
[Other] MaximumFlow DL : 0: 最大最小流程序。包括最大流网络，最小费用最大流。算法的一些实现。-Max-min flow procedures. Including the maximum flow network, minimum cost maximum flow. Some of realize algorithm.
Date : 2025-12-25 Size : 108kb User : HuiCong
[Other] 4 DL : 0: 求最小代价生成树（Prim算法和Kruskal算法）-Order to minimize the cost of spanning tree (Prim algorithm and Kruskal algorithm)
Date : 2025-12-25 Size : 1kb User :
[Other] jifang DL : 0: 机房的管理，包括上下机，结账，统计费用所用时间等-Room management, including upper and lower machine, checkout, statistics used in the cost of time
Date : 2025-12-25 Size : 2kb User : bajoige
[Other] kruskal DL : 0: K r u s k a l算法每次选择n- 1条边，所使用的贪婪准则是：从剩下的边中选择一条不会产生环路的具有最小耗费的边加入已选择的边的集合中。注意到所选取的边若产生环路则不可能形成一棵生成树。K r u s k a l算法分e 步，其中e 是网络中边的数目。按耗费递增的顺序来考虑这e 条边，每次考虑一条边。当考虑某条边时，若将其加入到已选边的集合中会出现环路，则将其抛弃，否则，将它选入。-K ruskal algorithm for each choice of n-1 edges, the greed of the criteria used are: from the left edge select does not produce a loop with the smallest cost edge has been selected to join the edge of the collection. Taking note of the selected edges have a loop if it can not form a spanning tree. K ruskal algorithm sub-e-step, in which e is the number of network edge. According to the order of incremental cost to consider this e edges, each taking a side. When considering a certain edge when, if its added to a collection of selected edge loop will appear, will be its discarded, otherwise, it selected.
Date : 2025-12-25 Size : 2kb User : sff
[Other] NA_3_02 DL : 0: For solving the following problem: "There is No Free Lunch" Time Limit: 1 Second Memory Limit: 32768 KB One day, CYJJ found an interesting piece of commercial from newspaper: the Cyber-restaurant was offering a kind of "Lunch Special" which was said that one could "buy one get two for free". That is, if you buy one of the dishes on their menu, denoted by di with price pi , you may get the two neighboring dishes di-1 and di+1 for free! If you pick up d1, then you may get d2 and the last one dn for free, and if you choose the last one dn, you may get dn-1 and d1 for free. However, after investigation CYJJ realized that there was no free lunch at all. The price pi of the i-th dish was actually calculated by adding up twice the cost ci of the dish and half of the costs of the two "free" dishes. Now given all the prices on the menu, you are asked to help CYJJ find the cost of each of the dishes.
Date : 2025-12-25 Size : 1kb User : anthony chan
[Other] workasign DL : 0: 工作分配问题的实现对给定的工作费用，计算最佳的工作分配方案使总费用最小-Allocation of work to achieve a given cost, calculated the best distribution of work programs so that the total cost of the smallest
Date : 2025-12-25 Size : 1kb User : 宗
[Other] ADC DL : 0: STM32 CORTEX F10x系列的ADC模块的测试程序，有助于快速入门全新的ARM12 32bit微控制器。提供性价比高的中高端实现方案。-STM32 CORTEX F10x series of ADC module test procedures, contribute to Quick Start new ARM12 32bit microcontrollers. Provide cost-effective implementation of high-end programs.
Date : 2025-12-25 Size : 61kb User : xwo2
[Other] DMA DL : 0: STM32 CORTEX F10x系列的“DMA”模块的测试程序，有助于快速入门全新的ARM12 32bit微控制器。提供性价比高的中高端实现方案。-STM32 CORTEX F10x series of " DMA" module test procedures, contribute to Quick Start new ARM12 32bit microcontrollers. Provide cost-effective implementation of high-end programs.
Date : 2025-12-25 Size : 49kb User : xwo2
[Other] RTC DL : 0: STM32 CORTEX F10x系列的“RTC实时时钟模块”的测试程序，有助于快速入门全新的ARM12 32bit微控制器。提供性价比高的中高端实现方案。-STM32 CORTEX F10x series “RTC Real Time Clock module” test procedures, contribute to Quick Start new ARM12 32bit microcontrollers. Provide cost-effective implementation of high-end programs.
Date : 2025-12-25 Size : 14kb User : xwo2
[Other] pb375 DL : 0: PB375 U盘读写汇编程序性价比超高的U盘读写模块-PB375，兼容CH375读写操作 -PB375 U disk read and write assembler cost-effective ultra-high U-disk read-write module-PB375, read and write compatible with the operation CH375
Date : 2025-12-25 Size : 631kb User : 肖凤
[Other] minimumspanningtree DL : 0: 数据库结构课本中二叉树中求最小代价生成树-Textbooks in the binary tree database structure in order to minimize the cost of spanning tree
Date : 2025-12-25 Size : 1kb User : yahoo
[Other] Dijkstrashortestpathalgorithm DL : 0: Dijkstra最短路线算法实验，实现欧洲旅游线路。此线路下花费最少费用-Dijkstra shortest route algorithm experiment, the realization of the European tourist routes. Under this line to spend at least the cost of
Date : 2025-12-25 Size : 136kb User : mrchen
[Other] zdbwnl DL : 0: 万年历+温度+闹钟，非常实用，并且可调，性价比高-Calendar+ temperature+ alarm clock, a very practical and adjustable, cost-effective
Date : 2025-12-25 Size : 8kb User : 黄泽良
[Other] NXP_UOC3_LCDTV_Code_Mstar DL : 0: MStar518 Scaler驱动源码 8052单片机控制Nxp经典TV方案UOCIII配合Scaler驱动实现低成本成熟液晶电视方案-MStar518 Scaler driver source 8052 SCM control Nxp classic TV programs UOCIII with the drive to achieve low-cost mature Scaler LCD TV program
Date : 2025-12-25 Size : 415kb User : bright
[Other] BranchAndBound DL : 0: 本程序是用分支定界法求最短路径的程序，用C++编写。采取的基本思想是：使用最小优先队列分支界限法来构建程序，细节是对于每个节点，包含三个变量：当前走过的路径长度、当前的花费和该节点对应的实际城市的编号。关于确定节点优先级，我们规定首先以“当前走过的路径长度”来确定优先级，当路径长度相等时，以“当前的花费”来确定优先级。同时，我们还定义两个数组dist[i]和pric[i]保存当前求得的从源城市到每个城市的最短距离和花费，用于剪枝时的评判标准。-This procedure is to use branch and bound procedure for seeking the shortest path, using C++ to implement. The basic idea is: Using the minimum priority queue Branch and Bound method to build a program, the details are: for each node, containing three varibles: the current path length traversed, the current cost and the node number corresponding to the actual city. On the determination of priorities, we first use the current path length traversed to determine the priority if the path length is equal, then current cost is used to determine priority. At the same time, we also define two arrays dist [i] and the pric [i] to save the current shortest distance and cost from the source city to every other city . This will be used as the evaluation criterion when pruning.
Date : 2025-12-25 Size : 60kb User : 李贺
[Other] chuan DL : 0: 用KMP算法来实现的模式匹配，花了我好多精力才实现的啊-KMP algorithm is used to achieve pattern matching, cost me a lot of energy was achieved ah
Date : 2025-12-25 Size : 1kb User : miwua
[Other] q DL : 0: 车站管理系统---自动计算费用车站管理系统---自动计算费用-Station management system automatically calculates the cost of the station------ automatically calculate the cost management system
Date : 2025-12-25 Size : 3kb User : 林海涵
[Other] the-minimum-cost-of-a-binary-tree DL : 0: 在二分检索树中，为了把动态规划应用于得到一颗最优二分检索树的问题，需要把构造这样的一个数看成是一系列决策的结果，而且要能列出求取最优决策序列的递推式，可以帮助你了解最优成本二叉树的实现-In a binary search tree, dynamic programming is applied in order to get the best question a binary search tree, we need to construct a number such as a result of a series of decisions, but also to be able to strike the optimal decision sequence lists The recursive formula that can help you understand the optimal cost to achieve the minimum cost of a binary tree binary tree
Date : 2025-12-25 Size : 54kb User : wanyang

« 12 3 4 5 6 »