Location:
Search - Collection .n
Search list
Description: GEOMETRY is a collection of routines for geometric calculations in 2, 3 and N space. These calculations include angles, areas, containment, distances, intersection, nearest point, and volumes. The objects considered include points, lines, line segments, polygons, planes, polyhedra and vectors.
Platform: |
Size: 44996 |
Author: |
Hits:
Description: 迷宫地图的生成也有很多种方法，但是有些算法在生成较大维度时的计算速度很慢，尤其是如果用在电子词典之类上可能很成问题的。还有一个较大的问题就是很多算法生成的迷宫并不是真正意义上的迷宫，即路径不唯一。
用离散数学的集合观点来生成一个迷宫。
首先是M*N的一个矩阵，生成为M*N个集合，然后每次循环就合并一个集合，这样在M*N-1次合并之后就成了一个集合，也就是这M*N个元素连通了。算法首先得问题的是选择哪个元素来合并，我在这里是随机选择相邻集合。算法的关键是要记录合并的次序，否则你最后得到的只是一个M*N的集合而已。
再次由于是用集合生成的迷宫，在用程序自动生成任意两点的路径时就更为方便了-generated maps of the maze are also many ways, But some algorithm for generating larger dimension in the calculation speed is very slow, particularly if used in electronic dictionaries may like very problematic. There is a larger problem is that many of our method is not the real meaning of the maze of maze that is not the only path. Discrete Mathematics with a collection of viewpoints to generate a maze. First M * N is a matrix of Health as M * N pools, and then each cycle a pool on the merger, Thus, M * N-1 after the merger became a pool, which is M * N elements linked. Algorithm in the first issue is to choose which elements of the merger, I was here in the adjacent random selection pool. Algorithm, the key is to record the merger order, or else you get is the last one M * N pool only.
Platform: |
Size: 14193 |
Author: Xi Xie |
Hits:
Description: 质数竖式
下面的竖式是一个乘法运算问题，它的每个＊号可以代入一个数字，
这个数字属于一个特定的由N个数字组成的集合。如果这个集合是｛2，3，5，7｝，
那么这个竖式称作“质数竖式”。
此程序就是为了解决这样一个问题而做的。-few quality below the vertical shaft is a multiplication problem, it * can each generation into a number of This is a specific N-digital collection. If this set is (8-19), then the shaft known as the "prime number shaft." This procedure is to resolve such a problem so.
Platform: |
Size: 9097 |
Author: 刘华 |
Hits:
Description: libjingle is a collection of open-source C++ code and sample applications that enables you to build a peer-to-peer application. The code handles creating a network connection (through NAT and firewall devices, relay servers, and proxies), negotiating session details (codecs, formats, etc.), and exchanging data. It also provides helper tasks such as parsing XML, and handling network proxies. You could build the following programs with libjingle:
* A multi-user voice chat application
* A multi-user video conferencing application
* A multi-user live music streaming application
* A peer-to-peer file sharing application
-libjingle is a collection of open-source C code and sample applications that enables you t o build a peer-to-peer application. The code ha ndles creating a network connection (through N AT and firewall devices, relay servers. and proxies). negotiating session details (codecs, formats, etc.) , and exchanging data. It also provides helper ta Risks such as parsing XML. and handling network proxies. You could not build he following programs with libjingle : * A multi-user voice chat application * A multi - user video conferencing application * A multi - user live music streaming application * A peer - to-peer file sharing application
Platform: |
Size: 1244047 |
Author: peica |
Hits:
Description: This example application is a collection of Flash Lite do s and don ts from the
usability point of view. The application contains real examples and animations
of static examples that help you to see problematic issues in real life on a
Nokia device. The application is optimized for devices with the resolution 170 x 208
pixels used in portrait mode.
This example application is closely related to the document Flash Lite: Visual Guide,
and it is highly recommended to read the document before going through this example.-This example application is a collection o f Flash Lite do's and do ts from the usability poi nt of view. The application contains real examp les animations of static and examples that help you to see problematic issues in real life on a No Emad device. The application is optimized for de vices with the resolution 170 x 208 pixels used i n portrait mode. This example application is cl osely related to the document Flash Lite : Visual Guide, and it is highly recommended to read the <http://www.un.org/arabic/documents/SCCom not before going through this example.
Platform: |
Size: 141744 |
Author: lyva1982 |
Hits:
Description: ATL object wizard that creates a collection of other COM objects
创建COM对象阿ATL对象向导(37KB)
-ATL object wizard that creates a collectio n of other COM objects created ATL COM Object Object A Wizard (37KB)
Platform: |
Size: 31222 |
Author: heshao |
Hits:
Description: 五子棋游戏源代码,不知道有没有人上传过，我收藏了n年的-renju game source code, do not know whether there are people upload, I collection of the Eastern n
Platform: |
Size: 10208 |
Author: 成欣 |
Hits:
Description: 火焰的源代码，学习着看比较好，C语言写的，收藏了n年的-flame source code, learning to do better, write the C language, a collection of the Eastern n
Platform: |
Size: 4803 |
Author: 成欣 |
Hits:
Description: 俄罗斯方块的源代码，c的，学习之用，收藏n年的-Russian box of source code, c, learning, the collection of the Eastern n
Platform: |
Size: 9106 |
Author: 成欣 |
Hits:
Description: 超级玛丽的源代码，学习之用，c的，收藏n年的东东啊-Super source code, learning, c, n, the collection Dongdonga
Platform: |
Size: 99699 |
Author: 成欣 |
Hits:
Description: 射击简单游戏的源代码，学习之用，收藏n年
的东东啊-simple shooting game's source code, learning, the collection of n Dongdonga
Platform: |
Size: 31017 |
Author: 成欣 |
Hits:
Description: //给定整数n，产生所有[2n]上的匹配（matching）
//将其视为一个所有块大小均为2的集合分拆
//以a_i表示其第i个元素所在的集合号
//输出格式为 a1 a2 a3 ...
//满足
//a_{i+1} <= max { a1,a2,...a_i } + 1
-/ / a given integer n, have all [2n] on the matching (matching) / / will be considered as an all pieces are two sets of a split / / a_i said in its i elements of a collection of lies / / output format for a1 a2 a3 ... / / meet / / a_ i (a)
Platform: |
Size: 1743 |
Author: 侯庆虎 |
Hits:
Description: 0 / 1背包问题是一个N P-复杂问题，为了解决该问题，，将用回溯算法解决该问题。既然想选择一个对象的子集，将它们装入背包，以便获得的收益最大，则解空间应组织成子集树的形状（如图1 6 - 2所示）。该回溯算法与4 . 2节的装载问题很类似。首先形成一个递归算法，去找到可获得的最大收益。然后，对该算法加以改进，形成代码。改进后的代码可找到获得最大收益时包含在背包中的对象的集合。-0 / 1 knapsack problem is a P-complex issues, in order to solve the problem, and will be used backtracking algorithm to solve the problem. As to the choice of a subset of object, they will load a backpack, in order to obtain the greatest profits, the solution should be organized into space subset of the shape of the tree (Figure 1 6-2 below). The backtracking algorithms and 4. Two loading problem is very similar. Forming a recursive algorithm to get the maximum benefit available. Then, this algorithm is modified to form code. Improved code can be found at the maximum benefits included in the backpack of a collection of objects.
Platform: |
Size: 8915 |
Author: 周易 |
Hits:
Description: GEOMETRY is a collection of routines for geometric calculations in 2, 3 and N space. These calculations include angles, areas, containment, distances, intersection, nearest point, and volumes. The objects considered include points, lines, line segments, polygons, planes, polyhedra and vectors.-GEOMETRY is a collection of routines for geometric calculations in 2, 3 and N space. These calculations include angles, areas, containment, distances, intersection, nearest point, and volumes. The objects considered include points, lines, line segments, polygons, planes , polyhedra and vectors.
Platform: |
Size: 45056 |
Author: mood_blue(黄强) |
Hits:
Description: 神经网络是单个并行处理元素的集合，我们从生物学神经系统得到启发。在自然界，网
络功能主要由神经节决定，我们可以通过改变连接点的权重来训练神经网络完成特定的功能-A single neural network is a collection of parallel processing elements, we have been inspired by biological nervous system. In nature, the network function of a decision by the ganglion, we can by changing the weight of the connection point to train neural network to complete the function of specific
Platform: |
Size: 244736 |
Author: zgp |
Hits:
Description: C#和.net 3.0第一步源代码
书籍收藏系统-C# and. Net 3.0 source code first
Book collection systems
Platform: |
Size: 3436544 |
Author: li jian |
Hits:
Description: 面试宝典， 面试宝典，N家公司的面试题目-Interview Collection, Interview Collection, interview Collection, N the company interview questions
Platform: |
Size: 237568 |
Author: 古稀 |
Hits:
Description: Easy Language Indicator collection - Source code from D to N [TradeStation]
Platform: |
Size: 29392896 |
Author: Dimitir Pap |
Hits:
Description: 神经网络是单个并行处理元素的集合，我们从生物学神经系统得到启发。在自然界，网络络功能主要由神经节决定，我们可以通过改变连接点的权重来训练神经网络完成特定的功能
-The neural network is a collection of a single parallel processing elements, we are inspired by biological nervous system. In nature, the network network function is determined by the ganglion, we can change the connection point of the right to re-train the neural network to perform the specific function
Platform: |
Size: 244736 |
Author: zhengguoo |
Hits:
Description: 编写递归函数，求n个元素集合的所有子集。不妨令集合元素为小写字母，原集合为{‘a’, ‘b’, …, ‘a’ + n - 1}。
输入：input.txt，仅包含整数n（1－26）。
输出：若输入合法，输出集合的所有子集；否则输出“WRONG”。子集输出格式为每行一个子集，空集用空行表示，非空集合每个元素间用一个空格间隔，最后一个元素之后不能有空格。-Write a recursive function of n a subset of all elements of the collection. May wish to make a collection of elements to lowercase, the original set is { a , b , ..., a + n- 1}. Input: input.txt, contains only integer n (1-26). Output: If you enter a valid, all subsets of the output set otherwise output WRONG . A subset of the output format for each line of a subset of the empty set with a blank line to indicate the non-empty set with a space between each element spacing, no spaces after the last element.
Platform: |
Size: 303104 |
Author: 刘慧 |
Hits: