首页> 外文会议>International Conference on Artificial Intelligence and Soft Computing >Constraint Solving-Based Automatic Generation of Mobile Agent Itineraries
【24h】

Constraint Solving-Based Automatic Generation of Mobile Agent Itineraries

机译:基于限制的基于组件的移动代理流行语的自动生成

获取原文

摘要

Mobile agents can migrate among multiple nodes to perform their tasks at each of the visited nodes. The itineraries of agents seriously affect the availability and performance of mobile agent-based processing. However, they tend to be complicated, for example, the order of the nodes that agents should visit may be alternative or commutable. This paper proposes a framework for specifying constraints on the itineraries of agents and generating the itineraries that can satisfy the constraints. The contribution of this framework is to automatically generate the itineraries of mobile agents among computers from application-specific constraints. A prototype implementation of this framework and its application were built on a Java-based mobile agent system.
机译:移动代理可以在多个节点中迁移,以在每个访问的节点上执行其任务。代理的行程严重影响了基于移动代理的处理的可用性和性能。然而,它们往往是复杂的,例如,代理应该访问的节点的顺序可能是替代的或可上传的。本文提出了一个框架,用于指定代理的行程和生成可以满足约束的行程的限制。此框架的贡献是在特定于应用程序特定约束中自动生成移动代理的行程。基于Java的移动代理系统构建了此框架的原型实现及其应用程序。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号