Location:
Search - optimal
Search list
Description: 最优分解问题的贪心算法,使用输入与输出文件来控制程序的输入与输出-Optimal decomposition of the problem greedy algorithm, the use of input and output file to control the process input and output
Platform: |
Size: 1024 |
Author: 张仁春 |
Hits:
Description: 主存空间的分配与回收的实验报告.根据可变分区的主存分配思想，首先设计记录主存使用情况的数据表格，用来记录空闲区和作业占用的区域，即“已分配区表”和“空闲区表”。然后在数据表格上进行主存的分配，其主存分配算法采用最优适应算法，即按作业要求挑选一个能满足作业要求的最小空闲区分配，具体实现时，把空闲区按长度以递增方式登记在空闲表中，分配时顺序查找空闲表，-Main memory space allocation and recovery of experimental reports. According to the variable partition of main memory allocation of thinking, first of all design records the use of main memory data tables used to record operating free zones and occupied the region, that is, have been allocated to District Table and free zone table. And then in the data tables on the distribution of main memory, and its main memory allocation algorithm uses the optimal adaptation algorithm, that is, according to the selection of operational requirements to meet the operational requirements of a minimum free area distribution, when the concrete realization of the free zone by the length of ascending registered in the free form, the allocation order to find free sheet,
Platform: |
Size: 10240 |
Author: 杰 |
Hits:
Description: 多处最优服务次序问题，设有N个顾客同时等待一项服务。顾客i需要的服务时间为ti，共有s处可以提供此项服务，应如何安排n个顾客的服务次序才能使平均等待时间达到最小。-Optimal order of multiple services, with N of customers waiting for a service at the same time. I need to service customers time ti, a total of s Office can provide the service, how to arrange a customer service n order to make the average waiting time to a minimum.
Platform: |
Size: 1024 |
Author: 李碧莲 |
Hits:
Description: 最优服务次序问题 问题描述: 设有n 个顾客同时等待一项服务。顾客i需要的服务时间为t(i),i=1,…,n 。...个顾客等待服务时间的 总和除以n。 编程任务: 对于给定的n个顾客需要的服务时间,编程计算最优服务次序。-Order of the issue of optimal service Description: n months customers have to wait for a service at the same time. I need to service customers time t (i), i = 1, ..., n. ... A customer waiting for service time divided by the sum of n. Programming tasks: n for a given customer service needs, programming calculated optimal service order.
Platform: |
Size: 520192 |
Author: 陈大哥 |
Hits:
Description: 可以重复数值的算法排列
这个算法可以得出最优解-Numerical algorithm can repeat this algorithm can be drawn with the optimal solution
Platform: |
Size: 210944 |
Author: 陈大哥 |
Hits:
Description: 操作系统内存管理模拟，最优适应和最先适应算法-Operating system memory management simulation, optimal adaptation and the first adaptation algorithms
Platform: |
Size: 394240 |
Author: kp |
Hits:
Description: 最优分解：将正整数n分解为若干互不相同的自然数的和，且使这些自然数的乘积最大-Optimal decomposition: The positive integer n is decomposed into a number of separate natural number and, and make them the product of the largest natural number
Platform: |
Size: 1024 |
Author: sandra |
Hits:
Description: \多处最优服务次序-Optimal order of multiple services
Platform: |
Size: 1024 |
Author: sandra |
Hits:
Description: 凸三角形最优三角形剖分 动态规划方法实现效率不错哈-Convex triangle triangle subdivision optimal dynamic programming methods to achieve good efficiency Kazakhstan
Platform: |
Size: 1024 |
Author: 林双 |
Hits:
Description: 遗传算法解中国旅行商问题，里面有45个城市，用遗传算法算出近似最优解-Genetic Algorithm for Traveling Salesman Problem in China, there are 45 cities, using genetic algorithms calculate the approximate optimal solution
Platform: |
Size: 520192 |
Author: lsk |
Hits:
Description: 单输入单输出函数小波网络，用户需安装matlab神经网络工具箱，用户可以根据需要更换自己的训练样本，kugfcn.m,radbasmorlet.m分别为两个小波母函数，代码中加入了最优停止训练算法，非常好用-SISO function wavelet network, users need to install matlab neural network toolbox, users need to be replaced in accordance with their own training samples, kugfcn.m, radbasmorlet.m were two wavelet generating function, the code is added to optimal stopping training algorithm, very easy to use
Platform: |
Size: 3072 |
Author: |
Hits:
Description: 利用单纯形法求解线性规划，输入为标准型的线性规划，求解得到最优解和最优值-Use simplex method to solve linear programming, enter as the standard type of linear programming, for solving the optimal solution and optimal value
Platform: |
Size: 1024 |
Author: nano |
Hits:
Description: 按照能耗最优原则对机器生产时间用遗传算法解决-Optimal energy consumption in accordance with the principles of machine production time by using genetic algorithms to solve
Platform: |
Size: 2048 |
Author: 张宝利 |
Hits:
Description: 用遗传算法解决旅行商问题，并用图形界面显示出来。比较了分别采用轮盘赌选择算子和锦标赛选择算子的遗传算法求解TSP问题的性能，包括：运行时间、进化总代数和最优解质量。 结果曲线可以用图形显示出来。-Genetic algorithm is used to solve the traveling salesman problem, and use graphical interface is displayed. Compared using roulette selection operator and tournament selection operator of genetic algorithm to solve TSP s performance issues, including: run time, the evolution of the overall quality of algebra and the optimal solution. The results of curve can be used graphics displayed.
Platform: |
Size: 71680 |
Author: sdfsfdsf |
Hits:
Description: 倒立摆系统的控制问题一直是控制研究中的典型问题。此程序采用最优控制中的LQR方法对其控制。-Inverted pendulum control problem has been control of the typical problems. This procedure used in the LQR optimal control methods for their control.
Platform: |
Size: 1024 |
Author: 吕刚 |
Hits:
Description: 这是一个关于磁盘文件最优存储问题，是通过C++来实现的呀。-This is a study on the optimal disk file storage issues, through the C++ To achieve it.
Platform: |
Size: 8192 |
Author: 李眼 |
Hits:
Description: optimal portfoilio EXCELmin risk max return
Platform: |
Size: 121856 |
Author: king |
Hits:
Description: ostu图像分割阈值算法,对Ostu图像分割最优阈值进行优化处理，极大缩短了搜索图像阈值计算时间，与传统的枚举法Otsu方法相比,在计算时间上具有显著的优点。-ostu threshold image segmentation algorithm for image segmentation Ostu optimal thresholds to optimize the processing, greatly reduces the search image thresholding computation time, with the traditional enumeration method Otsu methods, in the calculation of time has significant advantages.
Platform: |
Size: 167936 |
Author: 李劲 |
Hits:
Description: 预测得到最优代谢通量分布而进行最适单基因敲除的例程-Predicted the optimal metabolic flux distribution for optimal single-gene knock-out of the routine
Platform: |
Size: 1024 |
Author: zhongyan |
Hits:
Description: 预测达到代谢通量最优分布而进行双基因敲除的matlab例程-Forecast to achieve optimal metabolic flux distribution for double-gene knockout of matlab routines
Platform: |
Size: 2048 |
Author: zhongyan |
Hits:
«
1
2
...
45
46
47
48
49
50»