检测文件中是否包含指定字符串

资源分配问题,n个车间,m台设备,如何分配才能使获最大利益?-resource allocation problem, workshops n, m machines, and the distribution can be best interests

c语言编的运动会分数统计系统，很多数据结构课程设计里都会与道德一些题，注释很多，容易看懂。-c language made the Games Score statistical systems, many data structures in curriculum design and morality will be a number of questions, comments, a lot easier to understand.

让你了解WINDONS时间编程的好程序-let you know WINDONS good time programming procedures

高斯投影正算公式，就是由大地坐标（L，B）求解高斯平面坐标（x，y），而高斯投影反算公式则是由高斯平面坐标（x，y）求解大地坐标（L，B）。编程环境是在VC下，采用C++语言编写。

1．在内存中开辟一个虚拟磁盘空间作为文件存储器，在其上实现一个简单的单用户文件系统。在退出这个简单的文件系统时，应将该虚拟文件系统保存到磁盘上，以便下次可以再将它恢复到内存的虚拟磁盘空间中。 2．文件存储空间的分配可采用显式链接分配或其他的办法。 3．空闲空间的管理可选择位示图或其他的办法。如果采用位示图来管理文件存储空间，并采用显示链接分配方式，那么可以将位示图合并到FAT表中。 4．文件目录结构采用多级目录结构。为了简单起见，可以不使用索引结点，其中的每个目录项应包含文件名、物理地址、长度等.-1.making a virtual diskete memory as file storyge,in this district it can implement a simple single user file system .when quit this simple file system ,it shoud save the virtual file system to diskete,then it can be resumed to virtual diskete district in the memory.3.we can choose location hint map to manage the idle space or orther means.if we choose locationhint map to manage file saving space,and adopt show linking distribution mode,we can combine location hint map into FAT table.4.file directory confiuration adopts multilevel directory confiuration.to simplify,it doesn t use index dot,evrery term shoud include file name,physical dress and lenght.

三星S3C2443开发板原理图 其BSP源码在本站可以找到。-Samsung S3C2443 development board schematic diagram of its BSP source code can be found at the site.

遗传算法是基于达尔文进化论的一种智能优化算法,一种可用于复杂系统优化的具有鲁棒性的搜索算法，适用于解决传统方法难以解决的复杂的、非线性问题，可广泛应用于组合优化、离散优化、工程优化等领域。旅行商问题是一种NP难的组合优化问题，具有重要的理论研究价值和实际应用背景。然而，传统遗传算法中存在有不足，需要提出新的改进的遗传算法，并应用于旅行商问题的求解。-Genetic algorithm is based on Darwin" s theory of evolution of an intelligent optimization algorithm, a complex system can be used to optimize the robustness of the search algorithm, the application of traditional methods to solve difficult and complex, nonlinear problems, can be widely used in combination optimization, discrete optimization, engineering, optimization and other fields. Traveling Salesman Problem is a NP hard combinatorial optimization problem, has important theoretical value and practical application of research background. However, the traditional genetic algorithm, there is less than the need to introduce new improved genetic algorithm, and applied for solving the traveling salesman problem.

语义web服务测试集，要注册在apache下，才能调用服务-Semantic web services test set, it is necessary to register in the apache can be called Service

Delphi源码 网络文件 断点续传-Delphi source network file HTTP

ASCII文本拼写检查的C语言源程序,本程序的算法不是最优的，希望大家能提出更好的算法。-ASCII text spelling check the C language source files, the process of the algorithm is not optimal, hope that we can come up with a better algorithm.