首页> 外文会议>International Conference on Application of Information and Communication Technologies >Using Automaton Model to Determine the Complexity of Algorithmic Problems for Virtual Laboratories
【24h】

Using Automaton Model to Determine the Complexity of Algorithmic Problems for Virtual Laboratories

机译:使用自动机制模型来确定虚拟实验室算法问题的复杂性

获取原文

摘要

This paper describes automaton model of reference algorithm for constructing a correct solution of algorithmic problems for virtual laboratories. This model is developed on the basis of the automated control object. In addition, a method for formal determination of the problem variant's complexity and an example of evaluating the complexity function are presented. The complexity function defines the dependency between the resulting complexity of problem variant and its properties and provides the opportunity of variants' automatic construction with a predetermined complexity.
机译:本文介绍了参考算法的自动化模型,用于构建虚拟实验室算法问题的正确解决方案。该模型是在自动控制对象的基础上开发的。另外,呈现了一种用于正式确定问题变体复杂性的方法和评估复杂性功能的示例。复杂性函数定义了问题变体和其性质的结果复杂性之间的依赖性,并提供了具有预定复杂性的变体自动结构的机会。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号