搜索资源列表
EULERDemo
- /* * EULER S ALGORITHM 5.1 * * TO APPROXIMATE THE SOLUTION OF THE INITIAL VALUE PROBLEM: * Y = F(T,Y), A<=T<=B, Y(A) = ALPHA, * AT N+1 EQUALLY SPACED POINTS IN THE INTERVAL [A,B]. * * INPUT: ENDPOINTS A,B INITIAL CONDITION ALPHA I
Colored-Sticks
- 北京大学ACM/ICPC竞赛队 2009 PKU ACM/ICPC Trainning 14 Colored Sticks F:Colored Sticks 时间限制: 5000ms 内存限制: 65536kB 描述 You are given a bunch of wooden sticks. Each endpoint of each stick is colored with some color. Is it possible to ali
two-find
- 通过每次把f(x)的零点所在小区间收缩一半的方法，使区间的两个端点逐步迫近函数的零点，以求得零点的近似值，这种方法叫做二分法-By the time f (x) between the zero shrinkage area where half of the ways in which the two endpoints of interval functions gradually approaching zero, in order to achieve zero approximati
a4
- Write a program that reads as its inputs four pairs of (x, y) coordinates of the endpoints of two line segments P1P2 and P3P4. Your program should decide whether the two line segments have a common point. For this problem you may use matlab in order
Ex6_13
- 【例6.13】梯形法求积分的函数integer()是通用函数，可求任一函数的定积分。不同的函数有不同的解析式， //该解析式决定了自变量在每一个小积分区间端点处的函数值。函数 integer()以一个指向函数的指针为参数， //由该参数调用欲求定积分的函数，另两个参数是积分上下限。-[Example 6.13] the trapezoidal method to seek the integral function integer () is a universal function,
FBNQ
- 斐波那契算法也是一种区间收缩算法，同时改变搜索区间的两个端点，，是一种双向收缩发。-Fibonacci algorithm is also a range contraction algorithm, while changing the search interval of the two endpoints, is a two-way contraction hair.
EdgeFollowing
- It is an edge detection algorithm. This algorithm prepare Best edge of Input Image by such method like NMS(None Maximum) , Hysteresis method and Laplace filter. --II: [M,N]=size(gim_G) B = zeros(size(gim_G)) B( edgecnd(:,1) ) = 1 ---I