Location:
Search - BestFit
Search list
Description: Best fitting line in vb .net
Platform: |
Size: 2048 |
Author: Guru |
Hits:
Description: its about page reeplacement technique in operating system
Platform: |
Size: 1024 |
Author: shikhar |
Hits:
Description: an implementation of best fit in matlab
Platform: |
Size: 20480 |
Author: jothar |
Hits:
Description: 自己编写的装箱问题的各种求解策略，包括BESTFIT,FIRSTFIT,WORSTFIT,NEXTFIT-I have written a variety of bin-packing problem solving strategy, including the BESTFIT, FIRSTFIT, WORSTFIT, NEXTFIT etc.
Platform: |
Size: 3072 |
Author: binbin |
Hits:
Description: 用于比对两个轮廓是否相似。打开dwg图
加载arx文件，输入bestfit，即可-compare two contours
Platform: |
Size: 328704 |
Author: musicbug |
Hits:
Description: 采用 最佳适应算法进行内存块的分配和回收，同时显示内存块分配和回收后空闲内存分区链的情况-With the adoption of best-fit algorithm for memory block allocation and recovery, also showed the recovered memory block allocation and free memory partition chain of
Platform: |
Size: 1024 |
Author: 高飞 |
Hits:
Description: 内存动态分配的用最佳适应算法实现的动态分配内存管理-Dynamic allocation of memory to use best-fit algorithm to achieve dynamic allocation of memory management
Platform: |
Size: 2048 |
Author: man哥 |
Hits:
Description: 采用最优适应算法完成可变分区存储管理方式的内存分配回收。-Optimal adaptation algorithm using variable partition memory management to complete the memory allocation recovery.
Platform: |
Size: 5120 |
Author: 苏 |
Hits:
Description: best fill algoritham
Platform: |
Size: 698368 |
Author: kaushik |
Hits:
Description: 一维纸箱中的一种算法，首先最适应启发式。启发式中的一种。-One carton of an algorithm, first of all, the most adaptive heuristic. One of the heuristic
Platform: |
Size: 1024 |
Author: 雷云 |
Hits:
Description: 常用数据结构，箱子装载fitbox（最优匹配问题）。-Common data structure, the box load (best matching)
Platform: |
Size: 7168 |
Author: yuli |
Hits:
Description: 内存动态分配的用最佳适应算法实现的动态分配内存管理-Dynamic allocation of memory to use best-fit algorithm to achieve dynamic allocation of memory management
Platform: |
Size: 2048 |
Author: dun6449934 |
Hits:
Description: 针对二维矩形条带装箱问题提出了一种启发式布局算法，即底部左齐择优匹配算法（lowest—level left align bestfit，简称LLABF）．LLABF算法遵循最佳匹配优先原则，该原则综合考虑完全匹配优先、宽度匹配优先、高度匹配优先、组合宽度匹配优先及可装入优先等启发式规则．与BL（bottom-left），IBL（improved-bottom-left）与BLF（bottom—left-fill）等启发算法不同的是，LLABF能够在矩形装入过程中自动选择与可装区域匹配的下一个待装矩形．计算结果表明，LLABF结合遗传算法（genetie algorithm,简称GA）解决二维条带装箱问题更加有效．(A heuristic placement algorithm for two-dimensional rectangular strip packing problem is proposed, which is called bottom-level left align best fit algorithm (LLABF). Different from BL (bottom-left), IBL (improved-bottom-left) and BLF (bottom-left-fill) heuristic algorithms, LLABF can automatically select the next rectangle to be loaded that matches the mountable region during the rectangular loading process. Genetie algorithm (GA) is more effective to solve the two-dimensional strip packing problem.)
Platform: |
Size: 580608 |
Author: Mr_WX |
Hits: