搜索：P-Channel - 虫虫下载站

软件设计/软件工程  1.能实现不同的个数的矩阵连乘. 2.最后矩阵大小是8X8. 3是最优的矩阵相乘. 描述：给定n 个矩阵｛A1, A2,...,An｝

1.能实现不同的个数的矩阵连乘. 2.最后矩阵大小是8X8. 3是最优的矩阵相乘. 描述：给定n 个矩阵｛A1, A2,...,An｝，其中Ai与Ai+1是可乘的，i=1，2…，n-1。考察这n个矩阵的连乘积A1A2...An。矩阵A 和B 可乘的条件是矩阵A的列数等于矩阵B 的行数。若A 是一个p x q矩阵，B是一个q * r矩阵，则其乘积C=AB是一个p * r矩阵,需 ...

https://www.eeworm.com/dl/684/154501.html

下载: 31

查看: 1431

数据结构  最接近点对问题是求二维坐标中的点对问题

最接近点对问题是求二维坐标中的点对问题，该算法是为了将平面上点集S线性分割为大小大致相等的2个子集S1和S2，我们选取一垂直线l:x=m来作为分割直线。其中m为S中各点x坐标的中位数。由此将S分割为S1={p∈S|px≤m}和S2={p∈S|px>m}。从而使S1和S2分别位于直线l的左侧和右侧，且S=S1∪S2 。由于m是S中各点x坐标值的中位数， ...

https://www.eeworm.com/dl/654/154758.html

下载: 160

查看: 1139

数据结构  #include "stdio.h" #include "math.h" #include "malloc.h" #include "string.h" #define m 6 #defin

#include "stdio.h" #include "math.h" #include "malloc.h" #include "string.h" #define m 6 #define n 29 #define p 0.5

https://www.eeworm.com/dl/654/155766.html

下载: 162

查看: 1368

数据结构  #include "stdio.h" #include "math.h" #include "malloc.h" #include "string.h" #define m 6 #defin

#include "stdio.h" #include "math.h" #include "malloc.h" #include "string.h" #define m 6 #define n 29 #define p 0.5

https://www.eeworm.com/dl/654/155768.html

下载: 164

查看: 1144

数学计算  #include "stdio.h" #include "math.h" #include "malloc.h" #include "string.h" #define m 6 #defin

#include "stdio.h" #include "math.h" #include "malloc.h" #include "string.h" #define m 6 #define n 29 #define p 0.5

https://www.eeworm.com/dl/641/155770.html

下载: 50

查看: 1382

人工智能/神经网络  #include "stdio.h" #include "math.h" #include "malloc.h" #include "string.h" #define m 6 #defin

#include "stdio.h" #include "math.h" #include "malloc.h" #include "string.h" #define m 6 #define n 29 #define p 0.5

https://www.eeworm.com/dl/650/155771.html

下载: 171

查看: 1057

单片机开发  These routines transmit and receive serial data using two general * I/O pins, in 8 bit, No parity,

These routines transmit and receive serial data using two general * I/O pins, in 8 bit, No parity, 1 stop bit format. They are useful * for performing serial I/O on 8051 derivatives not having an * internal UART, or for implementing a second serial channel.

https://www.eeworm.com/dl/648/155849.html

下载: 149

查看: 1069

Java书籍  JavaMail开发手册.pdf 英文教材 1. Tutorial tips 2 2. Introducing the JavaMail API 3 3. Reviewing related p

JavaMail开发手册.pdf 英文教材 1. Tutorial tips 2 2. Introducing the JavaMail API 3 3. Reviewing related protocols 4 4. Installing JavaMail 6 5. Reviewing the core classes 8 6. Using the JavaMail API 13 7. Searching with SearchTerm 21 8. Exercises 22 9. Wrapup 32

https://www.eeworm.com/dl/656/156747.html

下载: 59

查看: 1046

其他  These instructions assume that the 1.4 versions of the java and appletviewer commands are in your p

These instructions assume that the 1.4 versions of the java and appletviewer commands are in your path. If they aren t, then you should either specify the complete path to the commands or update your PATH environment variable as described in the installation instructions for the Java 2 SDK.

https://www.eeworm.com/dl/534/159306.html

下载: 157

查看: 1093

数据结构  通过精心挑选划分元素v

通过精心挑选划分元素v，可以得到一个最坏情况时间复杂度为O(n)的选择算法。本次实习要求用c语言将此算法实现。要求实现此功能：输入一组数，返回A[i],使其为A(m:p)中第k小的元素，k是一个全局变量，取大于1的整数

https://www.eeworm.com/dl/654/159456.html

下载: 147

查看: 1021

搜索结果