<center id="mciiq"></center>
％調用格式 =trapez_g( f_name ,a,b,n) ％f_name: 被積函數的文件名f(x) ％ a:x的上限 ％ b:x的下限 ％ 部分區間數 ％實例：trapez_g( sin ,0,pi,20)
上傳時間： 2013-12-19
上傳用戶：cjl42111
Program main BIOS image | | /B - Program Boot Block | | /N - Program NVRAM | | /C - Destroy CMOS checksum | | /E - Program Embedded Controller Block | | /K - Program all non-critical blocks | | /Kn - Program n th non-critical block only(n=0-7) | | /Q - Silent execution | | /REBOOT - Reboot after programming | | /X - Don t Check ROM ID | | /S - Display current system s ROMID | | /Ln - Load CMOS defaults
標簽： Program Destroy Block NVRAM
上傳時間： 2016-07-26
上傳用戶：wfl_yy
采用3D Bresenham算法在兩點間劃一直線 ％ This program is ported to MATLAB from: ％ B.Pendleton. line3d - 3D Bresenham s (a 3D line drawing algorithm) ％ ftp://ftp.isc.org/pub/usenet/comp.sources.unix/volume26/line3d, 1992 ％ ％ Which is referenced by: ％ Fischer, J., A. del Rio (2004). A Fast Method for Applying Rigid ％ Transformations to Volume Data, WSCG2004 Conference. ％ http://wscg.zcu.cz/wscg2004/Papers_2004_Short/M19.pdf
標簽： Bresenham Pendleton program MATLAB
上傳時間： 2013-12-10
上傳用戶：sz_hjbf
計算機網絡-系統方法 第三版 英文版 作 者： （美）彼德森（Peterson,L.L.） 等著 出 版 社： 機械工業出版社 出版時間： 2005-3-1 字 數： 版 次： 1 頁 數： 813 印刷時間： 2005/03/01 開 本： 印 次： 紙 張： 膠版紙 I S B N ： 9787111160564 包 裝： 平裝 所屬分類： 圖書 >> 計算機/網絡 >> 計算機理論
上傳時間： 2013-12-27
上傳用戶：weiwolkt
The "GEE! It s Simple" package illustrates Gaussian elimination with partial pivoting, which produces a factorization of P*A into the product L*U where P is a permutation matrix, and L and U are lower and upper triangular, respectively. The functions in this package are accurate, but they are far slower than their MATLAB equivalents (x=A\b, [L,U,p]=lu(A), and so on). They are presented here merely to illustrate and educate. "Real" production code should use backslash and lu, not this package.
標簽： illustrates elimination Gaussian pivoting
上傳時間： 2016-11-09
上傳用戶：wang5829
The "GEE! It s Simple" package illustrates Gaussian elimination with partial pivoting, which produces a factorization of P*A into the product L*U where P is a permutation matrix, and L and U are lower and upper triangular, respectively. The functions in this package are accurate, but they are far slower than their MATLAB equivalents (x=A\b, [L,U,p]=lu(A), and so on). They are presented here merely to illustrate and educate. "Real" production code should use backslash and lu, not this package.
標簽： illustrates elimination Gaussian pivoting
上傳時間： 2014-01-21
上傳用戶：lxm
Problem B:Longest Ordered Subsequence A numeric sequence of ai is ordered if a1 < a2 < ... < aN. Let the subsequence of the given numeric sequence (a1, a2, ..., aN) be any sequence (ai1, ai2, ..., aiK), where 1 <= i1 < i2 < ... < iK <= N. For example, sequence (1, 7, 3, 5, 9, 4, 8) has ordered subsequences, e. g., (1, 7), (3, 4, 8) and many others. All longest ordered subsequences are of length 4, e. g., (1, 3, 5, 8).
標簽： Subsequence sequence Problem Longest
上傳時間： 2016-12-08
上傳用戶：busterman
Data Structures and Algorithms with Object-Oriented Design Patterns in Java Bruno R. Preiss B.A.Sc., M.A.Sc., Ph.D., P.Eng. Associate Professor Department of Electrical and Computer Engineering University of Waterloo, Waterloo, Canada
標簽： B.A.S R. Object-Oriented Algorithms
上傳時間： 2017-03-07
上傳用戶：z754970244
設B是一個n×n棋盤，n=2k,(k=1,2,3,…)。用分治法設計一個算法，使得：用若干個L型條塊可以覆蓋住B的除一個特殊方格外的所有方格。其中，一個L型條塊可以覆蓋3個方格。且任意兩個L型條塊不能重疊覆蓋棋盤。
標簽：
上傳時間： 2013-12-19
上傳用戶：xc216
21世紀大學新型參考教材系列 集成電路B 荒井
上傳時間： 2013-04-15
上傳用戶：eeworm
<rt id="aumcc"></rt>