搜索资源列表
frac_divider_verilog
- This code has written in verilog and it can divide two fraction numbers in fixed point standard .In this code ni shows the number of bits of inputs and no shows the number of bits of output and if we want more precision we can change this parameters
qipanfugai_CPP
- 用C++编写的棋盘覆盖问题的解决，其中有非常清楚的注释，帮助学习者了解分治法在类似问题中的应用-Board cover solution written in C++, which has a very clear comments to help students understand the divide and conquer those problems
qipanfugai_matlab
- 用matlab编写的棋盘覆盖问题的解决，有清楚的注释，帮助学习者了解分治法在类似问题中的应用-Matlab prepared by the board covering problems, clear notes, to help students understand the divide and conquer similar problems
fzfksfl
- 分治法快速排序的c++代码，实现平台为visual studio 2008-Divide and conquer quicksort c++ code, the platform for Visual Studio 2008
yuyinwenduji
- 基于单片机的语音温度计的设计 包含 源程序 原理图 PCB 源文件 先录音，能分160段(地址为00H-0A0H)。我们说话平均语速4字/秒，所以20秒我们录80字。 经过计算，每个字占2个地址。我们录音15段。 录音用S1键，放音控制用S2键。录音时按下键后开始录音,录完每段后放开按键,录音停止。 共录15段,录每段时同时用数码管提示，分别用数字1-F来表示。 录音时按住来录音，放开手停止录音。 按语音(长按等到数码管变暗放手)提示键播报温度,不按不播报
NearestPoint
- 使用分治法实现最近点对算法，图形化界面，可以通过鼠标点击生成点也可以随机生成，并计算得到最近点对-Divide and conquer method to achieve the closest point algorithm, graphical interface, can be generated by a mouse click can also be randomly generated, and calculated to the nearest point on
The-way-of-divide-and-hex
- 这个文件中介绍了分频和各种进制编写的几种方法，VHDL语言，-This file is described in several sub-frequency and a variety of hex write the VHDL language,
VHDL_Divider
- 该文档详细介绍了用VHDL语言实现分数分频器和积分分频器，以及50 占空比的奇数分频和非50 占空比的奇数分频。-This document details the odd fractional divider and integral divider, and 50 duty cycle with VHDL divider and an odd number of non-50 duty cycle divide.
algorithms
- 附件是邓建明老师上的算法课的详细课件，设计算法设计与分析的各个方面，如分治法，贪心算法，平摊分析等，希望对大家有帮助-Attachment algorithm Jian-ming teacher lesson courseware, and all aspects of the design algorithm design and analysis, such as divide and conquer method, greedy algorithms, amortized analysis
CLK_DIV
- verilog HDL写的时钟通用计数分频程序，设置系统时钟，并根据目标时钟，设置分频系数即可得到目标时钟。已实际测试可用。-verilog HDL write clock common procedures for the count and divide, set the system clock, and the root According to the target clock, set the frequency division factor can get the targ
Incomplete-board-problems
- 残缺棋盘问题中利用分而治之的方法，将覆盖2k×2k残缺棋盘的问题转化为覆盖较小残缺棋盘的问题。2k×2k棋盘一个很自然的划分方法就是将它划分为如图1a所示的4个2k-1×2k-1棋盘。当完成这种划分后，4个小棋盘中仅仅有一个棋盘存在残缺方格（因为原来的2k×2k棋盘仅仅有一个残缺方格）。首先用三格板填充中心处把剩下的3个小棋盘转变为残缺棋盘，如图1b所示，其中原2k×2k棋盘中的残缺方格落入左上角的2k-1×2k-1棋盘，分割填充后产生四个小的残缺棋盘，然后，任务转变为分别填充四个小的2k-1×
code
- 加减乘除 我是初学者只能上传这简单的代码了-A simple code add, subtract, multiply and divide Used to add, subtract, multiply and divide
jiSuan
- 一个简单的计算器，实现加减乘除的功能，很容易实现。-A simple calculator, to achieve add, subtract, multiply and divide the function, is easy to achieve.
cevap1
- this package cotains a C++ source code, an executeble file and a describtive txt file this program can add two numbers, divide them, mines them and multiple 2 numbers with eachother which are entered by user. i wrote this program. this program c
1
- 分治法最优三角剖分 三角剖分与Delaunay剖分的定义 Delaunay三角剖分的定义 -divide and conquer delaunay triangulation
filedivision
- 用于自动将较大的文本文件分割成若干较小的文件-it is used to divide a file of txt style into several parts.
biaodashiqiuzhi
- 输入一个表达式，其中包含0~9及负号小数点组成的浮点数和加减乘除运算符，还应该包含括号。其他字符非法的输入均报错,表达式以#结束。输出运算结果。程序所能达到的结果有：适用于浮点型的计算，且适用于多位数的运算，适用于负数的运算。对输入的表达式有判断对错的功能-Input a expressions, including 0 ~ 9 and minus the decimal point of floating-point and add, subtract, multiply and divide
FillBoard
- MFC实现的填充棋盘小程序，鼠标单击窗口任一点，即时生成填充棋盘的解法。填充算法使用分治法。-Fill the chessboard small program is implemented by MFC, mouse click the window at any point, the solution immediately generated to fill the board. Filling algorithm using the divide and conquer.
dbbz
- 自己实现的敌兵布阵的源代码，HDOJ1066题，数据结构使用了线段树和树状数组，算法策略使用了分治策略。-Own implementation of the enemy soldiers ended their source code, HDOJ1066 question, data structures using the segment tree and the tree array, the algorithm strategy of divide and conquer strategy
bignumber
- 分治法实现的大整数乘法。是学习分治算法策略的很好的范例。-Sub-rule method to achieve the large-integer multiplication. Is a good example of learning the strategy of divide and conquer algorithm.