搜索资源列表
pittnet神经网络源代码
- The purpose of this computer program is to allow the user to construct, train and test differenttypes of artificial neural networks. By implementing the concepts of templates, inheritance andderived classes from C++ object oriented programming, the n
quickSort3.12
- 内存映射，多线程快速排序，测试速度1000000/30s-memory mapping, multi-threaded quick sort, test speed 1000000/30s
Simulate_Allocate_Memory_Implement_by_C
- 模拟内存分配的c语言实现 六、 实验目的 了解用户程序分配内存以及回收所用内存的过程，加深对操作系统存储管理机制的理解。 七、 实验内容 采用首次适应法、最佳适应法或最差适应法，编写一内存分配和回收模拟程序。 （提示：“内存空闲区”数组的设置原理类似于实验一。动态地随机产生新的“内存分配”或“内存回收”请求，再按照你选定的分配算法修改这个数组。由于这个实验的重点在于内存分配，所以不考虑与某内存区相关的进程情况。） -simulation memory allocation
mmc(skyw)
- 用VC写的模拟内存分配管理的代码,经测试运行完全正确-VC write memory allocation management simulation code, the test run entirely correct
avl_tree
- 1.本程序由本人采用vc++ 6.0编写，包括了排序平衡二叉树的整套算法（包括插入、删除、查找以及其测试算法）。 2.运行myavl_vc.exe输入树的初始结点个数，确定后本程序将在内存中生成一棵相应结点数的二叉树，在此基础上你可以进行各种操作（插入、删除、查找以及测试其平衡性、排序性等） 3.每一个结点信息包括\"商品编码\"、\"商品名称\",且以\"商品编码\"作为关键字 4.初始生成的树的结点的商品编码为从1按顺序递增，商品名称为\"生成的商品\"加上商品编码 5.程序中的随
hyplas
- ************************************************************************ * * * * * THIS IS THE H Y P L A S 2.0 README FILE * * ----------------- * * * * HYPLAS is a finite element program for implicit small and large * * strain analisys of hyperelast
javajiyi
- java 用于既提高记忆力的测试 用来考试专用-java test for both the increased memory dedicated to test
Apple_Set
- Problem A:放苹果 Time Limit:1000MS Memory Limit:65536K Total Submit:1094 Accepted:441 Language: not limited Descr iption 把M个同样的苹果放在N个同样的盘子里，允许有的盘子空着不放，问共有多少种不同的分法？（用K表示）5，1，1和1，5，1 是同一种分法。 Input 第一行是测试数据的数目t（0 <= t
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
5555555555555
- 假设有n个待排序记录，记录Ri的关键字为Keyi, Keyi由d位十进制数字组成，即Keyi=Ki1 Ki2 Ki3 … Kid ,试分别采用链式存储结构和顺序存储结构实现基数排序。-Assuming that there is a question to sort n records, records Ri keywords for Keyi, Keyi by the d decimal places, namely, Keyi = Ki1 Ki2 Ki3 ... Kid, were used
Memory
- 记忆测试软件,您需要连续找出6-8个相同图标的方块-Memory test software, you need to find a row 6-8 of the same icon in the box
TotalMemory
- 用来测试手机待机情况下所能使用的最大内存量，普通用函数调用得到的剩于内存是错误的，这个通过用INT占用内存来获得可以使用的内存真正空间大小-Used to test mobile phone standby cases the maximum amount of memory can be used by the general use function calls get left in the memory is wrong, it occupied by the memory by usi
Compress
- 一个RLE/HUFFMAN/LZW的压缩算法类，可以对一段内存区进行压缩/解压缩、测试压缩比等操作。-An RLE/HUFFMAN/LZW compression algorithm classes can be a memory area compression/decompression, test compression ratio of such an operation.
cunchuqishiyanbaogao
- 可以实现操作系统的存储器的管理，是完完整整的实验报告，很好，代码本人通过测试一通过。-Can achieve the operating system memory management is one full test report, well, the code I pass the test I was adopted.
Memory_test
- 自己写的一个记忆力测试小工具，有注释的。-memory test toor
heap_sort
- heap sort is the other (and by far the most popular) in-place non-recursive sorting algorithm used in this test. Heap sort is not the fastest possible in all (nor in most) cases, but it s the de-facto sorting algorithm when one wants to make sure tha
insertion
- is the other (and by far the most popular) in-place non-recursive sorting algorithm used in this test. Heap sort is not the fastest possible in all (nor in most) cases, but it s the de-facto sorting algorithm when one wants to make sure that the sort
matlab_programming_the_memory_test_program_source_
- matlab程序设计之记忆力测试程序源码matlab programming the memory test program source code-matlab programming the memory test program source code matlab programming the memory test program source code
test
- 不老的传说问题————DP 使用动态规划——记忆化搜索求解-The problem is not the old legends---- DP using dynamic programming- Memory Search Solution
TSP-test
- TSP程序记忆自适应收敛测试。记忆遗传算法研究及在TSP问题中的应用的收敛测试部分。-TSP program memory adaptive convergence test. Memory genetic algorithm research and applications in the TSP problem in convergence test section.