<strike id="6ksge"></strike>
Huffman 壓縮/解壓算法的ANSI C實現(xiàn) This archive contains a simple and readable ANSI C implementation of Huffman coding and decoding. This implementation is not intended to be the best, fastest, smallest, or any other performance related adjective. More information on Huffman encoding may be found at: http://michael.dipperstein.com/huffman http://datacompression.info/Huffman.shtml
標(biāo)簽： ANSI implementation contains readable
上傳時間： 2014-01-05
上傳用戶：thesk123
Input The input contains blocks of 2 lines. The first line contains the number of sticks parts after cutting, there are at most 64 sticks. The second line contains the lengths of those parts separated by the space. The last line of the file contains zero. Output The output should contains the smallest possible length of original sticks, one per line. Sample Input 9 5 2 1 5 2 1 5 2 1 4 1 2 3 4 0 Sample Output 6 5
標(biāo)簽： contains The blocks number
上傳時間： 2015-10-27
上傳用戶：lepoke
生成指定點數(shù)的隨機點，并用兩種不同的算法求出這些點的最小包圍圓（smallest Enclosing Circle），并比較結(jié)果
上傳時間： 2015-12-12
上傳用戶：tonyshao
1) Write a function reverse(A) which takes a matrix A of arbitrary dimensions as input and returns a matrix B consisting of the columns of A in reverse order. Thus for example, if A = 1 2 3 then B = 3 2 1 4 5 6 6 5 4 7 8 9 9 8 7 Write a main program to call reverse(A) for the matrix A = magic(5). Print to the screen both A and reverse(A). 2) Write a program which accepts an input k from the keyboard, and which prints out the smallest fibonacci number that is at least as large as k. The program should also print out its position in the fibonacci sequence. Here is a sample of input and output: Enter k>0: 100 144 is the smallest fibonacci number greater than or equal to 100. It is the 12th fibonacci number.
標(biāo)簽： dimensions arbitrary function reverse
上傳時間： 2016-04-16
上傳用戶：waitingfy
Huo Chess by Spiros (Spyridon) Kakos (http://www.kakos.com.gr) is a micro chess program in CLI C++ v8.0 that attempts to be smaller in size than the Commodore-era Microchess. The goal is to create the smallest chess program that exists. More versions are to come in the future.
標(biāo)簽： Spyridon program Spiros Chess
上傳時間： 2016-05-05
上傳用戶：hfmm633
The main features of the considered identification problem are that there is no an a priori separation of the variables into inputs and outputs and the approximation criterion, called misfit, does not depend on the model representation. The misfit is defined as the minimum of the l2-norm between the given time series and a time series that is consistent with the approximate model. The misfit is equal to zero if and only if the model is exact and the smaller the misfit is (by definition) the more accurate the model is. The considered model class consists of all linear time-invariant systems of bounded complexity and the complexity is specified by the number of inputs and the smallest number of lags in a difference equation representation. We present a Matlab function for approximate identification based on misfit minimization. Although the problem formulation is representation independent, we use input/state/output representations of the system in order
標(biāo)簽： identification considered features separati
上傳時間： 2016-09-20
上傳用戶：FreeSky
Whenever there is an application to write, breaking it up to small pieces is a great idea. The smallest piece of any application would probably be a data object, or a simple Bean in Java. Java Beans are simple Java classes that have a distinctive look and behavior. Their simplest purpose is to contain data and they accomplish this by having properties. Each property is actually a data-member containing/referencing the actual data and a couple of methods, a getter method and a setter method. Thus, the simplest data-bean describing a person could be expressed as such:
標(biāo)簽： small application Whenever breaking
上傳時間： 2016-11-07
上傳用戶：lingzhichao
Perl and XML XML is a text-based markup language that has taken the programming world by storm. More powerful than HTML yet less demanding than SGML, XML has proven itself to be flexible and resilient. XML is the perfect tool for formatting documents with even the smallest bit of complexity, from Web pages to legal contracts to books. However, XML has also proven itself to be indispensable for organizing and conveying other sorts of data as well, thus its central role in web services like SOAP and XML-RPC. As the Perl programming language was tailor-
標(biāo)簽： programming text-based XML language
上傳時間： 2014-01-07
上傳用戶：jichenxi0730
Quartz is a full-featured, open source job scheduling system that can be integrated with, or used along side virtually any J2EE or J2SE application - from the smallest stand-alone application to the largest e-commerce system. Quartz can be used to create simple or complex schedules for executing tens, hundreds, or even tens-of-thousands of jobs jobs whose tasks are defined as standard Java components or EJBs. The Quartz Scheduler includes many enterprise-class features, such as JTA transactions and clustering.
標(biāo)簽： full-featured integrated scheduling Quartz
上傳時間： 2014-01-07
上傳用戶：龍飛艇
LPC2148參考程序，是一個ARM214系連的最小系統(tǒng)原理圖,希望能多愛好嵌入是開發(fā)的人員有幫助-ARM214 is a system even the smallest system diagram is the hope of many enthusiasts are embedded in the development of the staff to help
上傳時間： 2017-04-28
上傳用戶：xc216
蟲蟲下載站版權(quán)所有 京ICP備2021023401號-1
