/* * 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 INTEGER N. * * OUTPUT: APPROXIMATION W TO Y AT THE (N+1) VALUES OF T. */
標簽： APPROXIMATE ALGORITHM THE SOLUTION
上傳時間： 2015-08-20
上傳用戶：zhangliming420
生成Bipartite Graphs ./distributions -u -m 1 -M 10 -n 100 -s 500 > top_distrib ./distributions -p -2.2 -m 1 -M 100 -n 200 -s 500 > bottom_distrib ./random_bipartite -t top_distrib -b bottom_distrib > bn_test
標簽： distributions top_distrib Bipartite Graphs
上傳時間： 2015-10-02
上傳用戶：yy541071797
palm編成,這種書很少,有興趣看看 Title: Palm Programming: The Developer s Guide URL: http://safari.oreilly.com/JVXSL.asp?x=1&mode=section&sortKey=rank&sortOrder=desc&view=book&xmlid=1-56592-525-4&open=false&srchText=palm+programming&code=&h=&m=&l=1&catid=&s=1&b=1&f=1&t=1&c=1&u=1&page=0 ISBN: 1-56592-525-4 Author: Julie McKeehan/ Neil Rhodes Publisher: O Reilly Page: 478 Edition: 1st edition (December 1998) Catalog: PDA programming / Palm Format: pdf Size: 2.06M Supplier: Summary: Emerging as the bestselling hand-held computers of all time, PalmPilots have spawned intense developer activity and a fanatical following. Used by Palm in their developer training, this tutorial-style book shows intermediate to experienced C programmers how to build a Palm application from the ground up. Includes a CD-ROM with source code and third-party developer tools
標簽： Programming Developer oreilly safari
上傳時間： 2013-12-10
上傳用戶：litianchu
HDOJ ACM input:The input consists of T test cases. The number of test cases ) (T is given in the first line of the input. Each test case begins with a line containing an integer N , 1<=N<=200 , that represents the number of tables to move. Each of the following N lines contains two positive integers s and t, representing that a table is to move from room number s to room number t (each room number appears at most once in the N lines). From the N+3-rd line, the remaining test cases are listed in the same manner as above.
上傳時間： 2015-10-18
上傳用戶：三人用菜
Hey. This some pid code for the atmega88 that I once used to control a heater. It s purpose is pretty specific, and I only wrote it to work on the mega88, so the code itself won t be too useful. It is a good place to start if you re trying to use or figure out pid though.
標簽： control purpose atmega heater
上傳時間： 2013-12-19
上傳用戶：天誠24
C++, although a marvelous language, isn t perfect. Matthew Wilson has been working with it for over a decade, and during that time he has found inherent limitations that require skillful workarounds. In this book, he doesn t just tell you what s wrong with C++, but offers practical techniques and tools for writing code that s more robust, flexible, efficient, and maintainable. He shows you how to tame C++ s complexity, cut through its vast array of paradigms, take back control over your code--and get far better results
標簽： marvelous although language Matthew
上傳時間： 2014-01-22
上傳用戶：妄想演繹師
Using the UnderC Tokenizer Class It s often necessary to parse complex text files, where standard i/o is too clumsy. C programmers fall back on strtok(), but this can be tricky to use properly. Besides, you are still responsible for keeping strtok() fed with new input, and I don t like the schlepp. Tokenizer is a text-parsing input stream, modelled after the (undocumented) VCL TParser class, and based on the UnderC tokenizing preprocessor front-end.
標簽： Tokenizer necessary standard complex
上傳時間： 2013-12-16
上傳用戶：whenfly
ITU-T G.729語音壓縮算法。 description: Fixed-point description of commendation G.729 with ANNEX B Coding of Speech at 8 kbit/s using Conjugate-Structure Algebraic-Code-Excited Linear-Prediction (CS-ACELP) with Voice Activity Decision(VAD), Discontinuous Transmission(DTX), and Comfort Noise Generation(CNG).
標簽： description commendation Fixed-point 729
上傳時間： 2014-11-23
上傳用戶：thesk123
設T[0:n-1]是n個元素的一個數組。對任一元素x，設S(x)={i|T[i]=x}。當|S(x)|>n/2時，稱x為T的主元素。設計一個線性時間算法，確定T[0:n]是否有一個主元素。
上傳時間： 2014-01-08
上傳用戶：daoxiang126
設T[0:n-1]是n個元素的一個數組。對任一元素x，設S(x)={i|T[i]=x}。當|S(x)|>n/2時，稱x為T的主元素。設計一個線性時間算法，確定T[0:n]是否有一個主元素。
上傳時間： 2013-12-13
上傳用戶：2525775
