題目：多線程同步方法解決生產(chǎn)者－消費(fèi)者問(wèn)題 （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)前指針位 置和生產(chǎn)者／消費(fèi)者標(biāo)識(shí)符。
標(biāo)簽： Bounded Problem Buffer 多線程同步
上傳時(shí)間： 2014-01-05
上傳用戶：253189838
dining philosophers problem
標(biāo)簽： philosophers problem dining
上傳時(shí)間： 2015-03-29
上傳用戶：dancnc
Computer Networks 4th Edition Problem Solutions.pdf計(jì)算機(jī)網(wǎng)絡(luò)第四版的習(xí)題解答。是原版，但是有些章節(jié)的有幾個(gè)問(wèn)題的解答存在錯(cuò)誤。本身書(shū)上的問(wèn)題也有錯(cuò)誤。
標(biāo)簽： Solutions Computer Networks Edition
上傳時(shí)間： 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.
標(biāo)簽： this Lin-Kernighan algorithm the
上傳時(shí)間： 2014-01-10
上傳用戶：stella2015
Using Genetic Algorithm to solve the 8 Queens problem.
標(biāo)簽： Algorithm Genetic problem Queens
上傳時(shí)間： 2014-11-28
上傳用戶：yd19890720
Expert Choice represents a significant contribution to the decision making process 工t assists a decision maker in solving complex problems involving many criteria and several courses of action . An Expert Choice solution to a problem reflects the expertise of the decision maker , not the computer . Behavioral scientists have spent many years studying the human mind and how it makes decisions . They have found that humans are influenced by their previous experiences and this causes them to have biases . Basic instincts , preferences and environmental factors also play key roles in how we analyze data and make decisions . There 15 way to remove these factors from human decision making , nor would we necessarily want to , but as the problems of our world become more and more complex , it 15 necessary for us to employ a framework to help make more logical and less biased decisions while still taking our feelings and intuition into consideration .
標(biāo)簽： contribution significant represents decision
上傳時(shí)間： 2015-06-02
上傳用戶：gmh1314
王勖成《有限單元法》里面的教學(xué)源程序,PROGRAM OF PLANE PROBLEM 96.1
標(biāo)簽： PROGRAM PROBLEM PLANE 96.1
上傳時(shí)間： 2014-01-09
上傳用戶：Breathe0125
Support Vector Machines is a powerful methodology for solving problems in nonlinear classification and regression. It is a matlab version.
標(biāo)簽： classification methodology nonlinear Machines
上傳時(shí)間： 2015-06-08
上傳用戶：bruce
實(shí)現(xiàn)背包問(wèn)題 package problem 1． 問(wèn)題描述 假設(shè)有一個(gè)能裝入總體積為T(mén)的背包和n件體積分別為w1 , w2 , … , wn 的物品，能否從n件物品中挑選若干件恰好裝滿背包，即使w1 +w2 + … + wn=T，要求找出所有滿足上述條件的解。例如：當(dāng)T=10，各件物品的體積{1，8，4，3，5，2}時(shí)，可找到下列4組解： （1，4，3，2）、（1，4，5）、（8，2）、（3，5，2）。 2． 基本要求 讀入T、n、w1 , w2 , … , wn 3．提示： 可利用遞歸方法：若選中w1 則問(wèn)題變成在w2 , … , wn 中挑選若干件使得其重量之和為T(mén)- w1 ，若不選中w1，則問(wèn)題變成在w2 , … , wn 中挑選若干件使得其重量之和為T(mén) 。依次類推。 也可利用回溯法的設(shè)計(jì)思想來(lái)解決背包問(wèn)題。首先將物品排成一列，然后順序選取物品裝入背包，假設(shè)已選取了前i 件物品之后背包還沒(méi)有裝滿，則繼續(xù)選取第i+1件物品，若該件物品“太大”不能裝入，則棄之而繼續(xù)選取下一件，直至背包裝滿為止。但如果在剩余的物品中找不到合適的物品以填滿背包，則說(shuō)明“剛剛”裝入背包的那件物品“不合適”，應(yīng)將它取出“棄之一邊”，繼續(xù)再?gòu)摹八蟆钡奈锲分羞x取，如此重復(fù)，，直至求得滿足條件的解，或者無(wú)解。 注：沒(méi)壓縮密碼
標(biāo)簽： package problem 體積 w2
上傳時(shí)間： 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 program from PASCAL to C.
標(biāo)簽： fastDNAml attempt problem faster
上傳時(shí)間： 2014-01-24
上傳用戶：bjgaofei
蟲(chóng)蟲(chóng)下載站版權(quán)所有 京ICP備2021023401號(hào)-1
