dining philosophers problem
資源簡(jiǎn)介：dining philosophers problem
上傳時(shí)間： 2015-03-29
上傳用戶：dancnc
資源簡(jiǎn)介：linux用多線程同步方法解決哲學(xué)家就餐問題(dining-philosophers problem)
上傳時(shí)間： 2014-01-15
上傳用戶：hzy5825468
資源簡(jiǎn)介：鈥?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 ...
上傳時(shí)間： 2017-03-02
上傳用戶：kristycreasy
資源簡(jiǎn)介：怎樣使用Nios II處理器來構(gòu)建多處理器系統(tǒng) Chapter 1. Creating Multiprocessor Nios II Systems Introduction to Nios II Multiprocessor Systems . . . . . . . . . . . . . . 1–1 Benefits of Hierarchical Multiprocessor Systems? . . . . . . . . . ....
上傳時(shí)間： 2013-11-21
上傳用戶：lo25643
資源簡(jiǎn)介：typical problem of the philosophers
上傳時(shí)間： 2017-03-16
上傳用戶：zhanditian
資源簡(jiǎn)介：dining Philosopher s problem
上傳時(shí)間： 2017-03-28
上傳用戶：tyler
資源簡(jiǎn)介：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...
上傳時(shí)間： 2015-01-11
上傳用戶：as275944189
資源簡(jiǎn)介：aco for TSP problem source code
上傳時(shí)間： 2015-03-07
上傳用戶：helmos
資源簡(jiǎn)介：題目：多線程同步方法解決生產(chǎn)者－消費(fèi)者問題 （Bounded - Buffer problem） 內(nèi)容：有界緩沖區(qū)內(nèi)設(shè)有１０個(gè)存儲(chǔ)單元，放入／取出的數(shù)據(jù)項(xiàng) 設(shè)定為１～１０這１０個(gè)整形數(shù)。要求每個(gè)生產(chǎn)者和消費(fèi)者對(duì)有界 緩沖區(qū)進(jìn)行操作后，即時(shí)顯示有界緩沖區(qū)的全部?jī)?nèi)容、當(dāng)前...
上傳時(shí)間： 2014-01-05
上傳用戶：253189838
資源簡(jiǎn)介：Computer Networks 4th Edition problem Solutions.pdf計(jì)算機(jī)網(wǎng)絡(luò)第四版的習(xí)題解答。是原版，但是有些章節(jié)的有幾個(gè)問題的解答存在錯(cuò)誤。本身書上的問題也有錯(cuò)誤。
上傳時(shí)間： 2015-04-04
上傳用戶：xiaoxiang
資源簡(jiǎn)介：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.
上傳時(shí)間： 2014-01-10
上傳用戶：stella2015
資源簡(jiǎn)介：Using Genetic Algorithm to solve the 8 Queens problem.
上傳時(shí)間： 2014-11-28
上傳用戶：yd19890720
資源簡(jiǎn)介：王勖成《有限單元法》里面的教學(xué)源程序,PROGRAM OF PLANE problem 96.1
上傳時(shí)間： 2014-01-09
上傳用戶：Breathe0125
資源簡(jiǎn)介：實(shí)現(xiàn)背包問題 package problem 1． 問題描述 假設(shè)有一個(gè)能裝入總體積為T的背包和n件體積分別為w1 , w2 , … , wn 的物品，能否從n件物品中挑選若干件恰好裝滿背包，即使w1 +w2 + … + wn=T，要求找出所有滿足上述條件的解。例如：當(dāng)T=10，各件物品的體積{1...
上傳時(shí)間： 2014-01-18
上傳用戶：yxgi5
資源簡(jiǎn)介：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...
上傳時(shí)間： 2014-01-24
上傳用戶：bjgaofei
資源簡(jiǎn)介：彩票中的數(shù)學(xué)lottery problem.pdf
上傳時(shí)間： 2015-06-25
上傳用戶：qwe1234
資源簡(jiǎn)介：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
上傳時(shí)間： 2013-12-06
上傳用戶：nanfeicui
資源簡(jiǎn)介：- 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: ...
上傳時(shí)間： 2015-07-04
上傳用戶：Avoid98
資源簡(jiǎn)介：The Dynamic Assignment problem，動(dòng)態(tài)排班問題，使用到了各個(gè)智能算法
上傳時(shí)間： 2013-12-21
上傳用戶：q123321
資源簡(jiǎn)介：solve the 8-puzzle problem using A* algorithm. Definitely written by my self, also include BGI graphics library output.
上傳時(shí)間： 2014-01-17
上傳用戶：zm7516678
資源簡(jiǎn)介：use genetic ant algorithm to slove TSP problem
上傳時(shí)間： 2013-12-26
上傳用戶：小碼農(nóng)lz
資源簡(jiǎn)介：A matlab code for a reinforment learning routing problem
上傳時(shí)間： 2015-07-19
上傳用戶：zhaoq123
資源簡(jiǎn)介：源自 adaptive filter theory 書本上problem範(fàn)例。
上傳時(shí)間： 2014-01-20
上傳用戶：許小華
資源簡(jiǎn)介：/* * 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...
上傳時(shí)間： 2015-08-20
上傳用戶：zhangliming420
資源簡(jiǎn)介：producer-consumer problem 的源碼
上傳時(shí)間： 2015-08-21
上傳用戶：llandlu
資源簡(jiǎn)介：吃蘋果eating apple problem問題代碼
上傳時(shí)間： 2015-08-21
上傳用戶：天涯
資源簡(jiǎn)介：reader-writer-problem讀者寫者問題代碼
上傳時(shí)間： 2015-08-21
上傳用戶：佳期如夢(mèng)
資源簡(jiǎn)介：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...
上傳時(shí)間： 2013-12-11
上傳用戶：libenshu01
資源簡(jiǎn)介：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?
上傳時(shí)間： 2015-08-23
上傳用戶：zhenyushaw
資源簡(jiǎn)介：This a parallel genetic algorithm for a biinfomatics problem CSP
上傳時(shí)間： 2015-08-26
上傳用戶：x4587
