Location:
Search - PN search
Search list
Description: 有关搜索方面（尤其是计算机博弈）的专著。介绍了pn-search,db-search，以及他们在五子棋（gomoku）和其他一些方面的应用。最后还总结了目前（1994年）人工智能在棋类游戏中发展状况。-the search (especially computer game) monographs. Introduced pn-search, db - search, and their 331 (Gomoku) and other aspects of the application. Finally, a summary of current (1994) Artificial Intelligence in chess game situation.
Platform: |
Size: 850595 |
Author: 杨震原 |
Hits:
Description: 有关搜索方面（尤其是计算机博弈）的专著。介绍了pn-search,db-search，以及他们在五子棋（gomoku）和其他一些方面的应用。最后还总结了目前（1994年）人工智能在棋类游戏中发展状况。-the search (especially computer game) monographs. Introduced pn-search, db- search, and their 331 (Gomoku) and other aspects of the application. Finally, a summary of current (1994) Artificial Intelligence in chess game situation.
Platform: |
Size: 849920 |
Author: 杨震原 |
Hits:
Description: 贪心算法作业的解题报告(含证明)和源代码:磁盘文件最优存储问题，当初证明花了一些时间。问题描述：设磁盘上有n个文件，f1,f2,…,fn，，每个文件占磁盘上1个磁道。这n个文件的检索概率分别是p1,p2,…,pn,
且∑pi=1。磁头从当前磁道移到被检信息磁道所需的时间可用这2 个磁道之间的径向距离来度量。如果文件pi存放在第i道上, ，则检索这n 个文件的期望时间是∑pipjd(i,j)
其中d(i,j) 是第i道与第j 道之间的径向距离|i-j|。磁盘文件的最优存储问题要求确定这n个文件在磁盘上的存储位置，使期望检索时间达到最小。试设计一个解此问题的算法，并分析算法的正确性和计算复杂性。-Greedy algorithm for solving the report of operations (including certificate) and the source code: the optimal disk file storage issues, had spent some time to prove. Problem Description: There are n disk-based files, f1, f2, ..., fn,, accounts for each file on a disk track. This n the probability of a document retrieval are p1, p2, ..., pn,
And Σpi = 1. Head from the current track information to be seized can be used track the time required between these two tracks to measure the radial distance. Pi if the file stored in the first track i,, then retrieve documents that the expectations of n is Σpipjd (i, j)
Which d (i, j) is the first i Road with the first j of the radial distance between the Road | ij |. Optimal storage disk file to seek to establish that n files on the disk storage location, so expect to minimize search time. Try to design a solution algorithm for this problem and to analyze the correctness of algorithms and computational complexity.
Platform: |
Size: 266240 |
Author: 吴钦阳 |
Hits:
Description: The .m file simulates a Spread-Spectrum Modulation Trx/Rcx system, in which, the phase of the pseudo-random sequence generated in the transmitter and used to encode the data stream is unknown a priory at the receiver.A parallel search strategy is employed to locally determine it in the place. It works as here: selecting the maximam-energy low-pass filtered signal of the set of all hypothesied despreaded ones using different hypothesized phases for the PN-sequence.The simulation can be growed in several ways including considering various types of noise and jammings or also designing better filters.
Platform: |
Size: 3072 |
Author: Rafal |
Hits:
Description: 搜寻最短延时的交织m序列伪码，可选择m序列的长度，自动产生生成多项式-Search for the shortest delay interwoven m PN sequence can choose the length of m sequence, automatically generating polynomial
Platform: |
Size: 3072 |
Author: tq |
Hits:
Description: 相关峰搜索捕获,为随机PN码的生成，相关处理，峰值比较。-correlation peak search
Platform: |
Size: 1024 |
Author: 李卓 |
Hits:
Description: 设磁盘上有n个文件f1, f2, …, fn,每个文件占用磁盘上的1个磁道。这n个文件的检索概率分别是p1, p2, …, pn,且p1+p2+…+ pn =1。磁头从当前磁道移到被检信息磁道所需的时间可用这2个磁道之间的径向距离来度量。如果文件fi存放在第i道上，1≦i≦n，则检索这n个文件的期望时间是对于所有的i < j, time+=pi*pj*d(i,j)。其中d(i,j)是第i道与第j道之间的径向距离|i-j|。
磁盘文件的最优存储问题要求确定这n个文件在磁盘上的存储位置,使期望检索时间达到最小。
-Documents n f1, f2, ..., fn, each file on the disk occupied by a track provided on the disk. The probability of the n retrieval documents are p1, p2, ..., pn, and p1+p2+ ...+ pn = 1. The time required to move the head of the subject is available information track radial distance between these two tracks from the current track to measure. If the file is stored in the i-th track fi, 1 ≦ i ≦ n, the time to retrieve a desired file which is n for all i < j, time+ = pi* pj* d (i, j). Where d (i, j) is the radial distance of the i channel between the channel and the j | ij |. Optimal disk file storage issues required to determine these n files on disk storage location, so expect the search time to a minimum.
Platform: |
Size: 1024 |
Author: liuxu |
Hits: