搜索资源列表
the-producer---consumer-problem
- 模拟PV操作同步机构，且用PV操作解决生产者——消费者问题-PV operation synchronization, simulation, and the use of PV operation to solve the producer- consumer problem
produce_consume
- 操作系统课程设计：很好的课程设计：研究的是生产者消费者的进程同步问题，需要的人赶紧下吧-Operating systems curriculum design: a very good curriculum design: the study is the process of the producer consumer synchronization problem, those who need it quickly, are you
heatdistribution-mpi
- 一个MPI程序，用来解决热分布问题。 热分布是一个经典的并行计算问题。 源代码还附上了测试结果和说明文档。-An MPI procedure, the distribution of hot problem to solve. Heat distribution is a classical problem of parallel computing. Source code is also attached to the test results and documentation.
Analysis-of-the-classical-problem-of-Delphi7
- Delphi 7经典问题解析-Analysis of the classical problem Delphi 7
P07164389[1].pdf
- Ant colony Algorithm for Vehicle Routing Problem wiht ComPleiton Time the pdf. it s useful to stuy GA for reader.-Ant colony Algorithm for Vehicle Routing Problem wiht ComPleiton Time the pdf. It' s useful to stuy GA for reader.
Chinese-postman-problem-for-DNA-computing
- 中国邮递员问题的DNA计算，从学校的数据资源库里找着的，感觉不错，在此向大家支持一下-Chinese postman problem for DNA computing, data resources from the school library found, an excuse, and feel good, look at this opportunity to Members to support the
IPC-Problem
- 模拟操作系统下的IPC问题，类似生产者和消费者-Modulate the IPC problem in operating system
pso_01
- 使用二进制PSO解决0-1背包问题的MATLAB程序-The use of PSO to solve 0-1 knapsack problem
MPI.Heat
- This a parallel program that solve the heat distribution problem in array mode.the 6.11 prorblem of chapter 6 in parallel programing techniques and application using networked workstations and parallel copmuters by barry wilkinson -This is a parallel
barber-problem
- baber problem of OS written in delphi
0-1-knapsack-problem-matlab
- 关于matlab解决0-1背包问题的修改，原先下载的matlab代码中有错误-Solve 0-1 knapsack problem matlab modifications, there is an error in the original download matlab code
CMP-problem
- 用C++语言解决关键路径问题，求图的关键路径原代码，可直接运行-CMP problem
Dining-philosophers-problem
- 哲学家就餐问题是一道十分经典的进程同步问题。该道题旨在解决当资源有限时（可能产生死锁），如何有效地避免死锁的问题。本实验选取“and”型信号量的解决办法，只有当哲学家具备同时拿到左右两只筷子的能力时，才能吃饭。否则，若则学家只能能够拿到一只筷子时，他只能放弃这只筷子，供其他可能需要这只筷子的哲学家使用。这样，只有哲学家左右两人均不进食时，该哲学家才有吃饭的权利。采取这种方法可以有效地避免死锁的产生。-The dining philosophers problem is a very classi
maze-problem
- 迷宫程序，输入行列值(包含围墙)，自动生成一个迷宫并自动搜索路径，其中1代表围墙，0代表通路，最后打印路径，内容很简单，默认方向由正北方顺时针搜索。三个文件中maze.c是主文件。-c program,the maze problem.
Vehicle-Routing-Problem
- 用遗传算法解决带时间窗约束的模糊车辆调度问题（fvrp）。c++编写的-Solve the fvrp problem
MFC-maze-problem-(finding-all-paths)
- 编译环境MFC，实现一个迷宫问题： 任意确定一个迷宫的规模和形态，用非递归的方法走出迷宫，并输出至少一条通路的路径。 -Compiler environment MFC, the realization of a maze problem: determining a maze of arbitrary size and shape, with a non-recursive way out of the maze, and outputs at least one channel pa
target-problem
- c语言常见的打靶问题。是初学者经常遇到的问题。该语言使用VC+6.0直接编译即可。-C language of the common target problem. Is the issue of beginners often encountered. The language use of VC+ 6.0 compiler can be directly.
knapsack-problem
- C++经典算法：背包问题讲解 共九课讲的非常清晰-C++ classic algorithms: knapsack problem to explain 9 sessions
the-problem-of-buying-productions
- 输入各个商品及其价格，输出商品对应的个数-the problem of buying productions
Placing-bouquets-problem
- 花束摆放问题现有f束不同品种的花束（每束花用1～f的整数唯一标识）和至少为同样数量的花瓶按顺序摆成一行，其位置固定于架子上并按从1到v从左到右依次摆放。其中v为花瓶的数量，则有f<=v。标识花束的整数决定了花束在花瓶中的顺序。例如有花束i和花束j（i<j）则花束j不能放在花束i的前面。每个花瓶只能放一种花束，若花瓶的个数多于花束的数量，则多出来的花瓶空置。 假设每个花瓶都具有各自的特点，那么当不同的花束放入不同的花瓶的时候便会产生不同的美学效果，并用一个美学值来（整数）表示。约定