搜索结果

找到约 562 项符合 second-order 的查询结果

通讯编程文档 You imagine? Right, there s more than one possibility, this time I ll give you tree. One for your pr

You imagine? Right, there s more than one possibility, this time I ll give you tree. One for your private data, one for the common data in order to receive data from other applications like Excel, WinWord etc. and at last, I ll give you a handy-dandy class you can derive ANY MFC object from, to make ...
https://www.eeworm.com/dl/646/249493.html
下载: 130
查看: 1056

驱动编程 This the third edition of the Writing Device Drivers articles. The first article helped to simply ge

This the third edition of the Writing Device Drivers articles. The first article helped to simply get you acquainted with device drivers and a simple framework for developing a device driver for NT. The second tutorial attempted to show to use IOCTLs and display what the memory layout of Windows NT ...
https://www.eeworm.com/dl/618/252358.html
下载: 34
查看: 1036

人工智能/神经网络 aDABOOST This package contains the following files: learner.jar - is a platform independent java

aDABOOST This package contains the following files: learner.jar - is a platform independent java package. In order to run it on windows/linux open the command prompt/shell and type the command "java -jar learner.jar". Make sure the java installation path is set in the system enviroment. learner ...
https://www.eeworm.com/dl/650/252978.html
下载: 191
查看: 1039

人工智能/神经网络 OpenSVM was developped under Visual C++ 6.0 SP6, You can open the workspace file(*.dsw) in the ope

OpenSVM was developped under Visual C++ 6.0 SP6, You can open the workspace file(*.dsw) in the opensvm-src folder. The folder include the svm.h and svm.cpp which in the libsvm (Copyright (c) 2000-2007 Chih-Chung Chang and Chih-Jen Lin All rights reserved) in the opensvm-src\libsvm. However, the f ...
https://www.eeworm.com/dl/650/252980.html
下载: 38
查看: 1072

电子书籍 Designing Storage Area Networks - A Practical Reference For Implementing Fibre Channel And Ip Sans,

Designing Storage Area Networks - A Practical Reference For Implementing Fibre Channel And Ip Sans, Second Edition
https://www.eeworm.com/dl/cadence/ebook/257057.html
下载: 128
查看: 1056

数学计算 Using Gaussian elimination to solve linear equations. // In this version, we allow matrix of any si

Using Gaussian elimination to solve linear equations. // In this version, we allow matrix of any size. This is done by treating // the name of a 2-dimensional array as pointer to the beginning of the // array. This makes use of the fact that arrays in C are stored in // row-major order.
https://www.eeworm.com/dl/641/259304.html
下载: 157
查看: 1056

通讯/手机编程 The algorm of viterbi. You talk to your friend three days in a row and discover that on the first da

The algorm of viterbi. You talk to your friend three days in a row and discover that on the first day he went for a walk, on the second day he went shopping, and on the third day he cleaned his apartment. You have two questions: What is the overall probability of this sequence of observations? And w ...
https://www.eeworm.com/dl/527/260057.html
下载: 147
查看: 1051

其他书籍 unix环境高级编程英文版

unix环境高级编程英文版,很经典的一本书 Advanced Programming in the UNIX&reg Environment: Second Edition By W. Richard Stevens, Stephen A. Rago Publisher: Addison Wesley Professional Pub Date: June 17, 2005 ISBN: 0201433079 Pages: 960
https://www.eeworm.com/dl/542/261375.html
下载: 168
查看: 1041

其他 两种解决方案 Richard just finished building his new house. Now the only thing the house misses is a cute l

两种解决方案 Richard just finished building his new house. Now the only thing the house misses is a cute little wooden fence. He had no idea how to make a wooden fence, so he decided to order one. Somehow he got his hands on the ACME Fence Catalogue 2002, the ultimate resource on cute little wooden ...
https://www.eeworm.com/dl/534/262857.html
下载: 56
查看: 1044

其他 生成一个单向链表(*pListHead) 用C中的结构体或C++中的类实现 完成基本要求 基本算法要求: 实现对链表的逆序 void reverse(CList& ); 查找

生成一个单向链表(*pListHead) 用C中的结构体或C++中的类实现 完成基本要求 基本算法要求: 实现对链表的逆序 void reverse(CList& ); 查找链表倒数第k个元素 FindFBack(CList&, int k); 高要求: 对链表排序 order(CList&); 判断单向链表是否有环 ...
https://www.eeworm.com/dl/534/264422.html
下载: 132
查看: 1131