Location:
Search - Best fit
Search list
Description: 虚拟内存管理，用最先适配法，最优适配法，最差适配法-Virtual Memory management using First-fit, Best-fit and Worst-fit
Platform: |
Size: 2518 |
Author: 河南 |
Hits:
Description: 装箱问题：在装箱问题中，有若干个容量为c 的箱子和n 个待装载入箱子中的物品。物品i 需占
用s[i]个单元（0< s[i]≤c）。成功装载是指能把所有物品都装入箱子。最优装载是指使用最
少箱子的成功装载。
例如某运输公司要把包裹装入卡车中，每个包裹都有一定的重量，且每辆卡车也有其载
重限制（假设每辆卡车的载重都一样）。在卡车装载问题中，希望用最少的卡车来装载包裹。
此问题可看作装箱问题。卡车对应于箱子，包裹对应于物品。
解装箱问题的Best Fit 算法：
设avail[i]为箱子i 的可用容量。
初始时，所有箱子的可用容量为c 。
选择物品i放入具有最小avail且容量大于s[i]的箱子中。-packing problem : packing problems, there are a number of the capacity of the c-and n boxes to be loaded into the boxes of goods. I goods occupied s [i] units (0lt; S [i] c). Success is able to carry all of the items are put into boxes. The optimal loading refers to the use of the boxes at least the successful loading. For example, should a transportation company trucks loaded packages, each package has a certain weight, and each has its truck load restrictions (on the assumption that each truck load are the same). The truck loaded question, in the hope that at least a truck loaded parcels. This issue can be seen as packing problems. Truck corresponding to the boxes, parcels corresponding to the items. Xie crates of Best Fit is : Let avail [i] i boxes available capacity. Initially, all th
Platform: |
Size: 1642 |
Author: 严林 |
Hits:
Description: 操作系统实验模拟，存储器动态分配空间
可选首次适应算法和最佳适应算法-experimental operating system simulation, dynamic memory allocation options first space adaptation algorithm and the best fit algorithm
Platform: |
Size: 9505 |
Author: 王卫国 |
Hits:
Description: 在对数据结构有一定掌握程度的情况下设计合理的数据结构来描述存储空间，实现分区存储管理的内存分配功能，应该选择最合适的适应算法（首次适应算法，最佳适应算法，最后适应算法，最坏适应算法），实现分区存储管理的内存回收算法，在这些存储管理中间必然会有碎片的产生，当碎片产生时，进行碎片的拼接，等等相关的内容-structure of the data in a certain degree of master of rational design of the data structure to describe the storage space, Storage Management District achieve the memory allocation function, we should choose the most suitable adaptation algorithm (first fit algorithm, Best-fit algorithm, the final adaptation algorithm, the worst adaptation algorithm), to achieve the Storage Management Division memory recovery algorithm, Storage management in the middle of the debris will be generated when the debris generated when debris splicing, etc. related to the content
Platform: |
Size: 306934 |
Author: sunwei |
Hits:
Description: 操作系统实验模拟，存储器动态分配空间
可选首次适应算法和最佳适应算法-experimental operating system simulation, dynamic memory allocation options first space adaptation algorithm and the best fit algorithm
Platform: |
Size: 113664 |
Author: 王卫国 |
Hits:
Description: 主存空间的分配与回收．采用可变分区存储管理，使用首次适应算法、循环首次适应算法、最佳适应算法三种算法完成设计。-main memory space for the distribution and recovery. Using variable storage area management, the use of the first-fit algorithm, the first cycle of adaptation algorithms, best adaptation algorithm to complete the design of three types of algorithms.
Platform: |
Size: 280576 |
Author: 罗小明 |
Hits:
Description: fit_ellipse - finds the best fit to an ellipse for the given set of points. a matalb realization-fit_ellipse- finds the best fit to an ellipse for the given set of points. a matalb realization
Platform: |
Size: 3072 |
Author: Deng Fu Qin |
Hits:
Description: an implementation of best fit in matlab
Platform: |
Size: 20480 |
Author: jothar |
Hits:
Description: 本实验要求建造一个没有虚拟功能的内存管理系统．任务如下：
设计一个内存管理器，支持至少两种分配策略，如first-fit，next-fit，best-fit，worst-fit等．
对不同分配策略的性能进行评估．
这次实验主要实现了first fit和best fit两个算法。
-This experiment did not require the construction of a virtual memory management system functions. Tasks are as follows: the design of a memory manager to support the allocation of at least two strategies, such as first-fit, next-fit, best-fit, worst-fit and so on. on the performance of different allocation strategies for evaluation. The main achievement of the experiment the first fit and best fit the two algorithms.
Platform: |
Size: 273408 |
Author: 小江 |
Hits:
Description: fit_ellipse - finds the best fit to an ellipse for the given set of points.-fit_ellipse- finds the best fit to an ellipse for the given set of points.
Platform: |
Size: 5120 |
Author: yar |
Hits:
Description: 分析Unix最先适应（first fit，ff）存储分配算法。即map数据结构、存储分配函数ma lloc()和存储释放函数mfree()，找出与算法有关的成分。修改上述算法有关成分，使其分别体现BF(best fit，最佳适应)分配原则WF(worst fit，最坏适应)分配原则。-Analysis of Unix was first to adapt to (first fit, ff) memory allocation algorithm. The map data structure, storage allocation function ma lloc () and memory release function mfree (), and algorithms to identify the elements. Modify the above algorithm as the ingredients, so that, respectively, embody BF (best fit, best fit) the principle of distribution WF (worst fit, the worst adaptation) distribution.
Platform: |
Size: 1024 |
Author: 高飞 |
Hits:
Description: VC++MFC模拟连续分配内存存储管理系统，首次适应算法 、循环首次适应算法、最佳适应算法
-VC++ MFC allocates memory for continuous analog storage management system, the first fit algorithm, loop the first fit algorithm, the best fit algorithm
Platform: |
Size: 223232 |
Author: 赵凯 |
Hits:
Description: 1.分析UNIX最先适应（First Fit,FF）存储分配算法，即map数据结构、存储分配函数malloc()和存储释放函数mfree（），找出与算法有关的成分。
2.修改上述与算法有关的成分，使其分别体现BF（Best Fit,最佳适应）分配原则和WF(Worst Fit,最坏适应)分配原则。
-1. The first adaptation of UNIX (First Fit, FF) memory allocation algorithm, that is, map the data structure, storage allocation functions malloc () and memory release function mfree (), to identify the components and algorithms. 2. Modify the above related components and algorithms, it must show the BF (Best Fit, Best Fit) distribution and WF (Worst Fit, the worst adaptation) distribution.
Platform: |
Size: 2048 |
Author: pearl |
Hits:
Description: First fit and Best fit memory managment scheme implementation in C-First fit and Best fit memory managment scheme implementation in C++
Platform: |
Size: 1024 |
Author: Pranshu Jaiswal |
Hits:
Description: 一维装箱问题的Best Fit算法伪代码-best fit algorithms of 1D bin packing program
Platform: |
Size: 1024 |
Author: joker yu |
Hits:
Description: Best Fit Worst Fit c algorithm
Platform: |
Size: 1024 |
Author: Babnax33 |
Hits:
Description: best fit line with given data points
Platform: |
Size: 2048 |
Author: rupam |
Hits:
Description: 可实现局部最优近似平面数据聚类，该聚类方法是一种常用的子空间聚类方法，文章作者没有给出相应的源码，这里提供给大家。经过测试可以实现数据聚类，但是对人脸数据集extended yale B效果不理想。参考文献：Teng Zhang, Arthur Szlam, Yi Wang, et al. Hybrid linear modeling via local best-fit flats [J]. International Journal of Computer Vision, 2012, 100: 217-240.-This program can realize local best fit flats subspace clustering. Local best fit flats subspace clustering is one of the commonly used subspace clustering methods. The authors of the paper didn t present the source code and here it is given. The program is tested and it can be used to realize data clustering but its effect is not satisfying in clustering data extended yale B face . Reference: Teng Zhang, Arthur Szlam, Yi Wang, et al. Hybrid linear modeling via local best-fit flats [J]. International Journal of Computer Vision, 2012, 100: 217-240.
Platform: |
Size: 2048 |
Author: 宋昱 |
Hits:
Description: 一个好的拟合算法，可能拟合直线、园、椭圆函数-Best-fitting line, circle and ellipse
Platform: |
Size: 436224 |
Author: zhaozm |
Hits:
Description: 最佳拟合多项式函数(Polynomial of best-fit)
Platform: |
Size: 60416 |
Author: hulala_87
|
Hits: