dining philosophers problem
资源简介:dining philosophers problem
上传时间: 2015-03-29
上传用户:dancnc
资源简介:linux用多线程同步方法解决哲学家就餐问题(dining-philosophers problem)
上传时间: 2014-01-15
上传用户:hzy5825468
资源简介:鈥?What Is a Thread? o The Thread Class o Simple Thread Examples 鈥?problems with Multithreading o What Goes Wrong? o Thread Names and Current Threads o Java s synchronized 鈥?Synchronizing Threads o Multiple Locks 鈥?The ...
上传时间: 2017-03-02
上传用户:kristycreasy
资源简介:怎样使用Nios II处理器来构建多处理器系统 Chapter 1. Creating Multiprocessor Nios II Systems Introduction to Nios II Multiprocessor Systems . . . . . . . . . . . . . . 1–1 Benefits of Hierarchical Multiprocessor Systems . . . . . . . . . ....
上传时间: 2013-11-21
上传用户:lo25643
资源简介:typical problem of the philosophers
上传时间: 2017-03-16
上传用户:zhanditian
资源简介:dining Philosopher s problem
上传时间: 2017-03-28
上传用户:tyler
资源简介:Generating next numbers in SQLServer should not be a problem. But problems arise when a customer asks for different types of next numbers that you cannot generate directly from SQL Server. This brief article describes how you would tackle t...
上传时间: 2015-01-11
上传用户:as275944189
资源简介:aco for TSP problem source code
上传时间: 2015-03-07
上传用户:helmos
资源简介:题目:多线程同步方法解决生产者-消费者问题 (Bounded - Buffer problem) 内容:有界缓冲区内设有10个存储单元,放入/取出的数据项 设定为1~10这10个整形数。要求每个生产者和消费者对有界 缓冲区进行操作后,即时显示有界缓冲区的全部内容、当前...
上传时间: 2014-01-05
上传用户:253189838
资源简介:Computer Networks 4th Edition problem Solutions.pdf计算机网络第四版的习题解答。是原版,但是有些章节的有几个问题的解答存在错误。本身书上的问题也有错误。
上传时间: 2015-04-04
上传用户:xiaoxiang
资源简介:this tar includes my code which employ the Lin-Kernighan algorithm to address the tsp problem. this tar also include some testfiles and config file and a readme which describes how to run this program.
上传时间: 2014-01-10
上传用户:stella2015
资源简介:Using Genetic Algorithm to solve the 8 Queens problem.
上传时间: 2014-11-28
上传用户:yd19890720
资源简介:王勖成《有限单元法》里面的教学源程序,PROGRAM OF PLANE problem 96.1
上传时间: 2014-01-09
上传用户:Breathe0125
资源简介:实现背包问题 package problem 1. 问题描述 假设有一个能装入总体积为T的背包和n件体积分别为w1 , w2 , … , wn 的物品,能否从n件物品中挑选若干件恰好装满背包,即使w1 +w2 + … + wn=T,要求找出所有满足上述条件的解。例如:当T=10,各件物品的体积{1...
上传时间: 2014-01-18
上传用户:yxgi5
资源简介:fastDNAml is an attempt to solve the same problem as DNAML, but to do so faster and using less memory, so that larger trees and/or more bootstrap replicates become tractable. Much of fastDNAml is merely a recoding of the PHYLIP 3.3 DNAML...
上传时间: 2014-01-24
上传用户:bjgaofei
资源简介:彩票中的数学lottery problem.pdf
上传时间: 2015-06-25
上传用户:qwe1234
资源简介:This program is using Genetic Algorithm to solve the Travlling Salesman problem. It gives the best path route within a specified time. usage: java Evolver <seconds> <city file> <config file> Author: Liu Yang
上传时间: 2013-12-06
上传用户:nanfeicui
资源简介:- XCS for Dynamic Environments + Continuous versions of XCS + Test problem: real multiplexer + Experiments: XCS is explored in dynamic environments with different magnitudes of change to the underlying concepts. +Reference papers: ...
上传时间: 2015-07-04
上传用户:Avoid98
资源简介:The Dynamic Assignment problem,动态排班问题,使用到了各个智能算法
上传时间: 2013-12-21
上传用户:q123321
资源简介:solve the 8-puzzle problem using A* algorithm. Definitely written by my self, also include BGI graphics library output.
上传时间: 2014-01-17
上传用户:zm7516678
资源简介:use genetic ant algorithm to slove TSP problem
上传时间: 2013-12-26
上传用户:小码农lz
资源简介:A matlab code for a reinforment learning routing problem
上传时间: 2015-07-19
上传用户:zhaoq123
资源简介:源自 adaptive filter theory 書本上problem範例。
上传时间: 2014-01-20
上传用户:许小华
资源简介:/* * EULER S ALGORITHM 5.1 * * TO APPROXIMATE THE SOLUTION OF THE INITIAL VALUE problem: * Y = F(T,Y), A<=T<=B, Y(A) = ALPHA, * AT N+1 EQUALLY SPACED POINTS IN THE INTERVAL [A,B]. * * INPUT: ENDPOINTS A,B INITIAL CONDITION ALPHA INTE...
上传时间: 2015-08-20
上传用户:zhangliming420
资源简介:producer-consumer problem 的源码
上传时间: 2015-08-21
上传用户:llandlu
资源简介:吃苹果eating apple problem问题代码
上传时间: 2015-08-21
上传用户:天涯
资源简介:reader-writer-problem读者写者问题代码
上传时间: 2015-08-21
上传用户:佳期如梦
资源简介:ACM试题An Easy problem Description As we known, data stored in the computers is in binary form. The problem we discuss now is about the positive integers and its binary form. Given a positive integer I, you task is to find out an integer...
上传时间: 2013-12-11
上传用户:libenshu01
资源简介:ACM试题problem K:Ones Description Given any integer 0 <= n <= 10000 not divisible by 2 or 5, some multiple of n is a number which in decimal notation is a sequence of 1 s. How many digits are in the smallest such a multiple of n?
上传时间: 2015-08-23
上传用户:zhenyushaw
资源简介:This a parallel genetic algorithm for a biinfomatics problem CSP
上传时间: 2015-08-26
上传用户:x4587