Description: 探索一种解决RFID系统中碰撞问题的方法，具体讨论防碰撞算法中的二进制搜索算法及其改进方法——动态二进制搜索算法。-explore a solution RFID system collision problem. discuss specific anti-collision algorithm of the binary search algorithm and improved method -- Dynamic binary search algorithm. Platform: |
Size: 6236 |
Author:cwj0304 |
Hits:
Description: 用二分搜索算法求x=2sinx的所有根，设计出具体的程序，使之能够动态演示搜索过程。-Using binary search algorithm for x = 2sinx all the roots, the specific procedure designed to enable dynamic demonstration searching process. Platform: |
Size: 5120 |
Author:jack |
Hits:
Description: <算法导论>第二版大部分算法实现.
1. 各类排序和顺序统计学相关
2. 数据结构
2.1 基本数据结构
2.2 散列表
2.3 二叉查找树
2.4 红黑树
2.5 数据结构基于红黑树的扩张
3. 高级涉及和分析技术
3.1 动态规划相关
3.2 贪心算法相关
3.3 用于不相交集合的数据结构
4. 部分图算法.-<Introduction to Algorithms> Algorithms realize most of the second edition of .1. All kinds of sorting and order statistics related to 2. Data Structure 2.1 Basic Data Structure 2.2 Hash Table 2.3 Binary search Tree 2.5 Tree 2.4 red and black red and black tree-based data structure the expansion of 3. High and analytical techniques involving dynamic programming related 3.1 Greedy Algorithm 3.2 for the relevant 3.3 Disjoint Set Data Structure 4. part of Fig algorithm. Platform: |
Size: 324608 |
Author:QJGui |
Hits:
Description: 这里面有二分查找、进制转换、数据结构、货郎担算法、动态网络最短路线等等很多很多的程序-There are binary search, binary conversion, data structure, traveling salesman algorithm, dynamic shortest route network and so on many, many procedures Platform: |
Size: 316416 |
Author:陈胜 |
Hits:
Description: PKU中一些数据结构基本算法题的java实现，包括DIJ、PRIM、二叉查找树、并查集、动态规划、KMP、匈牙利算法、深搜广搜等-PKU some basic data structure algorithm java realization of the title, including DIJ, PRIM, binary search tree, and search sets, dynamic programming, KMP, the Hungarian algorithm, collected, such as deep-search Platform: |
Size: 77824 |
Author:俞昊旻 |
Hits:
Description: 问题一：设a[0:n-1]是已排好序的数组。请改写二分搜索算法，使得当搜索元素x不在数组中时，返回小于x的最大元素位置i和大于x的最小元素位置j，当搜索元素在数组中时，i和j相同，均为x在数组中的位置。
问题二：采用分治策略实现对n个元素进行排序的合并排序算法，其基本思想是：将待排序元素分成大小大致相同的2个子集合，分别对2个子集合进行排序，最终将排好序的子集合合并成为所要求的排好序的集合。
问题三：给定n个矩阵{A1，A2，A3，……，An}，其中，Ai与Ai+1是可乘的，i=1，2，…,n-1。要求用动态规划解矩阵连乘积的最优计算次序问题。
该三题的算法设计思想及源码，调试结果-Question one: Let a [0: n-1] is already sorted array. Please rewrite the binary search algorithm so that when the search element of x is not an array, the return is less than x, is larger than the largest element in position i and position x, the smallest element of j, when the search elements in the array when, i and j the same, both x in the array position.
Problem 2: The strategy for achieving the partition of n elements to sort of merge sort algorithm, whose basic idea is: sort elements are to be divided into roughly the same size of the two sub-sets, respectively, of the two sub-sort the collection will eventually sorted The merged to form the required subset sorted collection.
Question 3: Given n matrices (A1, A2, A3, ... ..., An), where, Ai and Ai+1 is a mere a, i = 1,2, ..., n-1. Required to use dynamic programming solution matrix with the optimal product sequence calculation of the problem.
The three questions of the algorithm design ideas and source code, debu Platform: |
Size: 9216 |
Author:土咩豆 |
Hits:
Description: 、实验目的
1 熟练掌握各种内排序方法，深刻理解排序算法及其执行过程；
2 学会分析各种内排序算法的性能；
3 了解各种排序方法的优缺点，对于实际问题能够选择一种较好的排序方案；
4 熟练掌握图的存储结构；
5 掌握图的邻接矩阵和邻接表表示分别进行深度和广度优先搜索遍历的算法。
6 了解图的最小生成树算法。-Proficiency in the order of search, binary search and index search basic search algorithm, these algorithms are familiar with what kind of storage structure suitable for implementation two master binary sort tree characteristics, building methods, and dynamic search algorithm 3 master hash table of characteristics and construction methods. Platform: |
Size: 3072 |
Author:zhangge |
Hits:
Description: 使用动态规划算法实现的最优二叉查找树问题，算法基础中的基本算法。使用vc6.0进行编译-Dynamic programming algorithm using the optimal binary search tree problem, the algorithm based on the basic algorithm. Compiled using vc6.0 Platform: |
Size: 1024 |
Author:Rhonda |
Hits:
Description: 查找算法实现与性能分析
要求：（1）数据结构的定义
（2）静态查找算法（顺序，折半）实现
（3）动态查找实现(二叉排序树建立、查找)
（4）性能分析(用大批量数据测试算法的执行时间)
-Search algorithm and performance analysis of requirements: (1) data structure definition (2) static search algorithm (the order of half) (3) dynamic lookup (binary sort tree to create, find) (4) Performance Analysis (with large bulk data test the algorithm execution time) Platform: |
Size: 18432 |
Author:汤艳荣 |
Hits:
Description: 探索一种解决RFID系统中碰撞问题的方法，具体讨论防碰撞算法中的的二进制搜索算法及其改进方法——动态二进制搜索算法。
-Explore a solution to the problem of the collision in RFID systems, specifically to discuss the anti-collision algorithm, the binary search algorithm and its improved method- dynamic binary search algorithm. Platform: |
Size: 6144 |
Author:兴奋 |
Hits:
Description: 针对射频识别系统中的标签碰撞问题，提出了一种基于分组策略的RFID自适应防碰撞算法。该算法在二叉树搜索算法的基础上引入分组策略、后退策略、自适应地选择四叉树搜索策略、动态调整标签碰撞检测过程策略，减少了搜索次数和读写器与标签间的通信量，提高了识别效率。-Systems for radio frequency identification tag collision problem, a packet-based strategy RFID adaptive anti-collision algorithm. The algorithm in the binary tree search algorithm based on the introduction of grouping strategies, backward strategy adaptively select quadtree search strategy and dynamic adjustment of tag collision detection process strategies to reduce the amount of communication between the number of searches and the reader and tag, improve the recognition efficiency. Platform: |
Size: 7913472 |
Author:pugongying |
Hits:
Description: 网页版简单二分查找算法和斐波那契额查找算法的动态演示，由html和javascrippt实现。可手动输入数据，查找过程中可以暂停，继续，加速，减速。支持字符串与数字两种方式查找。查找过程过算法对应行与数据对应部分会高亮显示。-Web dynamic presentation of the binary search algorithm and Fibonacci search algorithm , achieved by html and js. You can manually enter data, and find process can pause, continue, accelerate, or decelerate. And this one supports string and number data format.During algorithm search process the corresponding algorithm line will be highlighted. Platform: |
Size: 9216 |
Author:程鹏 |
Hits:
Search - Dynamic Binary Search Algorithm