检索结果-内蒙古大学图书馆

A parameterized shared-memory scheme for parameterized metaheuristics

JOURNAL OF SUPERCOMPUTING 2011年第3期58卷 292-301页

作者： Almeida, Francisco Gimenez, Domingo Lopez-Espin, Jose J. Univ Murcia Dept Informat & Sistemas Murcia Spain Univ La Laguna Dept Estadist Invest Operat & Comp E-38207 San Cristobal la Laguna Spain Univ Miguel Hernandez Ctr Invest Operat Elche Spain

This paper presents a parameterized shared-memory scheme for parameterized metaheuristics. The use of a parameterized metaheuristic facilitates experimentation with different metaheuristics and hybridation/combinations to adapt them to the particular problem we are working with. Due to the large number of experiments necessary for the metaheuristic selection and tuning, parallelism should be used to reduce the execution time. To obtain parallel versions of the metaheuristics and to adapt them to the characteristics of the parallel system, a unified parameterized shared-memory scheme is developed. Given a particular computational system and fixed parameters for the sequential metaheuristic, the appropriate selection of parameters in the unified parallel scheme eases the development of parallel efficient metaheuristics.

关键词： Parallel metaheuristics Shared-memory Parameterized algorithms algorithms optimization

来源：评论

学校读者我要写书评

暂无评论

A Warp Speed Chain-Code Algorithm Based on Binary Decision Trees 9

A Warp Speed Chain-Code Algorithm Based on Binary Decision T...

引用

Joint 9th International Conference on Informatics, Electronics and Vision (ICIEV) / 4th International Conference on Imaging, Vision and Pattern Recognition (ICIVPR)

作者： Allegretti, Stefano Bolelli, Federico Grana, Costantino Univ Modena & Reggio Emilia Dipartimento Ingn Enzo Ferrari Modena Italy

ISBN: (纸本)9781728193311

Contours extraction, also known as chain-code extraction, is one of the most common algorithms of binary image processing. Despite being the raster way the most cache friendly and, consequently, fast way to scan an image, most commonly used chain-code algorithms perform contours tracing, and therefore tend to be fairly inefficient. In this paper, we took a rarely used algorithm that extracts contours in raster scan, and optimized its execution time through template functions, look-up tables and decision trees, in order to reduce code branches and the average number of load/store operations required. The result is a very fast solution that outspeeds the state-of-the-art contours extraction algorithm implemented in OpenCV, on a collection of real case datasets. Contribution-This paper significantly improves the performance of existing chain-code algorithms, by smartly introducing decision trees to reduce code branches and the average number of load/store operations required.

关键词： Chain-Code Contours Extraction Decision Trees algorithms optimization

来源：评论

学校读者我要写书评

暂无评论

A parameterized shared-memory scheme for parameterized metaheuristics

A parameterized shared-memory scheme for parameterized metah...

引用

2nd Mini-Symposium on High Performance Computing (HPC) Applied to Computational Problems in Science and Engineering/10th International Conference on Computational and Mathematical Methods in Science and Engineering

关键词： Parallel metaheuristics Shared-memory Parameterized algorithms algorithms optimization

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：