If you learned the Queueing theorem, You certainly remember the basic model, M/M/1. This is the source code of it.
標(biāo)簽： the certainly Queueing remember
上傳時間： 2014-05-29
上傳用戶：希醬大魔王
we determin a chaos mode and alyalize the time application to find if its really chaos and will have the character
標(biāo)簽： chaos application and determin
上傳時間： 2015-11-28
上傳用戶：海陸空653
This is a free program but it works fine, please try to see if that can work on ur machine t
標(biāo)簽： program machine please works
上傳時間： 2015-12-03
上傳用戶：liuchee
the souce code of thinking in java (1-10),if you want to learn java ,please read it and you will get more
標(biāo)簽： java you thinking please
上傳時間： 2013-11-28
上傳用戶：363186
ucOS_ii,source from disk,Maybe it s useful for you if you would studt ucosii.
標(biāo)簽： you ucOS_ii source useful
上傳時間： 2015-12-08
上傳用戶：阿四AIR
#include<iostream> using namespace std int main() { unsigned long x,warcraft,war,l cin> x while(x) { unsigned long *p=new unsigned long[x+1] if(p==NULL) { cerr<<"error!"<<endl abort() } for(warcraft=0 warcraft<=x warcraft++) *(p+warcraft)=0 *p=1 for(warcraft=0 warcraft<x warcraft++) { cout<<*p<<" " war=*p for(l=1 x>1 l++) { if(*(p+l)==0) { cout<<endl *(p+l)=1 break } else { cout<<*(p+l)<<" " *(p+l)=war+*(p+l) war=*(p+l)-war } } } cout<<endl delete [] p cin>>x } return 0 }
標(biāo)簽： namespace iostream unsigned warcraft
上傳時間： 2015-12-12
上傳用戶：manlian
some example which explain kalman clearly,if you know little about kalman,it will be good choice.
標(biāo)簽： kalman example clearly explain
上傳時間： 2014-01-22
上傳用戶：梧桐
#if !defined(AFX_GAQUEEN_H__C26AE0A3_F9B4_426F_A324_B460CC7946CB__INCLUDED_) #define AFX_GAQUEEN_H__C26AE0A3_F9B4_426F_A324_B460CC7946CB__INCLUDED_ #if _MSC_VER > 1000 #pragma once #endif // _MSC_VER > 1000 class CGAQueen { public: CGAQueen(int nPopulation,int nIteration,float Mutation,int mChBoard) virtual ~CGAQueen() void Clear() // to clear chess board with 0 value void InitialPopulation() // to create the first and initial randompopulation void FillArea(int index) // to fill chess board with desired chromosome int CostFunc(int index) // determine the cost of matrix[index][index] void PopulationSort() // to sort population from the best to the worst void GenerateCrossOverMatrix() // a way to create children from parent is CcrossOver void Mating() // to create children from parents void Ap
標(biāo)簽： AFX_GAQUEEN_H INCLUDED defined define
上傳時間： 2015-12-27
上傳用戶：wuyuying
It s easy to tell if two words are identical.
標(biāo)簽： identical words easy tell
上傳時間： 2015-12-28
上傳用戶：rishian
this will produce the dci program in the src/ directory, or in /path/to/your/installation/bin if you used the--prefix option during the configure step and issued a "make install".
標(biāo)簽： installation directory the produce
上傳時間： 2016-01-04
上傳用戶：15071087253
蟲蟲下載站版權(quán)所有 京ICP備2021023401號-1
