资源列表
IntProgFZ.rar
- 利用分支定界法求解整数规划问题，结果精确~~~~~,Using branch and bound method to solve integer programming problems, the results of precise ~~~~~
FlushMemory
- c#管理系统源码，wpf极品动画制作源码，一般人我不告诉他-c# source code management system
colorimgseg
- 这是一个很好的彩色图像分割源代码，实验结果不错，希望对大家有帮助-This is a good color image segmentation source code, experimental results well, want to help everyone
distance
- vision file for maylab
Tegovi
- windows kernel test driver
dui
- 创建一个队列，并对所建立的队列进行简单的数据操作-Create a queue, the queue and created a simple data manipulation
round-robin
- 对任意参赛人数的循环赛赛程安排.输入参赛人数,然后算法输出循环赛赛程表.n个人的比赛需要n-1天(n为偶数)或者n天(n为基数)-Any number of entries on the arrangements for the round robin schedule. Enter the team number, then the output round-robin schedule algorithm. N individual competition needs n-1 天 (n is
DIP
- 读取.bmp图像的宽和高，并将其转换为.raw文件并显示，再进行逆转换。-To read. Bmp image width and height, and convert them to. Raw files and display, then the reverse conversion.
Rd_iteration
- 限失真函数的迭代算法,完成限失真函数的R(d)的迭代计算，并画出R(d)函数曲线-the iteration algorithm of R(d)
SOCKET.CPP
- #include <winsock2.h> #pragma comment(lib, ws2_32.lib ) int main() { WSADATA WSAData SOCKET sock SOCKADDR_IN sin char buffer[255] WSAStartup(MAKEWORD(2,0), &WSAData) Tout est configuré pour se connecter sur IRC, haa
flowshop
- 流水作业调度问题的动态规划算法,流水作业调度问题要求确定这n个作业的最优加工顺序,使得从第一个作业在机器M1上开始加工,到最后一个作业在机器M2上加工完成所需的时间最少。- Dynamic programming algorithm for flow shop scheduling problems, flow-shop scheduling problems required to determine the optimal processing sequence which n jobs