In numerical analysis, the secant method is a root-finding algorithm that uses a succession of roots of secant lines to better approximate a root of a function f.
标签： root-finding succession numerical algorithm
上传时间： 2013-12-23
上传用户：xuanchangri
adhoc in c & c++ it hepls finding the shortest path among adhoc network . it provides advance protocols to find distence vector
标签： adhoc shortest provides finding
上传时间： 2013-12-14
上传用户：rocketrevenge
OpenCV1.0 + C++Builder6 example of finding coners programm. Highlites coners it found in frame.
标签： coners Highlites programm Builder
上传时间： 2017-08-28
上传用户：bakdesec
this is the code for finding a shortedpath in graph in althorithm
标签： shortedpath althorithm finding graph
上传时间： 2013-11-25
上传用户：ruixue198909
finding a root by position of falses
标签： position finding falses root
上传时间： 2014-12-08
上传用户：thuyenvinh
finding a root by position of falses
标签： position finding falses root
上传时间： 2013-12-18
上传用户：zjf3110
Abstract: For many first-time users, finding the right logger that meets their needs can be a challenging task. In simple
上传时间： 2014-01-19
上传用户：缥缈
pitch=CorrelogramPitch(correlogram, width [, sr, lowPitch, highPitch]) computes the pitch of a correlogram sequence by finding the time lag with the largest correlation energy.
标签： pitch CorrelogramPitch correlogram highPitch
上传时间： 2015-08-11
上传用户：youth25
Distributed Median,Alice has an array A, and Bob has an array B. All elements in A and B are distinct. Alice and Bob are interested in finding the median element of their combined arrays.
标签： array B. Distributed has
上传时间： 2013-12-25
上传用户：洛木卓
A .NET Path Finder Library Path Finder Library is a .NET library that currently contains one type called SimplePathFinder. SimplePathFinder is a very simple and basic implementation of the A* path finding algorithm. It is extremely easy to use and integrate in your applications. It works very well and I hope you enjoy using it. 这是一个用C#实现的路径搜索算法，实现的了简单的A*算法！
上传时间： 2013-12-14
上传用户：hullow
