使用动态规划的方法求接出怎样在两条装配线上以最快的时间完成装配任务...

Matlab应用篇提供了大量的Matlab应用实例。配合前三篇所讲内容，巩固Matlab知识。-Matlab Application chapter provides a large number of application examples Matlab. Compatible with the three have said, the consolidation of Matlab knowledge.

比较精度的作业调度三种算法FCFS，SJF，HRN，大家感兴趣的话不防下载

员工培训管理系统。本系统要完成的主要功能是：1.进入系统钱需要身份验证，用户名，密码。输入争取后方可进入。2.管理员可以根据需要定义员工，工作以及部门信息。3.管理员可以定义课程、书籍、教授以及培训的资源信息。4.管理员可以保存员工的培训成绩及员工经过培训之后对该课程和领域的评价。5.依据不同的要求，可以在数据库中对信息进行查询和编辑。-Staff training management system. To complete the system are the main functions: 1. Necessary money into the system authentication, user name, password. Before it can enter into the fight. 2. The administrator can be the definition of necessary staff, as well as the information department. 3. The administrator can define the curriculum, books, professor of information and training resources. 4. The administrator can save the training of its staff after a score and staff training in the areas of curriculum and assessment. 5. In accordance with different requirements, you can on the information in the database query and editing.

用c#编写的多元线性回归模型，一元当然也可以用-With c# written in a multiple linear regression model, a dollar of course, can also be used

很精典的与数据库连接的管理程序-very classic and the database connection management process

读取数据库技术的实例，让初学者快速掌握VC访问数据库。用于工程开发。-read database

数据结构中分块查询算法,开发环境Vc++6.0.基于山东科技大学算法设计与分析课本-data structure carved block inquiries algorithm development environment Vc 6.0. Shandong University of Science and Technology based on the algorithm design and analysis of textbooks

该项目是一个在线投票系统，使学生能够通过在线投票而不费吹灰之力；

针对多维数据进行的Kmeans改进算法，实用可靠，在处理多维数据时，自己根据维数需求，进去设定n值，此程序较适合底层应用用，另sizevector的数据都需要注意，在用时根据自己的需求进行操作，内有程序详细说明

双向循环链表节点：数据域+指针域指针域：一个指针指向前一个同类型节点，另一个指针指向后一个同类型节点（1）设计节点struct db_node{int data;struct db_node * prev;struct db_node * next;};（2）创建空链表//创建了一个只有头节点的双向循环链表，返回头节点的地址struct db_node * create_db_list(void){struct db_node * phead = (struct db_node *)malloc(sizeof(struct db_node));if(phead == NULL)exit(-1);else{phead->next = phead;phead->prev = phead;}return phead;}（3）制造新节点//制造新节点，返回新节点的地址struct db_node * make_db_node(int value){struct db_node * pnew = (struct db_node *)malloc(sizeof(struct db_node));if(pnew == NULL)printf("malloc failed! ");else{pnew->data = value;pnew->next = NULL;pnew->prev = NULL;}return pnew;}（4）插入节点//把pnew指向的节点插入到头节点的前面，也就是整个链表的末尾bo