B/S asp.net的C#编的网站，比赛报名受理，管理报名人员，消息发布，Email通知等功能
上传时间： 2013-12-30
上传用户：ikemada
java,关于tcp协议的网络连接.[采用c/s模式]
上传时间： 2013-12-23
上传用户：小鹏
课程设计:利用Socket编程制作一个简单的C/S应用 编写Applet程序实现字体的放大和缩小 同学录.详细报告。
上传时间： 2013-12-16
上传用户：refent
KBASIC is a BASIC like interpreter. It s implemented in C. The file includes the source code, executable and various .bas files as examples. To try write basic.exe and the name of one of the .bas files and KBASIC will interpret the file.
标签： C. interpreter implemented includes
上传时间： 2017-03-25
上传用户：xzt
This document is tutorial of ermapper in R/S software
标签： document ermapper tutorial software
上传时间： 2017-04-01
上传用户：chfanjiang
Although some FX1-based devices may use the FX1鈥檚 CPU to process USB data directly (Port I/O Mode), most applica- tions use the FX1 simply as a conduit between the USB and external data-processing logic (e.g., an ASIC or DSP, or the IDE controller on a hard disk drive).
标签： Although directly devices process
上传时间： 2014-01-08
上传用户：2467478207
利用c++编写的带人工智能的跳棋程序。屏幕的中央是棋盘，所有的操作都是对这个棋盘进行的，棋子的选择框是红色的，移动它（“w”、“s”、“a”、“d”分别代表上、下、左、右）进行选子和选择目的地，利用空格键可以表示选定选择框到达的位置，棋盘左边有提示信息，提示由哪个玩家走棋。“Q”表示退出游戏，“R”表示重新开始，“H”表示悔棋（一次只能悔一步棋）
上传时间： 2017-04-03
上传用户：chenlong
java实现基于UDP的C/S架构的服务器客户端程序
上传时间： 2014-02-05
上传用户：nanshan
用面向对象语言Java写的局域网中C/S架构的聊天器
上传时间： 2017-04-08
上传用户：宋桃子
c pgm to find redundant paths in a graph.Many fault-tolerant network algorithms rely on an underlying assumption that there are possibly distinct network paths between a source-destination pair. Given a directed graph as input, write a program that uses depth-first search to determine all such paths. Note that, these paths are not vertex-disjoint i.e., the vertices may repeat but they are all edge-disjoint i.e., no two paths have the same edges. The input is the adjacency matrix of a directed acyclic graph and a pair(s) of source and destination vertices and the output should be the number of such disjoint paths and the paths themselves on separate lines. In case of multiple paths the output should be in order of paths with minimum vertices first. In case of tie the vertex number should be taken in consideration for ordering.
标签： fault-tolerant algorithms redundant underlyin
上传时间： 2013-12-18
上传用户：jkhjkh1982
