An Efficient Parallel Algorithm for the Longest Increasing Subsequence Problem on a LARPBS

机译：LARPBS上最长增长子序列问题的高效并行算法

获取原文

页面导航

摘要
著录项
相似文献
相关主题

摘要

In this paper, we give a parallel algorithm for the longest increasing subsequence problem on a LARPBS, one of the recently proposed parallel model based on optical bus. For a sequence of n integers, we solve the longest increasing subsequence problem in

机译：在本文中，我们提出了一种并行算法，用于解决LARPBS上最长的增长子序列问题，这是最近提出的基于光总线的并行模型之一。对于n个整数的序列，我们解决了最长的递增子序列问题

著录项

来源
《Parallel and Distributed Computing, Applications and Technologies (PDCAT), 2007 Eighth International Conference on》|2007年|P.251-258|共8页
会议地点 Adelaide SAAustralia
作者
Seme; D.; Youlou; S.;
展开▼
作者单位

展开▼
会议组织
原文格式 PDF
正文语种
中图分类
关键词
computational complexity; parallel algorithms; longest increasing subsequence problem; maximal layer problem; optical bus; parallel algorithm; time complexity;

机译：计算复杂度；并行算法；最长的子序列增长问题；最大层问题光学总线；并行算法时间复杂度;

相似文献

外文文献
中文文献
专利

1. A Fast Efficient Parallel Hough Transform Algorithm on LARPBS [J] . LING CHEN, HONGJIAN CHEN, YI PAN, Journal of supercomputing . 2004,第2期

机译：基于LARPBS的快速高效并行Hough变换算法
2. A New Progressive Algorithm for a Multiple Longest Common Subsequences Problem and Its Efficient Parallelization [J] . Yang Jiaoyun, Xu Yun, Sun Guangzhong, Parallel and Distributed Systems, IEEE Transactions on . 2013,第5期

机译：多重最长公共子序列问题的新渐进算法及其有效并行化
3. Efficient CGM-based parallel algorithms for the longest common subsequence problem with multiple substring-exclusion constraints [J] . Parallel Computing . 2020,第Mara期

机译：具有多个子串排除约束的最长公共子序列问题的基于CGM的高效并行算法
4. An Efficient Parallel Algorithm for the Longest Increasing Subsequence Problem on a LARPBS [C] . Seme D., Youlou S. International Conference on Parallel and Distributed Computing, Applications and Technologies . 2007

机译：一种有效的并行算法，在LARPBS上最长增加的后续后续问题
5. Designing efficient and accurate parallel genetic algorithms (Parallel algorithms). [D] . Cantu-Paz, Erick. 1999

机译：设计高效，准确的并行遗传算法（并行算法）。
6. Efficient algorithms for Longest Common Subsequence of two bucket orders to speed up pairwise genetic map comparison [O] . Lisa De Mattéo, Yan Holtz, Vincent Ranwez, -1

机译：两个存储桶顺序的最长公共子序列的高效算法可加快成对遗传图谱的比较
7. Scalable and Efficient Parallel Algorithms for Euclidean Distance Transform on the LARPBS Model [O] . Ling Chen, Ieee Computer Society, Yi Pan, 2004

机译：LaRpBs模型上欧氏距离变换的可扩展高效并行算法
8. Increased UAV Task Assignment Performance Through Parallelized Genetic Algorithms (Preprint) [R] . Darrah, M. A. , Niland, W. M. , Stolarik, B. M. , 2006

机译：通过并行遗传算法提高无人机任务分配性能（预印本）

An Efficient Parallel Algorithm for the Longest Increasing Subsequence Problem on a LARPBS

摘要

著录项

相似文献

相关主题

期刊订阅