搜索资源列表
C8051F021
- 用c8051f02x或041实现的具有计数分频功能程序，用c语言编程，易懂，欢迎下载-With c8051f02x or 041 to achieve with the counting Divide function program, with the c programming language, understandable, welcome to download
HalfSetAlgorithm
- 利用备忘录策略，采用递归分治方法实现求解半数集问题-Use memo strategies, using recursive divide and conquer method to solve half the problem set
juzhen
- 基本思想与分治法类似，也是将待求解的问题分解为若干个子问题（阶段），按顺序求解子阶段，前一子问题的解，为后一子问题的求解提供了有用的信息。在求解任一子问题时，列出各种可能的局部解，通过决策保留那些有可能达到最优的局部解，丢弃其他局部解。依次解决各子问题，最后一个子问题就是初始问题的解。 由于动态规划解决的问题多数有重叠子问题这个特点，为减少重复计算，对每一个子问题只解一次，将其不同阶段的不同状态保存在一个二维数组中。 -The basic idea with the divide
ArithmeticTest
- 图形界面的算数练习器，可自己选择加减乘除，多位运算，定时，最后统计分数。-a graph ArithmeticTest ，you can choose the plus minus multiply divide. set time to do it . the program willgive a grade to you
KMEANS
- 输入：聚类个数k，以及包含 n个数据对象的数据库。输出：满足方差最小标准的k个聚类。处理流程： （1）从 n个数据对象任意选择 k 个对象作为初始聚类中心. （2）根据每个聚类对象的均值（中心对象），计算每个对象与这些中心对象的距离；并根据最小距离重新对相应对象进行划分；（3）重新计算每个（有变化）聚类的均值（中心对象） （4）循环（2）到（3）直到每个聚类不再发生变化为止-Input: number of clusters k, and n data object contains a
pthread_ms_static
- this implemented by pthread(share library) to draw the mandelbrot set.Using the iteration to try to compute the x and y value.and divide work by rows to any other threads to complete the total jobs.-this is implemented by pthread(share library) to dr
pthread_ms_dynamic
- this implemented by pthread(share library) to draw the mandelbrot set.Using the iteration to try to compute the x and y value.and divide work by dynamic mode (different from static)by rows to any other threads to complete the total jobs.-this is impl
openmp_ms_static
- this implemented by OpenMP(share library) to draw the mandelbrot set.Using the iteration to try to compute the x and y value.and divide work by(static rule) rows to any other threads to complete the total jobs.-this is implemented by OpenMP(share lib
openmp_ms_dynamic
- this implemented by OpenMP(share library) to draw the mandelbrot set.Using the iteration to try to compute the x and y value.and divide work by(dynamic rule) rows to any other threads to complete the total jobs.-this is implemented by OpenMP(share li
bits
- CMU CSAPP LAB1 位级操作 其中bitcount函数用到了较为简便的分治思想-CMU CSAPP LAB1 bit-level operations which bitcount function uses a relatively simple Divide and Conquer
MvcCms
- MvcCms架构分析(底层框架分离)源码 MvcCms该项目是系Orachrd Oxite 一系列MVC3应用比较成熟的产品之一，开发都是以微软开发模式“分而治之”为基础。 涉及到的技术； 1.MVC3 2.CastleWindsor 3.ServiceLocator 4.多UI， 5.MemberProvider 6.Cache(在该项目中Cache的应用也是一个很好的实例，重点在于Cache与动态信息结合的使用。以及Cache自动更新。） 关于Castle
Calculator
- 能够实现加减乘除等计算器具有的功能，简单易用-Be able to add, subtract, multiply, divide, etc. calculator has features, easy to use
4
- 本程序实现delaunay三角形和voronoi划分的迭代式构造-The program voronoi delaunay triangles and divide iterative structure
jsq
- 一个功能简单的计算器，能进行加，减，乘，除法运算-A function of a simple calculator that can add, subtract, multiply, and divide operations
Component_VHDL
- VHDL层次化电路设计简单例子 分频-计数-BCD_7输出-VHDL hierarchical circuit design simple example Divide- count-BCD_7 output
Polynomial
- 数据结构的作业 简单多项式的加、减、乘、除、求幂等运算，并显示出来-Simple polynomial data structure operations add, subtract, multiply, divide, exponentiation, such as computing and displayed
fenzhifa
- 分治法求数组中最大值和最小值，与普通方法比较-Divide and conquer method for the maximum and minimum values in the array, compared with the conventional method
QuickSort
- Quicksort is a divide and conquer algorithm. Quicksort first divides a large list into two smaller sub-lists: the low elements and the high elements. Quicksort can then recursively sort the sub-lists. The steps are: Pick an element, called a pivo
MaxMin
- 算法设计与分析 分治法求数组中的最大最小值-Divide and conquer algorithm design and analysis method for the minimum and maximum values in the array
tennis
- 算法设计与分析 分治法求网球循环赛赛程 1、实验步骤和要求： 设有n个运动员要进行网球循环赛。设计一个满足下列条件的比赛日程表： 每个选手必须与其他n-1个选手各赛一次； 每个选手一天只能赛一次； 当n是偶数时，循环赛进行n-1天。 当n是奇数时，循环赛进行n天。-Algorithm design and analysis divide and conquer France beg tennis round-robin Distances 1, experimenta