Search - COST 2

Search - COST 2 - List

[Algorithm] zhuiganfa111 DL : 0: 加算方法中的追赶法的例子，例子经过了最优化处理，可以最小开销的实现追赶法-Add count method to catch up with examples of law, for example, has been optimized to deal with, you can catch up with the realization of the minimum cost method
Date : 2025-12-25 Size : 1kb User : aa
[Algorithm] dongtaiguihua DL : 0: 设平面上有一个m´ n的网格，将左下角的网格点标记为（0,0）而右上角的网格点标记为（m,n）。某人想从（0,0）出发沿网格线行进到达（m,n），但是在网格点（i,j）处他只能向上行进或者向右行进，向上行进的代价为aij（amj ＝＋¥ ），向右行进的代价是bij（bin ＝＋¥ ）。试设计一个动态规划算法，在这个网格中为该旅行者寻找一条代价最小的旅行路线。用高级程序设计语言编写程序求解动态规划模型。-Set up a plane m n of the grid, will be the lower-left corner of the grid points marked as (0,0) and the upper right corner of the grid point marked as (m, n). A person from (0,0) along the starting grid to reach the road (m, n), but the grid point (i, j) Department only him right up the road or the road, up the road price for the aij ( amj = ￥), the road to the right price is bij (bin = ￥). Try to design a dynamic programming algorithm, in this grid for travelers to find a minimum cost of travel routes. Advanced programming language used to write programs to solve dynamic programming model.
Date : 2025-12-25 Size : 1kb User : 陆嘉鸣
[Algorithm] router_calc DL : 0: 根据一个有权的无向图生成指定结点（路由器）的路由表设有结点N，N的路由表由若干个路由项组成，路由项是<目的结点，下一跳>的二元组，其中目的结点是以N结点为源结点，通过N结点可以直接到达（目的结点是N结点的邻居）或通过N结点的邻居可间接到达的结点，其中下一跳即N结点的某领居，通过该邻居可间接到达目的结点，且到达目的结点的路径为最小代价路径.-According to a right of the undirected graph to generate the specified node (router) routing table with nodes N, N' s routing table routing by a number of components, routing is < the purpose of nodes, next hop> dual group node is one of the purpose of node N as the source node by node N can arrive (the purpose of node N are neighbor nodes) or through a neighbor node N can be indirectly Get the nodes, that is one of the next hop of a node N from home, the adoption of the neighbor may be an indirect purpose of node arrival and arrival at the destination node for the smallest cost of the path path.
Date : 2025-12-25 Size : 1kb User : luowen
[Algorithm] dijkstra5 DL : 0: For a given source vertex (node) in the graph, the algorithm finds the path with lowest cost (i.e. the shortest path) between that vertex and every other vertex. It can also be used for finding costs of shortest paths from a single vertex to a single destination vertex by stopping the algorithm once the shortest path to the destination vertex has been determined
Date : 2025-12-25 Size : 51kb User : vvvvv
[Algorithm] prim DL : 0: Prim s Algorithm for Minimimum-Cost Spanning Tr-Prim s Algorithm for Minimimum-Cost Spanning Tree
Date : 2025-12-25 Size : 1kb User : Ha
[Algorithm] cv7 DL : 0: Edge(int from, int to, int cost) : from(from), to(to), cost(cost) {} friend bool operator<(const Edge& a, const Edge& b) { if (a.cost != b.cost) { return a.cost > b.cost }
Date : 2025-12-25 Size : 10kb User : 65400
[Algorithm] sum DL : 0: n件工作分给n各人完成，将第i个工作分配给第j个人完成需要费用cij，是设计一算法，为每个人分配不用的工作，费用最少-n to n pieces of work hours each to complete, will for the first i jobs j assigned to the first individual to complete required cost cij, is to design an algorithm, for each person assigned do not work, would cost at least
Date : 2025-12-25 Size : 1kb User : jdx
[Algorithm] DIJKSTRA DL : 0: Dijkstra s algorithm.For a given source vertex (node) in the graph, the algorithm finds the path with lowest cost (i.e. the shortest path) between that vertex and every other vertex.
Date : 2025-12-25 Size : 1kb User : andrushkutzzaa
[Algorithm] TSPVCCODE DL : 0: 本算法主要是解决传统的旅行商问题最小成本下求解最小路径的问题，已经验证可以运行，没有错误，希望对大家有帮助-This algorithm is mainly to solve the traditional traveling salesman problem minimum cost path for solving the minimum problem has been demonstrated to run, no error, we want to help
Date : 2025-12-25 Size : 1kb User : mqh
[Algorithm] SuccessiveShortest DL : 0: This algoritm minimum cost flow wiht succesive succes algoritm. It s easy to learning person algoritm. You try this.-This is algoritm minimum cost flow wiht succesive succes algoritm. It s easy to learning person algoritm. You try this.
Date : 2025-12-25 Size : 2kb User : dupek
[Algorithm] ANT.CPP DL : 0: C++ Implementation of Ant Colony Optimization Program.This uses a Cost matrix to Calculate the Shortest path from a number of Cities.
Date : 2025-12-25 Size : 2kb User : Prasenjit Nag
[Algorithm] sales_man DL : 0: 推销员问题：穷举出推销员可能行走的每条路径，计算花费，从中选出最小的那条路径，有很详细的注释，是我们算法课的作业。-Salesman problem: a salesman may exhaustive walk each path, calculate the cost, choose the smallest piece of the path, there are very detailed notes, our algorithm homework assignment.
Date : 2025-12-25 Size : 1kb User : wang
[Algorithm] family-manager DL : 0: 家庭财务管理小程序，主要是将费用分类和归纳-Family financial management applet, the main cost is classified and summarized
Date : 2025-12-25 Size : 1kb User : Fain
[Algorithm] pool DL : 0: 游泳池大小周围栏杆的设计，以及游泳池的造价花销费用的计算。-The design of the railings around the swimming pool size. And the cost of the cost of the swimming pool cost calculation.
Date : 2025-12-25 Size : 1kb User : 萧潇
[Algorithm] areaofcircle DL : 0: 一圆形游泳池如图所示，现在需在其周围建一圆形过道，并在其四周围上栅栏。栅栏价格为35元/米，过道造价为20元/平方米。过道宽度为3米，游泳池半径由键盘输入。要求编程计算并输出过道和栅栏的造价。-A circular pool as shown in figure, now in its built around to a circular corridor, and in its 4 around on the fence. The fence for 35 yuan/m price, corridor cost for 20 yuan/square metre. Aisle width is 3 meters, The radius of the swimming pool by keyboard input. Demand and output programming calculation of corridor and the cost of the fence.
Date : 2025-12-25 Size : 1kb User : 陈生
[Algorithm] ASA DL : 0: Adaptive Simulated Annealing (ASA) is a C-language code developed to statistically find the best global fit of a nonlinear constrained non-convex cost-function over a D-dimensional space. This algorithm permits an annealing schedule for "temperature" T decreasing exponentially in annealing-time k, T = T_0 exp(-c k^1/D). The introduction of re-annealing also permits adaptation to changing sensitivities in the multi-dimensional parameter-space. This annealing schedule is faster than fast Cauchy annealing, where T = T_0/k, and much faster than Boltzmann annealing, where T = T_0/ln k. ASA has over 100 OPTIONS to provide robust tuning over many classes of nonlinear stochastic systems.-Adaptive Simulated Annealing (ASA) is a C-language code developed to statistically find the best global fit of a nonlinear constrained non-convex cost-function over a D-dimensional space. This algorithm permits an annealing schedule for "temperature" T decreasing exponentially in annealing-time k, T = T_0 exp(-c k^1/D). The introduction of re-annealing also permits adaptation to changing sensitivities in the multi-dimensional parameter-space. This annealing schedule is faster than fast Cauchy annealing, where T = T_0/k, and much faster than Boltzmann annealing, where T = T_0/ln k. ASA has over 100 OPTIONS to provide robust tuning over many classes of nonlinear stochastic systems.
Date : 2025-12-25 Size : 638kb User : ip
[Algorithm] Huffman-encoder-decoder DL : 0: 编制一个哈夫曼编/译码器。利用哈夫曼编码进行通信可以大大提高信道利用率，缩短信息传输时间，降低传输成本。-Preparation of a Huffman encoder/decoder. Huffman coding communication can greatly improve the channel utilization, shorten the time of transmission of information, reduce the transmission cost.
Date : 2025-12-25 Size : 998kb User : 刘明
[Algorithm] formula-for-corn DL : 0: GLS模型,计算探讨信息披露质量与权益资本成本之间的关系-GLS models explore the relationship between the quality of information disclosure and the cost of equity capital is calculated
Date : 2025-12-25 Size : 1kb User : 谭道恒
[Algorithm] code DL : 0: 问题描述：在一个操场的四周摆放着n 堆石子。现要将石子有次序地合并成一堆。规定每次至少选2 堆最多选k堆石子合并成新的一堆，合并的费用为新的一堆的石子数。试设计一个算法，计算出将n堆石子合并成一堆的最大总费用和最小总费用。编程任务：对于给定n堆石子,编程计算合并成一堆的最大总费用和最小总费用。 Input 测试数据的第1 行有2个正整数n和k，表示有n堆石子，每次至少选2堆最多选k堆石子合并。第2行有n个数，分别表示每堆石子的个数。 Output 输出最大总费用和最小总费用，用一空格隔开，每个答案一行。 Sample Input 7 3 45 13 12 16 9 5 22 Sample Output 593 1-Problem Description: n heap stones placed around a playground. Now want to stone in order to merge into a pile. Provision for at least selected pile up election k to heap stones merger into a new pile of combined costs for the new pile of stones number. Try to design an algorithm to calculate the maximum total cost and minimum total cost of n heap stones combined into a pile. Programming tasks: For a given n heap stones, programming calculation merged into a bunch of maximum total cost and minimum total cost. Input test data the first row there are two positive integers n and k, n heap stones, each time at least one selected two heap up selected k heap stones merge. The second row has n numbers denote the number of each heap stones. Output Output maximum total cost and minimum total cost, separated by a space, each answer a row. Sample Input 7 3 45 13 12 16 9 5 22 Sample Output 593 199
Date : 2025-12-25 Size : 1kb User : ldy
[Algorithm] genetic1 DL : 0: 进化次数限制；计算耗费的资源限制（例如计算时间、计算占用的内存等）；一个个体已经满足最优值的条件，即最优值已经找到；适应度已经达到饱和，继续进化不会产生适应度更好的个体；人为干预；以及以上两种或更多种的组合。-Limiting the number of evolution resource limits (e.g., computation time to calculate the amount of memory, etc.) the cost calculation individual has an optimal value satisfying the condition, i.e., the optimum value has been found fitness has reached saturation, no adaptation continues to evolve of better self human intervention above, and combinations of two or more thereof.
Date : 2025-12-25 Size : 2kb User : ted

« 12 »