easy way to learn SQL-Server... recommended (Y)
標(biāo)簽： recommended SQL-Server learn easy
上傳時間： 2013-12-08
上傳用戶：zhanditian
LabVIEW 8 Proporciona Inteligencia Distribuida para Prueba, Control y Dise帽o
標(biāo)簽： Inteligencia Distribuida Proporciona LabVIEW
上傳時間： 2013-12-09
上傳用戶：liglechongchong
Varios ejemplos para utilizar la PIC 16F876 en assembrer y CCS
標(biāo)簽： assembrer ejemplos utilizar Varios
上傳時間： 2013-12-25
上傳用戶：wlcaption
Matematicas y logica
標(biāo)簽： Matematicas logica
上傳時間： 2013-12-10
上傳用戶：banyou
SFLOP simulates a floating point operation x op y where op = +, -, *, / In chopping or rounding arithmetic using an m digit mantissa, base 10, and an unrestricted exponent range. (sflop: Simulate FLOating Point operation.) For more details on the how the floating point representation of a number is computed see the function sfl.
標(biāo)簽： simulates operation floating SFLOP
上傳時間： 2017-06-05
上傳用戶：fxf126@126.com
FFTGUI Demonstration of Finite Fourier Transform. FFTGUI(y) plots real(y), imag(y), real(fft(y)) and imag(fft(y)). FFTGUI, without any arguments, uses y = zeros(1,32). When any point is moved with the mouse, the other plots respond. Inspired by Java applet by Dave Hale, Stanford Exploration Project, http://sepwww.stanford.edu/oldsep/hale/FftLab.html
標(biāo)簽： FFTGUI real Demonstration Transform
上傳時間： 2017-06-05
上傳用戶：anng
Exceptional C++ shows by example how to go about solid software engineering. Along with a lot of other material, this book includes expanded versions of the first 30 issues of the popular Internet C++ feature Guru of the Week (or, in its short form, GotW), a series of self-contained C++ engineering problems and solutions that illustrate specific design and coding techniques.
標(biāo)簽： Exceptional engineering software example
上傳時間： 2017-06-07
上傳用戶：yt1993410
迷宮算法（maze） /* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK, * 1 means cannot go there, boundary is 0 and 9, cannot go beyond boundary. * Each step can be made horizontally or vertically for one more grid (diagonal * jump is not allowed). * Your program should print a series of grid coordinates that start from m[0][0] * and go to m[9][9] * Hint: No need to find the shortest path, only need to find one path that gets * you to desitination. */
標(biāo)簽： Starting point means maze
上傳時間： 2013-12-27
上傳用戶：Divine
fortran 語 言 編 寫 基 本 遺 傳 算 法 源 程 序 fortran Genetic Algorithms written by FORTRAN
標(biāo)簽： fortran Algorithms Genetic FORTRAN
上傳時間： 2014-01-12
上傳用戶：gtzj
Need to deploy exchange 2003? Don t know where to go for all the answers? READ THIS and answer those questions.
標(biāo)簽： exchange answers deploy answer
上傳時間： 2017-06-12
上傳用戶：zhangliming420
蟲蟲下載站版權(quán)所有 京ICP備2021023401號-1
