搜索资源列表
P2P
- P2P（Peer-to-Peer 端到端）模型是与C/S（客户/服务器）模型相对应。基于C/S的用户间通信需要由服务器中转，在C/S中的服务器故障将导致整个网络通信的瘫痪。。而基于P2P的用户间通信则是直接通信，去掉了服务器这一层，带来的显著优点是通信时没有单一的失败点，一个用户的故障不会影响整个P2P网络。本文提供了一种用JAVA实现P2P网络通信的方法。-P2P (Peer-to-Peer end-to-end) model with the C/S (Client/Server) mode
dijkstra-java
- Dijkstra算法是典型的最短路算法，用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止。 Dijkstra算法能得出最短路径的最优解，但由于它遍历计算的节点很多，所以效率低。Dijkstra算法是一种逐步搜索算法，通过为每个顶点n保留目前为止所找到的从m到n的最短路径来工作的。 -Dijkstra algorithm is a typical example of the most short-circuit algorithm, used
Planer_convex_hull
- A Convex Hull is the smallest convex polygon that contains every point of the set S. A polygon P is convex if and only if, for any two points A and B inside the polygon, the line segment AB is inside P. One way to visualize a convex hull is to put
fourier
- FFTGUI Demonstration of Finite Fourier Transform. FFTGUI(y) plots real(y), imag(y), real(fft(y)) and imag(fft(y)). FFTGUI, without any arguments, uses y = zeros(1,32). When any point is moved with the mouse, the other plots respond.
code
- （1）求一个6*6阶矩阵对角线元素之和。（2）实现打印数出有10个元素的浮点数组a中的最大值和最小值。（3）求面积。（4）产生两个小按钮。（5）程序的作用是用Math.random() 函数产生20个随机数。-(1) for a 6* 6 bands and the matrix of diagonal elements. (2) to achieve print a few out there are 10 elements in a floating-point group of maxim
jisuanjizuchnegyuanli
- 能够实现定点小数的机器数表示、定点小数的变形补码加减运算、定点小数的原码一位乘法运算和浮点数的加减运算。-Able to achieve fixed-point decimal number of machines that the deformation of complement fixed-point decimal addition and subtraction operations, the original code a fixed-point decimal multiplica
Main
- AI Reinforcement Learning 走格子， 输出每1000步达到目标格子次数。reward: goal-> +1 rest -> 0.-Java implementation for an Reinforcement Learning agent to search through a Grid World from start point to goal state. reward: goal->+1 rest-> 0.
Spline
- 根据（0.0,0.0）（0.5,1.6）（1.0,2.0）（6.0,2.0）（7.0,1.5）（9.0,0.0）六个点使用三次样条差值求多项式并作图-According to (0.0,0.0) (0.5,1.6) (1.0,2.0) (6.0,2.0) (7.0,1.5) (9.0,0.0) using cubic spline six point margin and a polynomial mapping
POMDPSolver
- POMDP求解算法的实验平台，提供了多个基于点的算法，基于java实现，eclipse平台下运行。-an Java implementation arranged as an Eclipse package, of most of the point-based algorithms for solving POMDPs.
Numerical-Analysis-for-Statisticians
- Java常用数值算法集 共有数值计算中常用的Java方法近200个．内容包括：解线性代数方程组、插值、数值积分、特殊函数、函数逼近、随机数、排序、特征值问题、数据拟合、方程求根和非线性方程组求解、函数的极值和最优化、数据的统计描述、傅里叶变换谱方法、解常微分方程组、两点边值问题的解法和解偏微分方程组．-Java common set numerical algorithm the total numerical calculation commonly used Java method
PRJ_Final
- K-mean Algorithm Initialisation: set seed points Assign each object to the cluster with the nearest seed point Compute seed points as the centroids of the clusters of the current partition (the centroid is the centre, i.e., mean point, of th
ClosestPairPoint
- 最近点对算法的实现，用java编写，可以直接使用-The nearest point on the implementation of the algorithm, using java, you can directly use
DBScan03
- DBScan算法实现，用Java高级编程语言正确实现DBSCAN算法，DBScan是一种基于密度的聚类算法，它有一个核心点的概念：如果一个点，在距它e的范围内有不少于MinP个点，则该点就是核心点。核心和它e范围内的邻居形成一个簇。在一个簇内如果出现多个点都是核心点，则以这些核心点为中心的簇要合并。最终输出找到的簇及其数据点。-DBScan algorithm, using high-level programming language Java is implemented correctly