搜索：two - 虫虫下载站

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

Linux/Unix编程  FIST可堆叠文件系统

FIST可堆叠文件系统，linux文件系统修改相关的开源软件，使得对linux文件系统功能的改进很简单了 The FiST (File System Translator) system combines two methods to solve the above problems in a novel way: a set of stackable file system templates for each operating system, and a high-level language that can ...

https://www.eeworm.com/dl/619/251187.html

下载: 135

查看: 1173

驱动编程  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

其他  Solving Engineering Problems Using MATLAB C++ Math Library Introduction In the previous article, we

Solving Engineering Problems Using MATLAB C++ Math Library Introduction In the previous article, we studied how can use MATLAB C API to solve engineering problems. In this article I will show you how can use MATLAB C++ math library. The MATLAB&reg C++ Math Library serves two separate constituencies: ...

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

下载: 38

查看: 1066

游戏  Ink Blotting One method for escaping from a maze is via ‘ink-blotting’. In this method your startin

Ink Blotting One method for escaping from a maze is via ‘ink-blotting’. In this method your starting square is marked with the number ‘1’. All free, valid squares north, south, east and west around the number ‘1‘ are marked with a number ‘2’. In the next step, all free, valid squares around ...

https://www.eeworm.com/dl/625/254453.html

下载: 164

查看: 1070

数据结构  This code implements min binomial heaps and min leftist trees.Plus, measure and compare the relative

This code implements min binomial heaps and min leftist trees.Plus, measure and compare the relative performance of these two implementations under the assumption that the only permissible operations are insert and delete-min.

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

下载: 66

查看: 1039

数学计算  Using Jacobi method and Gauss-Seidel iterative methods to solve the following system The require

Using Jacobi method and Gauss-Seidel iterative methods to solve the following system The required precision is &#61541 &#61472 =0.00001, and the maximum iteration number N=25. Compare the number of iterations and the convergence of these two methods

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

下载: 169

查看: 1073

VHDL/FPGA/Verilog Synthesizable FIFO Model This example describes a synthesizable implementation of a FIFO. The FIFO

Synthesizable FIFO Model This example describes a synthesizable implementation of a FIFO. The FIFO depth and FIFO width in bits can be modified by simply changing the value of two parameters, `FWIDTH and `FDEPTH. For this example, the FIFO depth is 4 and the FIFO width is 32 bits.

https://www.eeworm.com/dl/663/258631.html

下载: 76

查看: 1040

单片机开发  this procedure is a game of basketball or subsystems time, the competition will record the entire ti

this procedure is a game of basketball or subsystems time, the competition will record the entire time, and can amend the Competition time suspended contest time, the two can be set at any time during the competition process of the match, the two teams exchanged scores midfielder position, Competiti ...

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

下载: 44

查看: 1037

通讯/手机编程  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

搜索结果

按分类筛选