• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Conference on Artificial Intelligence IC-AI'2000 Vol.3, Jun 26-29, 2000, Las Vegas, Nevada, USA >A Constraint Solver for Reconciling Heterogeneous Trees
【24h】

A Constraint Solver for Reconciling Heterogeneous Trees

机译：协调异构树的约束求解器

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

In order to simplify the reconciliation of two heterogeneous tree databases, we must minimize the number of crossovers in a directed graph constructed using two subtrees selected from the databases. This paper proposes a method for minimizing the number of crossovers in the directed graph. To find the directed graph with the minimum number of crossovers, the method maintains zero-crossovers in each ordered subtree. Moreover, the method transforms the interconnection matrix into a unit matrix heuristically, after defining the matrix representing the connections between the two leaf layers alone. To maintain the zero-crossover constraint for each ordered tree in the matrix transformation, the method also finds the two leaf clusters that contain half of the leaf nodes and swaps the leaf clusters. Since an exhaustive search generally requires a large amount of CPU time to solve a non-zero crossover problem, it is important that the method finds a semi-optimal solution by stopping at the relevant matrix transformation.
机译：为了简化两个异构树数据库的协调，我们必须最小化使用从数据库中选择的两个子树构造的有向图中的交叉数。本文提出了一种最小化有向图中交叉数的方法。为了找到具有最小交叉次数的有向图，该方法在每个有序子树中保持零交叉。此外，在定义仅表示两个叶层之间的连接的矩阵之后，该方法将互连矩阵启发式地转换为单位矩阵。为了在矩阵变换中为每个有序树保持零交叉约束，该方法还找到包含一半叶子节点的两个叶子簇，并交换叶子簇。由于穷举搜索通常需要大量的CPU时间来解决非零交叉问题，因此重要的是，该方法通过停止相关的矩阵变换来找到半最优解。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号