Description: 求解矩阵链相乘的问题，通过动态规划的方法，来求解该问题，使得矩阵链的相乘的运算最少。-chain matrix multiplication to solve the problem through dynamic programming methods to solve the problem, making the chain matrix multiplication operator at least. Platform: |
Size: 1024 |
Author:韩希先 |
Hits:
Description: Java语言是一个简单的、面向对象的、分布的、解释（执行）的、健壮的、安全的、独立于平台的、可移植的、可扩展的、高性能的、多线程的以及动态的程序设计语言。Java是由C++发展而来的，它是一种彻底的纯面向对象的程序设计语言。面向对象的语言四大特点：1.封装 2.继承 3.多态 4.动态。面向对象技术较好地适应了当今软件开发过程中新出现的种种传统面向过程语言所不能处理的问题。面向对象技术的核心是以更接近于人类思维的方式建立计算机逻辑模型，它利用类和对象的机制将数据与其上的操作封装在一起，并通过统一的接口与外界交互，使反映现实世界实体的各个类在程序中能够独立、自治、继承；这种方法非常有利于提高程序的可维护性和可重用性，使得面向过程语言难于操纵的大规模软件可以很方便的创建、使用和维护。为了与C语言兼容，其中还包含了一些面向过程的成分；Java去除了C++中非面向过程的部分，其程序编写过程就是设计、实现类，定义其属性、行为的过程。所以我们要学好java，但是一学期学到的东西毕竟有限，要学好还要花大量的时间和精力，不是一下子就可以学好的。下面就对我作的小程序进行分析-Java is a simple, object-oriented, distributed, the interpretation of (Executive), robust, secure, platform-independent, portable, scalable, high-performance, multi-threading and dynamic programming language. Java was developed from the C, it is a completely pure object-oriented programming language. Object-oriented languages four major characteristics : 1. Packaging 2. Inheritance 3. Four more states. Dynamic. Object-oriented technology to better adapt to today's software development process for the various new traditional process-oriented languages are not addressed. Object-oriented technology is the core closer to human thinking, the logical way to build a computer model, which uses categories and target the mechanism of data on the operation of its package together, and through a u Platform: |
Size: 9216 |
Author:张书 |
Hits:
Description: Java语言是Internet上最热门的编程语言，本文针对
Java的网络功能，对Java从网络上获取图象、声音、
HTML文档及文本文件等编程方法作了初步的介绍，同
时介绍了动态获取网络上资源的方法作了介绍。文中
提供了大量简明易懂的实例。
-Java language on the Internet is the most popular programming language, Java is a network function, right from the Java network access images, audio, HTML files and text documents programming methods preliminary, introduction to a dynamic access to network resources on the method was introduced. The text provided a lot of examples easily understandable. Platform: |
Size: 798720 |
Author: |
Hits:
Description: 用动态规划算法编写的有关旅行商问题的java程序-dynamic programming algorithm used in the preparation of the Traveling Salesman Problem java programs Platform: |
Size: 2048 |
Author: |
Hits:
Description: Ivor Horton s Beginning Java 2, JDK 5 Edition (Java 2入门经典：JDK 5)英文原版
本书综合介绍了使用J2SE(Java 2 Standard Edition)5．0或更高版本开发动态程序的过程，阐述了Java语言的各个方面，包括Java语言结构和工作原理的基本知识，用大量的实例讲述如何开发功能齐全的Java应用程序，以期帮助读者掌握Java语言的最新特性和Java类库中主要的功能包，积累Java应用环境的使用经验，并在核心技术领域打下坚实的基础。.
本书系统全面、浅显易懂，非常适合没有任何编程经验的初学者阅读，也可作为软件开发人员和高校师生的必备参考书。
通过阅读本书，你可以借助J2SE 5．0这个最新、最出色的Java平台来学习Java编程。J2SE 5．0拥有强大的新特性和新功能，使Java性能产生了巨大的飞跃。
-Ivor Horton's Beginning Java 2. JDK 5 Edition (Java 2 portal classic : JDK 5) The English version of the original book on the integrated use of J2SE (Java 2 Standard Edit Ion) version 5.0 or higher dynamic program development process, expounded the Java language in all its aspects, including the Java language's structure and working principle of the basic knowledge, with plenty of examples on how to develop fully functional Java applications, to help readers master the latest Java language features and Java class library major functional package, Java application environment accumulation of experience and core technology in the field to lay a solid foundation. . The book system of comprehensive, simple words, not very suitable for any programming experience beginners reading, can a Platform: |
Size: 5924864 |
Author:haibing |
Hits:
Description: Core Java 2 Volume I - Fundamentals, Seventh Edition
Completely revised and up-to-date coverage of
Generic programming, restrictions and limitations, type bounds, wilcard types, and generic reflection
Swing GUI development, including input validation and other enhancements
Exception handling and debugging, including chained exceptions, stack frames, assertions, and logging
Streams and files, the new I/O API, memory-mapped files, file locking, and character set encoders/decoders
Regular expressions using the powerful java.util.regex package
Inner classes, reflection, and dynamic proxies
Application packaging and the Preferences API-Core Java 2 Volume I- Fundamentals, Seventh Edition
Completely revised and up-to-date coverage of
Generic programming, restrictions and limitations, type bounds, wilcard types, and generic reflection
Swing GUI development, including input validation and other enhancements
Exception handling and debugging, including chained exceptions, stack frames, assertions, and logging
Streams and files, the new I/O API, memory-mapped files, file locking, and character set encoders/decoders
Regular expressions using the powerful java.util.regex package
Inner classes, reflection, and dynamic proxies
Application packaging and the Preferences API Platform: |
Size: 6638592 |
Author:tengteng |
Hits:
Description: A framework written in Java for implementing high-level and dynamic languages, compiling them into Java bytecodes.
An implementation of Scheme, which is in the Lisp family of programming languages. Kawa is a featureful dialect in its own right, and additionally provides very useful integration with Java. It can be used as a “scripting language”, but includes a compiler and all the benefits of a “real” programming language, including optional static typing.-A framework written in Java for implementing high-level and dynamic languages, compiling them into Java bytecodes.An implementation of Scheme, which is in the Lisp family of programming languages. Kawa is a featureful dialect in its own right, and additionally provides very useful integration with Java. It can be used as a Platform: |
Size: 1939456 |
Author:guid |
Hits:
Description: java反射作为java中很重要的机制，它对java的动态编程有很大的作用。现推荐北大青鸟的java reflect授课讲义，供大家学习，内含试验源码-java in java reflection as very important mechanisms, its java dynamic programming has a significant role. Beida Jade Bird is now recommended by the java reflect the medium of instruction handouts for everyone to learn, including the pilot source Platform: |
Size: 16384 |
Author:肖颖 |
Hits:
Description: <算法导论>第二版大部分算法实现.
1. 各类排序和顺序统计学相关
2. 数据结构
2.1 基本数据结构
2.2 散列表
2.3 二叉查找树
2.4 红黑树
2.5 数据结构基于红黑树的扩张
3. 高级涉及和分析技术
3.1 动态规划相关
3.2 贪心算法相关
3.3 用于不相交集合的数据结构
4. 部分图算法.-<Introduction to Algorithms> Algorithms realize most of the second edition of .1. All kinds of sorting and order statistics related to 2. Data Structure 2.1 Basic Data Structure 2.2 Hash Table 2.3 Binary search Tree 2.5 Tree 2.4 red and black red and black tree-based data structure the expansion of 3. High and analytical techniques involving dynamic programming related 3.1 Greedy Algorithm 3.2 for the relevant 3.3 Disjoint Set Data Structure 4. part of Fig algorithm. Platform: |
Size: 324608 |
Author:QJGui |
Hits:
Description: PKU中一些数据结构基本算法题的java实现，包括DIJ、PRIM、二叉查找树、并查集、动态规划、KMP、匈牙利算法、深搜广搜等-PKU some basic data structure algorithm java realization of the title, including DIJ, PRIM, binary search tree, and search sets, dynamic programming, KMP, the Hungarian algorithm, collected, such as deep-search Platform: |
Size: 77824 |
Author:俞昊旻 |
Hits:
Description: 两台处理机A 和B处理n个作业。设第i个作业交给机器
A 处理时需要时间ai，若由机器B 来处理，则需要时间bi。由于各作
业的特点和机器的性能关系，很可能对于某些i，有ai >=bi，而对于
某些j，j!=i，有aj<bj。既不能将一个作业分开由两台机器处理，也没
有一台机器能同时处理2 个作业。设计一个动态规划算法，使得这两
台机器处理完成这n 个作业的时间最短（从任何一台机器开工到最后
一台机器停工的总时间）。研究一个实例：（a1,a2,a3,a4,a5,a6）=
（2,5,7,10,5,2）；（b1,b2,b3,b4,b5,b6）=（3,8,4,11,3,4）-Two processors A and B deal with n-operation. I set up the first operating the machine A treatment takes time ai, if by machine B to deal with, it takes time bi. Since the operating characteristics and performance of the machine relationship, is likely to for some i, there is ai> = bi, and for some j, j! = I, there is aj <bj. Neither can an operation separate from the two machines to deal with, nor a machine capable of simultaneously handling two operations. Design a dynamic programming algorithm, making the two machines to deal with the completion of this n the shortest operating time (from any one machine starts to the last machine downtime total time). Study an example of: (a1, a2, a3, a4, a5, a6) = (2,5,7,10,5,2) (b1, b2, b3, b4, b5, b6) = (3,8 , 4,11,3,4) Platform: |
Size: 14336 |
Author:王颖 |
Hits:
Description: 《算法设计与分析》王晓东编著，第三章动态规划，课本例子代码实现- Algorithm Design and Analysis edited by Wang Xiaodong, Chapter III of dynamic programming, textbook example of code to achieve Platform: |
Size: 22528 |
Author:benson |
Hits:
Description: /多边形游戏动态规划解法，缘自王晓东算法设计，该程序已调通-/ Polygon game dynamic programming method, edge since Xiaodong algorithm design, the program has been transferred Qualcomm Platform: |
Size: 1024 |
Author:ss |
Hits:
Description: //0-1背包问题动态规划解法，原自王晓东算法设计，该程序已调通-//0-1 knapsack problem dynamic programming method, the original algorithm since Xiaodong design, the program has been transferred Qualcomm Platform: |
Size: 1024 |
Author:ss |
Hits:
Description: 用动态规划算法，JAVA实现：给定n个整数组成的序列，现在要求将序列分割为m段，每段子序列中的数在原序列中连续排序。如何分割才能使这m段子序列的和的最大值达到最小？-Using dynamic programming algorithm, JAVA implementation: the composition of a given sequence of n integers, now requires the sequence is divided into m segments, the number of subsequences in consecutive order in the original sequence. How to split to make the m subsequences and the maximum to the minimum? Platform: |
Size: 1024 |
Author:洋小子 |
Hits:
Search - java dynamic programming