搜索资源列表
21jop
- 21点游戏实现一个21点游戏，本系统主要提供人机对玩21点牌游戏，实现系统自动判断输赢-To achieve a 21:00 game 9:00 p.m. game, the system is mainly to provide human-machine license to play 21 games, the system automatically determine the winning or losing
JMS
- JMS中点对点传输模式的详细代码以及讲解-point to point
AJAX
- jsf学习非常重要,自己学着点对以后的工作有很大的帮助的！-jsf stardom good it is good do you have it? hello world,you would have it
ClosetPair
- 实现求解平面最近点对的复杂度为nlgn的算法。程序要求能够自动生成至少100万个点，并利用该算法求解。此外，要求支持图形界面的算法输入与输出。在此基础上，添加n^2级算法的实现，并比较相同规模下，两种算法的时间消耗。-Solving the nearest point on the plane to achieve the complexity of the algorithm for nlgn. Program requires the ability to automatically gen
closestpoints
- 最短距离点对算法分治法实现 以及暴力算法的对比-Closest Distance Point Pairs Divide and Conque Algorithm
P42009102910133.src
- 一个简单的对对碰小游戏，利用J2ME技术 希望各位大大看过后给点意见-DUIDUIPENG
JMS3
- 封装了JMS的API 有点对点 和 发布订阅的接口-JMS-API encapsulates a point to point and publish subscribe interface
src
- 1)点对点数据交换（P2P）：实现基于服务器转发的任意多点间的数据共享与交换。-1) Point to Point Data Exchange (P2P): Implementation on the server forwards any more data sharing and exchange between.
TT
- 很简单的p2p聊天程序 使用socket编写 没有使用图形界面 只有点对点 聊天功能-Very simple p2p chat program written using the socket does not use graphical interface that only point to point chat
MinDistance_PointPair
- 用java实现的平面上最近点对的查找，包括蛮力法和分治法的实现。-Java implementation of the plane with the nearest point on the search, including the brute force method and the divide and conquer implementation.
java
- 小的数字游戏 有得分 开始 结束 数字是随机出现的 根据出现的数字在键盘上点击 点对了就加分 点错了就减分-Small figure scoring games beginning of the end figures are the basis of random number that appears on the keyboard click on the plus points of a point by point to the wrong
Pair
- 完成一维，二维，的最接近点对问题，还有界面-Complete the one-dimensional, two-dimensional, the closest point on the issue, as well as the interface
Algorithm-design-code
- 一次大型的party最后节目是选取一位幸运人士；完成一维的最接近点对问题 第k小的元素-A large party last program is to select a lucky person complete the one-dimensional closest point problems small element of the k
NearestPoint
- 算法分析与设计经典问题，用分治法求最近点对，并与蛮力法做对比-Classical algorithm analysis and design problems with the divide and conquer method for the last point, and compared with the brute force method to do
Kruskal
- 用kruskal算法找最接近点对并分组。如我给出的测试数据，给定2000个多点，将最接近的点放在一个组里，最后分成九个组。程序可直接运行。-Algorithm used to find the closest point kruskal and groups. If I give the test data given over 2000 points, the closest point in a group, and finally divided into nine groups. Pro
PointTest
- 个人原创代码：编写Java Application程序，构造一个类来描述屏幕上的一个点，该类的构成包括点的x和y两个坐标，以及一些对点进行的操作，包括：取得点的坐标值，对点的坐标进行赋值，编写应用程序生成该类的对象并对其进行操作。-Personal original code: java application program, to construct a class to describe a point on the screen, the composition of the class
java-fifty--code
- java 的基础知识 包含了java的几乎所有的支持点 对初学者非常有用-basic knowledge of key points in java
TransPro
- 模拟实现计算机网络五层传输协议，实现点对点数据交换。重庆大学计算机学院-The simulation of computer networks, five transport protocol to achieve peer-to-peer data exchange. Chongqing University of Computer Science
theClosestPoint
- 寻找平面中最接近的点对，利用算法使时间复杂度接近于O（nlogn）-Find the the plane closest point pair algorithm time complexity close to O (nlogn)
ChatSocketExample
- 聊天系统，实现客户端点对点的聊天，希望对你有作用呀-Chat system, and peer-to-peer chat client, hope you have a role!