计算机技术与发展Issue(6)：131-135,5.DOI:10.3969/j.issn.1673-629X.2014.06.033
基于深度优先的分步分治算法研究
Research on Algorithm Based on Depth First Search and Task Partition
摘要
Abstract
Top-k service composition problem has the actual research significance and application scenarios for academia and industry. Analyze the key solution graphs of top-k problems in this paper,propose an algorithm based on depth first search and task partition. This algorithm first solves the user request separately which can be parallel processing,and then merge this solutions to provide a complete so-lution for the user request. This algorithm can support distribute and parallel framework,quickly and efficiently provide the service com-position satisfies the user need when facing large scale service sets. Propose the method to construct solution graphs to search solutions, through solving critical path and no-critical path and merge critical and no-critical paths to gain solution graph.关键词
服务组合/关键路径/服务筛选/top-kKey words
service composition/critical path/service filter/top-k分类
信息技术与安全科学引用本文复制引用
郭双宙,徐济惠..基于深度优先的分步分治算法研究[J].计算机技术与发展,2014,(6):131-135,5.基金项目
宁波市自然科学基金资助项目(2010A10125,2012A610063) （2010A10125,2012A610063）
宁波市科技局创新科学基金资助项目(2011B710034) （2011B710034）
