点击切换搜索课件文库搜索结果(294)
文档格式:PPT 文档大小:655KB 文档页数:19
Goal Concept: A concept definition describing the concept to be learned. (It is assumed that this concept definition fails to satisfy the Operationality Criterion. Training Example: An example of the goal concept Domain Theory: A set of rules and facts to be used in explaining how the training example is an example of the goal concept
文档格式:DOC 文档大小:143.5KB 文档页数:10
Arenes: Nomenclature Monosubstituted benzene derivatives are names as other hydrocarbons using the following set of rules: 1. Benzene is the parent name; when a benzene ring is a substituent on another chain, it is referred to as a \phenyl\ group
文档格式:PDF 文档大小:168.81KB 文档页数:25
Problem: Maintain a dynamic collection of pairwise-disjoint sets= {S1, S2, .. S } Each set S; has one element distinguished as the representative element, rep[]
文档格式:PPT 文档大小:137.5KB 文档页数:4
一.固定输出电压工作方式 按LINE键到ON的位置,在输出端开路的情况下,转 动VOLTAGE控制旋钮到所需要的输出电压值,CV(固定 电压)的指标灯亮。 再按下CC SET键,转动CURRENT旋钮,设定电流 极限值。如工作中因某种原因达到了极限电流,电流不会 再增长,电源会自动转换到固定电流工作方式,并相应降 低输出电压保护电源
文档格式:PDF 文档大小:253.76KB 文档页数:30
Definition. A directed graph (digraph) G = (V, E) is an ordered pair consisting of • a set V of vertices (singular: vertex)
文档格式:PDF 文档大小:251.95KB 文档页数:29
Balanced search tree: A search-tree data structure for which a height of O(lg n) is guaranteed when implementing a dynamic set of n items
文档格式:PDF 文档大小:145.78KB 文档页数:19
Algorithms Day 12 L8.2 A weakness of hashing Problem: For any hash function h, a set of keys exists that can cause the average access time of a hash table to skyrocket. IDEA: Choose the hash function at random, independently of the keys
文档格式:PPT 文档大小:2.35MB 文档页数:75
Sorting: There is a series of data in random order, we sort them depending a certain key word. Datalist: an finity set of data waiting to be sorted. Key: data object has many attribute areas, namely there are many data element, one of all these elements can be used to distinguish object, we use it as sorting key. we also call it sorting code
文档格式:PPT 文档大小:498.5KB 文档页数:28
【Definition】An algorithm is a finite set of instructions that, if followed, accomplishes a particular task. In addition, all algorithms must satisfy the following criteria: (1) Input There are zero or more quantities that are externally supplied
文档格式:DOC 文档大小:21KB 文档页数:1
A firm, using two inputs K and L to produce one product, whose production function is 2 / 5 3/ 5 Q = 25L K
首页上页1516171819202122下页末页
热门关键字
搜索一下,找到相关课件或文库资源 294 个  
©2008-现在 cucdc.com 高等教育资讯网 版权所有