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

Genetic and Evolutionary Computation Conference (GECCO)

作者： El Majdouli, Mohamed Amine MOHAMMED V Univ Rabat Fac Sci Concept & Syst Lab Rabat Morocco

ISBN: (纸本)9781450367486

per-instance algorithm selection and Automatic algorithm Configuration have recently gained important interests. However, these approaches face many limitations. For instance, the performance of these methods is deeply influenced by factors like the accuracy of the underlying prediction model, features space correlation, incomplete performance space for new instances, instances sampling and many others. In this paper, an effort to address such limitations is described. Indeed, we propose a cooperative architecture, labeled as the "SAPIAS" concept, composed of a self-adaptive online algorithm selection system and an offline Automatic algorithm Configuration system, working together in order to deliver the most accurate performance. Additionally, SAPIAS is proposed as a methodic concept that the metaheuristics community might adopt to fill in the gap between theory and practice in the field, by providing for theoreticians the ability to continuously analyze the evolution of the problems characteristics and the behavior of the solving techniques as well as providing a ready to use solving framework for practitioners.

关键词： per-instance algorithm selection Automatic algorithm Configuration Metaheuristics

来源：评论

学校读者我要写书评

暂无评论

An Isomorphism-Invariant Distance Function on Propositional Formulas in CNF

引用

Journal on Satisfiability, Boolean Modeling and Computation 2023年第1期14卷 1-15页

作者： Dantsin, Evgeny Wolpert, Alexander Department of Computer Science Roosevelt University IL USA

We define a distance function on propositional formulas in CNF as a measure of non-isomorphism of formulas: the larger the distance between two formulas is, the further they are from being isomorphic. This distance induces a metric on isomorphism classes of formulas. We show how this distance can be used for SAT solving, namely for per-instance algorithm selection where there is a “portfolio” of SAT solvers and there is a “meta-solver” that chooses a solver from the portfolio for a given input formula.

关键词： Distance on CNF formulas isomorphism invariants per-instance algorithm selection

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：