点击切换搜索课件文库搜索结果(1340)
文档格式:DOC 文档大小:477.5KB 文档页数:8
2.3.5典型环节及其传递函数 任何一个复杂系统都是由有限个典型环节组合而成的。典型环节通常分为以下六种:
文档格式:DOC 文档大小:1.16MB 文档页数:30
3.3.1 二阶系统的数学模型 3.3.2 二阶系统的单位阶跃响应 3.3.3 二阶系统阶跃响应的性能指标
文档格式:PDF 文档大小:187.97KB 文档页数:25
How Might a mouse search a Maze for Cheese? heese · State Space Search? As a Constraint Satisfaction Problem? Goal-directed Planning As a rule or production System? What is missing? Ideas in this lecture Objective is to accumulate rewards rather than goal states Task is to generate policies for how to act in all situations rather than a plan for a single starting situation
文档格式:PDF 文档大小:2.38MB 文档页数:16
Probabilistic model Integrate over al!p(x1 Bel(x,)=ap(=;|x,)p(x1a1,=12a1-2,=0) ap(E, x )p(x, Ix, 1,a, p(|x,)p(x,1x1,a1)p(x1)d
文档格式:PDF 文档大小:1.69MB 文档页数:7
Robot localization 3 canonical problems Position Tracking Global Localization Kidnapped robot problem onot the mapping problem. We always assume we have a map To start without a map or model is the Simultaneous Localization and Mapping problem, or SLAM. also known as concurrent Mapping and Localization
文档格式:PDF 文档大小:113.24KB 文档页数:19
Achieving Arc Consistency via Constraint Propagation Arc consistency eliminates values of each variable domain that can never satisfy a particular constraint (an arc Directed arc (Vi, v) is arc consistent if VXED, 3yED, such that(x, y) is allowed by constraint C
文档格式:DOC 文档大小:1.1MB 文档页数:25
3.1 引言 3.2 一阶系统的时域分析 3.3 二阶系统的时域分析
文档格式:PDF 文档大小:37.54KB 文档页数:2
by Andreas Hoffman Introduction This jumpstart shows you the basics of getting Scheme started, running simple programs, that the Scheme installed in the 16.410 computer lab is the Windows vers Ban On simple editing and debugging, and exiting out of Scheme. The jumpstart is oriented towards Windows installations, but can be adapted for Unix and other installations. Note Please note that this jumpstart will give you only the most rudimentary skills in Scheme
文档格式:PDF 文档大小:167.1KB 文档页数:15
Elements of Algorithmic analysis · Soundness is a solution returned by the algorithm guaranteed to be Completeness is the algorithm guaranteed to find a solution when there is Time complexity how long does it take to find a solution? Space complexity how much memory does it need to perform search? Sian willams, Spring o3 Characterizing Search algorithms
文档格式:PDF 文档大小:481.15KB 文档页数:8
Background An icbm with a range of 6500 miles has a stagnation temperature of 12,000%F, 2000 f hotter than the surface of the sun Calculations showed that the optimum design for structural strength, resistance to heating, and free flight stability was a long, needle nosed reentry body But it would vaporize during reentry
首页上页124125126127128129130131下页末页
热门关键字
搜索一下,找到相关课件或文库资源 1340 个  
©2008-现在 cucdc.com 高等教育资讯网 版权所有