搜索资源列表
单变量寻优
- 单变量寻优基本算法的原码，包括区间取半法，0。618法、FIB法，牛顿法、二次逼近法、三次逼近法。-single - variable optimization algorithm of the original code, including the semi-admission interval, 0. 618, FIB, Newton, quadratic approximation, three approximation.
fib序列
- 数据结构算法：使用循环队列，K阶斐波那契数列的一种算法实现。-algorithm data structure : the use of recycled cohort, K bands Fibonacci series, a method.
iik
- fib编程-fib programming
fib
- 定义：f0=f1=1, fn=fn-1+fn-2(n>=2)。{fi}称为Fibonacci数列。 输入n，求fn mod q。其中1<=q<=30000。 Input format： 第一行一个数T(1<=T<=10000)。 以下T行，每行两个数，n，q(n<=109, 1<=q<=30000)、 Output format： 文件包含T行，每行对应一个答案。
driverdev_src5
- Welcome to the fifth installment of the driver development series. The title of this article is a little bit misleading. Yes, we will be writing a TDI Client for demonstration purposes however that is not the main goal o
fib
- 模式匹配生成数组菲波那齐数列求职求值进制转换使十进制转二进制
fib
- 一个实现计算斐波那契数的汇编程序 含asm文件，课程作业只用
fib
- 利用矩阵乘法和二进制快速计算菲波拉契数列第n项
fib
- 数据结构中的非波那起序列-data structure of the non-wave sequence since then
求菲波那契函数FIB(N)-(N from 1 to 24)
- 用汇编语言,并且递归求菲波那契函数FIB(N)---(N from 1 to 24) (huangyujie)-assembly language, and for recursive function Fibonacci FIB (N )---( N from 1 to 24) (huangyujie)
微纳加工技术/
- 微米纳米加工技术—自顶向下 表面加工技术 (Surface Micromachining) 体硅加工技术 (Bulk Micromachining) LIGA (X射线曝光、微电铸、微铸塑) 电火花微加工技术 (Discharging) 激光微加工技术 (Laser micromachining) 电子束微加工技术 (E-Beam micromachining) 聚焦离子束（FIB, Focus ion beam）
fib
- 数据结构中的非波那起序列-data structure of the non-wave sequence since then
求菲波那契函数FIB(N)-(N from 1 to 24)
- 用汇编语言,并且递归求菲波那契函数FIB(N)---(N from 1 to 24) (huangyujie)-assembly language, and for recursive function Fibonacci FIB (N )---( N from 1 to 24) (huangyujie)
单变量寻优
- 单变量寻优基本算法的原码，包括区间取半法，0。618法、FIB法，牛顿法、二次逼近法、三次逼近法。-single- variable optimization algorithm of the original code, including the semi-admission interval, 0. 618, FIB, Newton, quadratic approximation, three approximation.
fib序列
- 数据结构算法：使用循环队列，K阶斐波那契数列的一种算法实现。-algorithm data structure : the use of recycled cohort, K bands Fibonacci series, a method.
fib
- 一个实现计算斐波那契数的汇编程序 含asm文件，课程作业只用-The realization of the calculation of a Fibonacci containing the assembler asm file, coursework only
Fibonacci
- 程序能够接收1～100之间的整数，根据接收的数值，计算其Fibonacci数，在屏幕上输出其值。Fibonacci数列的定义如下： Fib（1）=1 Fib（2）=1 Fib（n）=fib（n-2）+fib（n-1） -Program can receive an integer between 1 to 100, according to the received value, to calculate the Fib
fib
- CnC 斐波那契数列的例子 在112345这种openmp下不能并行的例子中，看看cnc是如何做到并行的-CnC fib example. In Fibonacci number, openmp cannot do that, see how it works in CnC
fib
- 用递归也能算fibonacci数 可用 tic,fib(10),toc查看运算时间-Using a recursive also can calculate the Fibonacci number of available tic, FIB (10), TOC to view the operation time
fib
- 定义Fib数列：1,1,2,3,5,8,13,… 1,1,2,3,5,8,13,… 求第N项除以2010 的余数(Define the Fib series: 1,1,2,3,5,8,13,... 1,1,2,3,5,8,13,... Find the remainder of item N divided by 2010)