搜索：SUM - 虫虫下载站

数据结构  merge sort give a set S of n integers and another integer x, determine whether or not there exits tw

merge sort give a set S of n integers and another integer x, determine whether or not there exits two elements in S whose sum is exactly x.

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

下载: 159

查看: 1071

软件设计/软件工程  附录MATLAB 图像处理命令 1．applylut 功能：在二进制图像中利用lookup 表进行边沿操作。语法： A = applylut(BW,lut) 举例 lut = mak

附录MATLAB 图像处理命令 1．applylut 功能：在二进制图像中利用lookup 表进行边沿操作。语法： A = applylut(BW,lut) 举例 lut = makelut( sum(x(:)) == 4 ,2) BW1 = imread( text.tif ) BW2 = applylut(BW1,lut) imshow(BW1) figure, imshow(BW2) 相关命令： makelut 2．bestblk 功举例 ...

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

下载: 48

查看: 1239

数值算法/人工智能  Distribution generator Here is a simple generator which can build some distributions with given pro

Distribution generator Here is a simple generator which can build some distributions with given properties. Distributions generator (compile with -lm) Typical use might be: ./distributions -u -m 1 -M 10 -n 100 -s 500 Generates a distribution of 100 uniform random numbers between 1 and 10, such that ...

https://www.eeworm.com/dl/518/204069.html

下载: 150

查看: 1038

其他  Implement the step 2 of two-level logic minimization. Our goal is to find the minimum (exact minim

Implement the step 2 of two-level logic minimization. Our goal is to find the minimum (exact minimum) sum-of-products expression for a given function.

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

下载: 30

查看: 1032

Java编程  We have a group of N items (represented by integers from 1 to N), and we know that there is some tot

We have a group of N items (represented by integers from 1 to N), and we know that there is some total order defined for these items. You may assume that no two elements will be equal (for all a, b: a<b or b<a). However, it is expensive to compare two items. Your task is to make a number of comparis ...

https://www.eeworm.com/dl/633/247529.html

下载: 64

查看: 1048

Java书籍  To date tests are still the best solution mankind has found to deliver working software. This book

To date tests are still the best solution mankind has found to deliver working software. This book is the sum of four years of research and practice in the testing field. The practice comes from my IT consulting background, first at Octo Technology and then at Pivolis the research comes from my invo ...

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

下载: 104

查看: 1049

软件设计/软件工程  本文档提供JSR120无线消息API规范的说明

本文档提供JSR120无线消息API规范的说明，也描述Sum的RI的API.

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

下载: 56

查看: 1025

matlab例程  Waterfilling algorithm (from [Palomar and Fonollosa, Trans-SP2004]) to compute: pi = (mu*ai - bi

Waterfilling algorithm (from [Palomar and Fonollosa, Trans-SP2004]) to compute: pi = (mu*ai - bi)^+ sum(pi) = Pt By Daniel Perez Palomar (last revision: May 10, 2004).

https://www.eeworm.com/dl/665/283896.html

下载: 139

查看: 1114

数值算法/人工智能  北京大学ACM比赛题目 In 1742, Christian Goldbach, a German amateur mathematician, sent a letter to Leonhard

北京大学ACM比赛题目 In 1742, Christian Goldbach, a German amateur mathematician, sent a letter to Leonhard Euler in which he made the following conjecture: Every even number greater than 4 can be written as the sum of two odd prime numbers. For example: 8 = 3 + 5. Both 3 and 5 are odd prime n ...

https://www.eeworm.com/dl/518/286895.html

下载: 102

查看: 1692

汇编语言  设计一个程序完成求1－100的累加和

设计一个程序完成求1－100的累加和，结果送到SUM单元中

https://www.eeworm.com/dl/644/287271.html

下载: 81

查看: 1103

搜索结果

按分类筛选