v n vb
標(biāo)簽： vb
上傳時(shí)間： 2015-10-01
上傳用戶(hù)：as275944189
生成Bipartite Graphs ./distributions -u -m 1 -M 10 -n 100 -s 500 > top_distrib ./distributions -p -2.2 -m 1 -M 100 -n 200 -s 500 > bottom_distrib ./random_bipartite -t top_distrib -b bottom_distrib > bn_test
標(biāo)簽： distributions top_distrib Bipartite Graphs
上傳時(shí)間： 2015-10-02
上傳用戶(hù)：yy541071797
Brian W. Kernighan和Dennis M. Ritchie.寫(xiě)的權(quán)威C語(yǔ)言書(shū)籍。
標(biāo)簽： W. M. Kernighan Ritchie
上傳時(shí)間： 2015-10-04
上傳用戶(hù)：lht618
American Gladiator,You are consulting for a game show in which n contestants are pitted against n gladiators in order to see which contestants are the best. The game show aims to rank the contestants in order of strength this is done via a series of 1-on-1 matches between contestants and gladiators. If the contestant is stronger than the gladiator, then the contestant wins the match otherwise, the gladiator wins the match. If the contestant and gladiator have equal strength, then they are “perfect equals” and a tie is declared. We assume that each contestant is the perfect equal of exactly one gladiator, and each gladiator is the perfect equal of exactly one contestant. However, as the gladiators sometimes change from one show to another, we do not know the ordering of strength among the gladiators.
標(biāo)簽： contestants consulting Gladiator are
上傳時(shí)間： 2013-12-18
上傳用戶(hù)：windwolf2000
Preparation of a function, even to the importation of n, the function call seeking +1/n 1/2+1/4+ .... When n is odd input, the function call 1/1+1/3+ ... +1/n (using function pointer)
標(biāo)簽： function Preparation importation the
上傳時(shí)間： 2014-01-21
上傳用戶(hù)：semi1981
--- --- --- ----UART0: 115200,8,n,1------------------------------- Embest S3CEV40 >Embest Info&Tech Co., Ltd. Embest Info&Tech Co., Ltd. Embest S3CEV40 >
標(biāo)簽： Embest 115200 UART 3CEV
上傳時(shí)間： 2013-11-30
上傳用戶(hù)：wqxstar
本程序可以在輸入n點(diǎn)后，判斷出這n個(gè)點(diǎn)中距離最近的兩個(gè)點(diǎn)
上傳時(shí)間： 2014-01-15
上傳用戶(hù)：yepeng139
此程序?qū)崿F(xiàn)八嗲DFT運(yùn)算,已調(diào)試通過(guò)! N為運(yùn)算的點(diǎn)數(shù),運(yùn)行后再輸入運(yùn)算對(duì)象,然后回車(chē)即可!
標(biāo)簽： 運(yùn)算 DFT 程序 對(duì)象
上傳時(shí)間： 2014-01-26
上傳用戶(hù)：anng
基于決策樹(shù)的n則交叉驗(yàn)證分類(lèi)器 （決策樹(shù)程序直接調(diào)用matlab中的） crossvalidate.m N則交叉驗(yàn)證程序，N可選 NDT.mat 含9個(gè)國(guó)際公認(rèn)標(biāo)準(zhǔn)數(shù)據(jù)集，已做過(guò)標(biāo)么處理，可直接使用 專(zhuān)業(yè)
標(biāo)簽： crossvalidate matlab 決策樹(shù) 交叉驗(yàn)證
上傳時(shí)間： 2013-12-29
上傳用戶(hù)：784533221
假定已經(jīng)有許多應(yīng)用采用了程序1 - 1 5中所定義的C u r r e n c y類(lèi)，現(xiàn)在我們想要對(duì)C u r r e n c y類(lèi) 的描述進(jìn)行修改，使其應(yīng)用頻率最高的兩個(gè)函數(shù)A d d和I n c r e m e n t可以運(yùn)行得更快，從而提高應(yīng) 用程序的執(zhí)行速度。由于用戶(hù)僅能通過(guò)p u b l i c部分所提供的接口與C u r r e n c y類(lèi)進(jìn)行交互，
上傳時(shí)間： 2015-10-11
上傳用戶(hù)：BIBI
蟲(chóng)蟲(chóng)下載站版權(quán)所有 京ICP備2021023401號(hào)-1
