Reader-writer-problem

WirelessUSB HID device reader library

WirelessUSB HID device reader library

标签： WirelessUSB library device reader

上传时间： 2015-08-07

上传用户：GavinNeko
Aprior algorithm coded by the writer of aprior algorithm

Aprior algorithm coded by the writer of aprior algorithm

标签： algorithm Aprior aprior writer

上传时间： 2014-01-07

上传用户：253189838
/* * EULER S ALGORITHM 5.1 * * TO APPROXIMATE THE SOLUTION OF THE INITIAL VALUE PROBLEM: * Y = F

/* * EULER S ALGORITHM 5.1 * * TO APPROXIMATE THE SOLUTION OF THE INITIAL VALUE PROBLEM: * Y = F(T,Y), A<=T<=B, Y(A) = ALPHA, * AT N+1 EQUALLY SPACED POINTS IN THE INTERVAL [A,B]. * * INPUT: ENDPOINTS A,B INITIAL CONDITION ALPHA INTEGER N. * * OUTPUT: APPROXIMATION W TO Y AT THE (N+1) VALUES OF T. */

标签： APPROXIMATE ALGORITHM THE SOLUTION

上传时间： 2015-08-20

上传用户：zhangliming420
producer-consumer problem 的源码

producer-consumer problem 的源码

标签： producer-consumer problem 源码

上传时间： 2015-08-21

上传用户：llandlu
吃苹果eating apple problem问题代码

吃苹果eating apple problem问题代码

标签： problem eating apple 苹果

上传时间： 2015-08-21

上传用户：天涯
A free MS Word reader for Linux and RISC OS. Antiword converts the files from Word 2, 6, 7, 97, 2000

A free MS Word reader for Linux and RISC OS. Antiword converts the files from Word 2, 6, 7, 97, 2000 and 2002 to text and postscript. There are ports to BeOS, OS/2, MacOS X, VMS, DOS and others

标签： Word Antiword converts reader

上传时间： 2015-08-22

上传用户：离殇
ACM试题An Easy Problem Description As we known, data stored in the computers is in binary form. The

ACM试题An Easy Problem Description As we known, data stored in the computers is in binary form. The problem we discuss now is about the positive integers and its binary form. Given a positive integer I, you task is to find out an integer J, which is the minimum integer greater than I, and the number of 1 s in whose binary form is the same as that in the binary form of I. For example, if "78" is given, we can write out its binary form, "1001110". This binary form has 4 1 s. The minimum integer, which is greater than "1001110" and also contains 4 1 s, is "1010011", i.e. "83", so you should output "83".

标签： Description computers Problem binary

上传时间： 2013-12-11

上传用户：libenshu01
ACM试题Problem K:Ones Description Given any integer 0 <= n <= 10000 not divisible by 2 or 5,

ACM试题Problem K:Ones Description Given any integer 0 <= n <= 10000 not divisible by 2 or 5, some multiple of n is a number which in decimal notation is a sequence of 1 s. How many digits are in the smallest such a multiple of n?

标签： Description divisible Problem integer

上传时间： 2015-08-23

上传用户：zhenyushaw
This a parallel genetic algorithm for a biinfomatics problem CSP

This a parallel genetic algorithm for a biinfomatics problem CSP

标签： biinfomatics algorithm parallel genetic

上传时间： 2015-08-26

上传用户：x4587
Lamb problem: The analytical solution of vertical point source. This is very important for synthetic

Lamb problem: The analytical solution of vertical point source. This is very important for synthetic modeling

标签： analytical important synthetic solution

上传时间： 2013-12-25

上传用户：hongmo