搜索资源列表
Multiprocess
- 多进程的解决方案 ： 创建一个包含四个窗口的多任务模拟：第一个窗口必须显示一系列的递增偶数；第二个窗口必须显示一系列的递增素数；第三个窗口必须显示任意半径的圆；第四个窗口必须显示一系列的随机矩形。-multi-process solution : Create a window contains four multi-task simulation : a window to show a series of incremental even; The second window mus
producer-consumer-problem
- Introduction In this project, we will design a programming solution to the bounded-buffer problem using the producer and consumer processes . The solution uses three semaphores: empty and full, which count the number of empty and full slots
philpsopher
- 哲学家就餐问题的解决方法 运用java多线程模拟所有解决哲学家就餐问题的方法-Solution to the dining philosophers problem using multi-threaded simulation of java all the dining philosophers problem solving
AITV_Framework
- 这是一个基于命名管道的进程通信及调度程序框架的试验版本。一个solution中包含3个Project.其中，AppScheduling是进程调度程序（这个是将来可以使用的版本），TestJiuGong和TestPlayer分别是九宫格导航和播放器的简单模拟（将来会被实现真实功能的程序所替换。） AppScheduling的功能：启动后自动隐藏窗口，启动九宫格导航。九宫格导航按1键后退出，启动播放器；播放器按0键后退出，启动九宫格导航；九宫格导航按0键后退出整个系统（包括AppScheduli
Dinning-philosophers
- 在linux下“哲学家就餐”问题的一种解法-a solution of "dining philosophers" problem under Linux
reader-writer
- 用多线程解决读者-写者问题，实现读写互斥，写写互斥，读读同步。-Readers- write the problem of multi-threaded solution, to achieve read and write mutex, write mutex, read synchronization.
Limited-CPU
- 整个解决方案的流程很简单，只有两步： 1.获得要限制CPU 占用率的进程的句柄； 2.每隔 50ms，依次调用 NtSuspendProcess 和 NtResumeProcess。比如第 50ms 调用了 NtSuspendProcess，第100ms就调用NtResumeProcess。第150ms调用NtSuspendProcess， 第 200ms就调用NtResumeProcess，如此类推下去。-The entire process of the solution
PLCTest
- 三菱PLC控制程序,多线程控制，用于过业控制的解决方案。-Mitsubishi PLC control program, multiple threads of control, control for over-industry solution.
masm_KillYourself
- Example of writing a self-removal procedure. Simple solution is implemented on masm. The code is very small.
3917153
- C++实现的软件国际化多语言解决方案,完全开源,使用方便简单-C++ implementation of multilingual solution software internationalization, completely open source, simple easy to use
ksul0
- 用vc编写的解决计算机算法中的分支限界问题,非常经典的代码,请多多指教！-Using vc to write the solution of the branch limit problem of computer algorithm, very classic code, please advice!
loeal
- 用C++实现了梯度下降求多元函数极值的算法,有可能会陷入局部最优解(By c + + implementation of a gradient descent algorithm of multivariate function extreme value, is likely to fall into local optimal solution)
tkgws
- 用C++实现了模拟退火算法求多元函数极值,可以避免陷入局部最优解(By c + + implementation of a simulated annealing algorithm for multivariate function extreme value, can avoid falling into local optimal solution)