排序方式: 共有6条查询结果,搜索用时 140 毫秒
1
1.
SUB和COM是专家系统推理网络图中常见的关系算子,AND和OR分别是SUB和COM算子的特例.建立在理想AND/OR图上的半景搜索法和最大优势搜索法可以推广到包含SUB和COM算子的理想非AND/OR图的搜索,而最大超越搜索法则可推广到包含回路结构的非理想AND/OR图的搜索. 相似文献
2.
针对现有机车电路过程的计算机动态图形仿真系统不能为机车设计人员使用,只能用于学员培训,且由内机型的迅速变化,程序人员不得不重复笥地编写和输入逻辑控制程序,费时费力这一现状,提出了根据输入电路原理图由计算机自动生成,逻辑仿真文件的开发平台的设计方法。 相似文献
3.
This paper investigates the Operational Aircraft Maintenance Routing Problem (OAMRP). Given a set of flights for a specific homogeneous fleet type, this short-term planning problem requires building feasible aircraft routes that cover each flight exactly once and that satisfy maintenance requirements. Basically, these requirements enforce an aircraft to undergo a planned maintenance at a specified station before accumulating a maximum number of flying hours. This stage is significant to airline companies as it directly impacts the fleet availability, safety, and profitability. The contribution of this paper is twofold. First, we elucidate the complexity status of the OAMRP and we propose an exact mixed-integer programming model that includes a polynomial number of variables and constraints. Furthermore, we propose a graph reduction procedure and valid inequalities that aim at improving the model solvability. Second, we propose a very large-scale neighborhood search algorithm along with a procedure for computing tight lower bounds. We present the results of extensive computational experiments that were carried out on real-world flight networks and attest to the efficacy of the proposed exact and heuristic approaches. In particular, we provide evidence that the exact model delivers optimal solutions for instances with up to 354 flights and 8 aircraft, and that the heuristic approach consistently delivers high-quality solutions while requiring short CPU times. 相似文献
4.
5.
论文综合讨论了二维码(QR Code)图像的相关知识和无参考图像质量评价方法的相关原理,重点对算法进行评测.文章首先阐述二维码的相关特性;其次对目前比较常用的算法进行简要介绍,并对二维码进行评测和结果分析;最后指出二维码图像质量评价是未来重要的研究方向. 相似文献
6.
周娟 《江苏科技大学学报(社会科学版)》2009,23(4):343-346
多agent系统中事件间的逻辑约束形成事件间的逻辑依赖关系.在分析逻辑依赖关系与一阶谓词表示法基础上,分别给出了单agent单目标、多agent单目标、多agent联合目标的逻辑依赖关系的与/或图表达方法,并应用与/或图的AO*搜索算法,以多agent单目标情形为例,演示多agent系统中逻辑依赖关系的计算过程. 相似文献
1