Java, Java Object-Oriented Problem Solving, Third Edition
標(biāo)簽： Java Object-Oriented Edition Problem
上傳時間： 2016-11-05
上傳用戶：努力努力再努力
library which evaluates the lower tail of the noncentral Student s T distribution this is Applied Statistics Algorithm 5
標(biāo)簽： distribution noncentral evaluates the
上傳時間： 2016-11-16
上傳用戶：xc216
％For the following 2-class problem determine the decision boundaries ％obtained by LMS and perceptron learning laws.
標(biāo)簽： boundaries the following determine
上傳時間： 2016-11-26
上傳用戶：guanliya
A test problem generator for non-stationary environments,Branke J的MovingPeak問題
標(biāo)簽： non-stationary environments MovingPeak generator
上傳時間： 2014-12-20
上傳用戶：秦莞爾w
Imperfect C++ Practical Solutions for Real-Life Programming C++, although a marvelous language, isn t perfect. Matthew Wilson has been working with it for over a decade, and during that time he has found inherent limitations that require skillful workarounds. In this book, he doesn t just tell you what s wrong with C++, but offers practical techniques and tools for writing code that s more robust, flexible, efficient, and maintainable. He shows you how to tame C++ s complexity, cut through its vast array of paradigms, take back control over your code--and get far better results.
標(biāo)簽： Programming Imperfect Practical Solutions
上傳時間： 2014-03-02
上傳用戶：songrui
Problem A:放蘋果 Time Limit:1000MS Memory Limit:65536K Total Submit:1094 Accepted:441 Language: not limited Description 把M個同樣的蘋果放在N個同樣的盤子里，允許有的盤子空著不放，問共有多少種不同的分法？（用K表示）5，1，1和1，5，1 是同一種分法。 Input 第一行是測試數(shù)據(jù)的數(shù)目t（0 <= t <= 20）。以下每行均包含二個整數(shù)M和N，以空格分開。1<=M，N<=10。 Output 對輸入的每組數(shù)據(jù)M和N，用一行輸出相應(yīng)的K。 Sample Input 1 7 3 Sample Output 8
標(biāo)簽： Limit Accepted Language Problem
上傳時間： 2016-11-30
上傳用戶：leixinzhuo
student teacher and proferssor llove this project,this a very important exmple
標(biāo)簽： this proferssor important student
上傳時間： 2016-12-07
上傳用戶：從此走出陰霾
Design patterns are elegant, adaptable, and reusable solutions to everyday software development problems. Programmers use design patterns to organize objects in programs, making them easier to write and modify. C# Design Patterns: A Tutorial is a practical guide to writing C# programs using the most common patterns. This tutorial begins with clear and concise introductions to C#, object-oriented programming and inheritance, and UML diagrams. Each chapter that follows describes one of twenty-three design patterns, recommends when to use it, and explains the impact that it will have on the larger design. The use of every pattern is demonstrated with simple example programs. These programs are illustrated with screen shots and UML diagrams displaying how the classes interact. Each of these programs is available on the companion CD-ROM and can be run, examined, edited, and applied.
標(biāo)簽： development adaptable solutions patterns
上傳時間： 2014-09-07
上傳用戶：wangchong
Problem B:Longest Ordered Subsequence A numeric sequence of ai is ordered if a1 < a2 < ... < aN. Let the subsequence of the given numeric sequence (a1, a2, ..., aN) be any sequence (ai1, ai2, ..., aiK), where 1 <= i1 < i2 < ... < iK <= N. For example, sequence (1, 7, 3, 5, 9, 4, 8) has ordered subsequences, e. g., (1, 7), (3, 4, 8) and many others. All longest ordered subsequences are of length 4, e. g., (1, 3, 5, 8).
標(biāo)簽： Subsequence sequence Problem Longest
上傳時間： 2016-12-08
上傳用戶：busterman
sovling TSP(Travelling Salesman Problem) with GAs
標(biāo)簽： Travelling Salesman sovling Problem
上傳時間： 2014-01-10
上傳用戶：youmo81
蟲蟲下載站版權(quán)所有 京ICP備2021023401號-1
<bdo id="o8ow8"></bdo>
