数学实验中的最速落径问题 A,B是不在一条铅垂线上的两点，在链接A,B两点的所有光滑曲线中，找出一条曲线，使得初速度为零的质点，在重力的作用下，自A点下滑到B点所需的时间最短
标签： 实验
上传时间： 2013-12-18
上传用户：bruce
用 2个链表 实现 链表 A 和链表 B相减并清楚重复内容的程序
上传时间： 2013-12-12
上传用户：Late_Li
在数据加密和数据压缩中常需要对特殊的字符串进行编码。给定的字母表A 由26 个小写英文字母组成A={a,b,…,z}。
上传时间： 2013-12-27
上传用户：恋天使569
该程序采用b/s架构，后台采用ejb，前台是jsp，开发平台是jbuilder7＋weblogic7，对j2ee的初学者有很大的启发作用
上传时间： 2014-01-20
上传用户：wfeel
三阶B-树的节点插入与删除 三阶B-树的节点插入与删除
上传时间： 2017-01-22
上传用户：zjf3110
C++ Primer, Fourth Edition By Stanley B. Lippman, Josée Lajoie, Barbara E. Moo Englisht version
上传时间： 2014-11-30
上传用户：h886166
音乐程序功能 如输入A唱第一首歌 输B唱另一首歌 输X退出程序~
上传时间： 2013-12-27
上传用户：cainaifa
The W3C DOM Core interfaces defines a minimal set of: A. interfaces for accessing and manipulating document objects B. Java object implementations for use with XML parsers. C. Conventions and processes for creating live HTML pages. D. Mutable document
标签： interfaces A. manipulating accessing
上传时间： 2017-01-24
上传用户：edisonfather
The combinatorial core of the OVSF code assignment problem that arises in UMTS is to assign some nodes of a complete binary tree of height h (the code tree) to n simultaneous connections, such that no two assigned nodes (codes) are on the same root-to-leaf path. Each connection requires a code on a specified level. The code can change over time as long as it is still on the same level. We consider the one-step code assignment problem: Given an assignment, move the minimum number of codes to serve a new request. Minn and Siu proposed the so-called DCAalgorithm to solve the problem optimally. We show that DCA does not always return an optimal solution, and that the problem is NP-hard. We give an exact nO(h)-time algorithm, and a polynomial time greedy algorithm that achieves approximation ratio Θ(h). Finally, we consider the online code assignment problem for which we derive several results
标签： combinatorial assignment problem arises
上传时间： 2014-01-19
上传用户：BIBI
A solution of contest problem in Google Code Jam
标签： solution contest problem Google
上传时间： 2014-01-24
上传用户：zhangliming420
