搜索资源列表
LimitBin
- 装箱问题：在装箱问题中，有若干个容量为c 的箱子和n 个待装载入箱子中的物品。物品i 需占 用s[i]个单元（0< s[i]≤c）。成功装载是指能把所有物品都装入箱子。最优装载是指使用最 少箱子的成功装载。 例如某运输公司要把包裹装入卡车中，每个包裹都有一定的重量，且每辆卡车也有其载 重限制（假设每辆卡车的载重都一样）。在卡车装载问题中，希望用最少的卡车来装载包裹。 此问题可看作装箱问题。卡车对应于箱子，包裹对应于物品。 解装箱问题的Best Fit 算法： 设
rsomtoolbox
- a neural network,Recursive SOM and Marge SOM ,can be use for time series and data fit.-a neural network, Recursive Marge SOM and SOM. can be use for time series data and fit.
ParkingLotSimulation
- Parking Lot Simulation： Parking lot attendants often park cars bumper-to-bumper, several cars deep. This maximizes the number of cars they can fit into a parking lot at the expense of complicating the process of retrieving someone s car when they w
ercheng
- 最小二乘法曲线拟合的经典算法，做过特征数检验，只需调用fit，文件中其他函数被fit调用，其中个输入输出变量均以给出详细说明。-least squares curve fitting classic algorithms, the number of tests done, just call fit, the paper other function to be fit Call, 000 input and output variables were presented in detail.
Three-splines-function
- vb三次样条插值函数，具有高精度的拟合，实现光滑作图-vb cubic spline interpolation function, with high-precision fit to achieve a smooth mapping
os5
- 设可供分配的内存储器为1MB(1000KB),内存分配采用动态分区分配策略，分区分配的数据结构为空闲分区链，分配算法采用首次适应算法(FF) 系统仅有一个CPU；作业提交时申明需要的CPU时间和内存大小(以KB为单位)。-Located within the memory available for allocation to 1MB (1000KB), memory allocation dynamic partition allocation strategies, area distrib
huffman
- 数据结构中的huffman树的一个具体应用，适合刚开始学习数据结构的朋友！-Data structure of huffman tree to a specific applications, fit the beginning of the study data structure Friend!
dfse
- 何志丹讲VC学习，适合与初级编程者，内容很不错-Ho VC stresses Zhidan study, fit and junior programmers
Memory
- 内存管理 设计一个内存管理器，支持至少两种分配策略。 对不同分配策略的性能进行评估。 利用c++语言实现了，First-fit，next-fit。两种分配算法。并实现了测试程序 -Design a memory management memory management, and support for at least two types of allocation strategies. On the performance of different allocation st
user_mm
- 1. 分析用户程序虚拟地址空间分布 2. 模拟实现可变分区管理，存储分配算法采用最佳适配算法。-1. Analysis of user process virtual address space distribution 2. Simulation and Realization of a variable partition management, storage allocation algorithm uses the best fit algorithm.
FirstFit
- 实现数据结构中定位查找方法--“首次适应算法”，经过浙大acm源码上传测试-Location data structure search methods- "first-fit algorithm," having Zhejiang University acm source upload test
OS-Practice
- 最佳适应算法 初始化，选择内存分配适应算法-Best fit algorithm initialization, select the memory allocation algorithm to adapt
variable_distribution
- 采用最佳适配算法实验动态分区分配过程alloc()和回收过程recover()。其中，空闲分区通过空闲分区链来管理；在进行内存分配时，系统优先使用空闲区低端的空间-Experimental best fit algorithm using the dynamic partition allocation process alloc () and the recovery process recover (). Among them, free partition management throu
LAB3_1
- 首次适应算法，操作系统实验代码，VC6.0下编译通过-First fit algorithm, the operating system code experiment
LAB3_2
- 最优适应算法，操作系统实验，VC6.0下编译通过-Best fit algorithm, the operating system experiment, VC6.0 compiled by
LAB3_3
- 最差适应算法，VC6.0下编译通过，操作系统实验代码-Worst-fit algorithm, VC6.0 compiled by the operating system code experiment
DTassign
- 简单完成计算机的动态内存分配功能，利用链表结点存储内存，实现了最佳适应算法，最坏算法，首次适应算法，循环适应算法和紧凑算法。-Simply complete the function of the computer' s dynamic memory allocation, linked list of nodes using storage memory, to achieve the best fit algorithm, the worst algorithm, the first
first-fit_mem_manage
- 首次适应算法管理内存简单练习，链表简单模拟-First fit algorithm for memory management simple exercises, lists simple simulation
cPP
- 请求分配分区（首次适应算法、最坏适应算法、最佳适应算法）-Request allocation district (first-fit algorithm, the worst fit algorithm, the best-fit algorithm)
contribute-and-recover
- 在可变分区管理方式下采用首次适应算法实现主存分配和回收-Variable partition management mode in the first-fit algorithm using main memory allocation and recovery