Java, Java Object-Oriented Problem Solving, Third Edition
标签： 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
标签： 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.
标签： boundaries the following determine
上传时间： 2016-11-26
上传用户：guanliya
A test problem generator for non-stationary environments,Branke J的MovingPeak问题
标签： 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.
标签： 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 第一行是测试数据的数目t（0 <= t <= 20）。以下每行均包含二个整数M和N，以空格分开。1<=M，N<=10。 Output 对输入的每组数据M和N，用一行输出相应的K。 Sample Input 1 7 3 Sample Output 8
标签： Limit Accepted Language Problem
上传时间： 2016-11-30
上传用户：leixinzhuo
student teacher and proferssor llove this project,this a very important exmple
标签： 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.
标签： 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).
标签： Subsequence sequence Problem Longest
上传时间： 2016-12-08
上传用户：busterman
sovling TSP(Travelling Salesman Problem) with GAs
标签： Travelling Salesman sovling Problem
上传时间： 2014-01-10
上传用户：youmo81
