搜索资源列表
Ga
- GA_Traffic The Traveling Salesman Problem (TSP) is maybe the archetypical problem in combinatorial optimization. This problem and its generalizations, vehicle routing problems, have been studied for more than thirty years two entire monograph
RombergTest2
- 函数逼近与曲线拟合，包含梯形公式、Simpson公式、Romberg公式。-Function approximation and curve fitting, including trapezoidal, Simpson formula, Romberg formula.
c1_2
- java语音编写的程序，用来求自然数底e的近似值-java program written in the voice, to find an approximation of the natural log base e
Rough-Set_src_1.0
- Temporal Rough Logic is a combination of both Normal and Temporal Modal Logics. TRL formulas are interpreted over Dynamic Approximation Spaces. For checking validiy in TRL a Prefixed Tableaux System was proposed by Md.Aquil Khan and Dr.M.Banerjee in
h1n1triage
- Temporal Rough Logic is a combination of both Normal and Temporal Modal Logics. TRL formulas are interpreted over Dynamic Approximation Spaces. For checking validiy in TRL a Prefixed Tableaux System was proposed by Md.Aquil Khan and Dr.M.Banerjee in
hermit
- hermit差值，构造函数，进行一次差值，二次差值，数值逼近-hermit difference, constructor, the time difference, the second difference, numerical approximation
MimeBodyPart
- TODO this is a close approximation of Message, need to update along with.
count-hosts
- return an approximation to the result of x to the power of y.
unhandled_exception
- return an approximation to the cosine of the argument.
Gamma
- 提供级数法和Lanczos逼近法计算伽马函数近似值，java语言编写-Provide progression method and Lanczos approximation to calculate the gamma function approximation, java language