求解约束满足问题的枚举策略动态选择的选择函数

2009 International Conference of Soft Computing and Pattern Recognition Pub Date : 2009-12-04 DOI:10.1109/SoCPaR.2009.54

Broderick Crawford, Mauricio Montecinos, Carlos Castro, É. Monfroy

{"title":"求解约束满足问题的枚举策略动态选择的选择函数","authors":"Broderick Crawford, Mauricio Montecinos, Carlos Castro, É. Monfroy","doi":"10.1109/SoCPaR.2009.54","DOIUrl":null,"url":null,"abstract":"In this work we exploit search process features to dynamically adapt a Constraint Programming solver in order to more efficiently solve Constraint Satisfaction Problems. The main novelty of our approach is that we reconfigure the searching or search process based solely on performance data gathered while solving the current problem. We report encouraging results where our combination of strategies outperforms the use of individual strategies","PeriodicalId":284743,"journal":{"name":"2009 International Conference of Soft Computing and Pattern Recognition","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Choice Function to Dynamic Selection of Enumeration Strategies Solving Constraint Satisfaction Problems\",\"authors\":\"Broderick Crawford, Mauricio Montecinos, Carlos Castro, É. Monfroy\",\"doi\":\"10.1109/SoCPaR.2009.54\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this work we exploit search process features to dynamically adapt a Constraint Programming solver in order to more efficiently solve Constraint Satisfaction Problems. The main novelty of our approach is that we reconfigure the searching or search process based solely on performance data gathered while solving the current problem. We report encouraging results where our combination of strategies outperforms the use of individual strategies\",\"PeriodicalId\":284743,\"journal\":{\"name\":\"2009 International Conference of Soft Computing and Pattern Recognition\",\"volume\":\"34 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-12-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 International Conference of Soft Computing and Pattern Recognition\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SoCPaR.2009.54\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Conference of Soft Computing and Pattern Recognition","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SoCPaR.2009.54","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

在这项工作中，我们利用搜索过程特征来动态适应约束规划求解器，以更有效地解决约束满足问题。我们的方法的主要新颖之处在于，我们仅根据在解决当前问题时收集的性能数据重新配置搜索或搜索过程。我们报告了令人鼓舞的结果，我们的组合策略优于使用单个策略

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A Choice Function to Dynamic Selection of Enumeration Strategies Solving Constraint Satisfaction Problems

In this work we exploit search process features to dynamically adapt a Constraint Programming solver in order to more efficiently solve Constraint Satisfaction Problems. The main novelty of our approach is that we reconfigure the searching or search process based solely on performance data gathered while solving the current problem. We report encouraging results where our combination of strategies outperforms the use of individual strategies

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2009 International Conference of Soft Computing and Pattern Recognition

自引率

0.00%

发文量