发布求助
文献互助 智能选刊 最新文献

International Conferences on Optimization and Learning最新文献

筛选
英文 中文
Real-time elastic partial shape matching using a neural network-based adjoint method 基于神经网络的实时弹性部分形状匹配方法
International Conferences on Optimization and Learning Pub Date : 2023-03-16 DOI: 10.48550/arXiv.2303.09343
Alban Odot, G. Mestdagh, Y. Privat, S. Cotin
{"title":"Real-time elastic partial shape matching using a neural network-based adjoint method","authors":"Alban Odot, G. Mestdagh, Y. Privat, S. Cotin","doi":"10.48550/arXiv.2303.09343","DOIUrl":"https://doi.org/10.48550/arXiv.2303.09343","url":null,"abstract":"Surface matching usually provides significant deformations that can lead to structural failure due to the lack of physical policy. In this context, partial surface matching of non-linear deformable bodies is crucial in engineering to govern structure deformations. In this article, we propose to formulate the registration problem as an optimal control problem using an artificial neural network where the unknown is the surface force distribution that applies to the object and the resulting deformation computed using a hyper-elastic model. The optimization problem is solved using an adjoint method where the hyper-elastic problem is solved using the feed-forward neural network and the adjoint problem is obtained through the backpropagation of the network. Our process improves the computation speed by multiple orders of magnitude while providing acceptable registration errors.","PeriodicalId":146403,"journal":{"name":"International Conferences on Optimization and Learning","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126708807","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Graph Reinforcement Learning for Operator Selection in the ALNS Metaheuristic ALNS元启发式算子选择的图强化学习
International Conferences on Optimization and Learning Pub Date : 2023-02-28 DOI: 10.48550/arXiv.2302.14678
Syu-Ning Johnn, Victor-Alexandru Darvariu, J. Handl, Joerg Kalcsics
{"title":"Graph Reinforcement Learning for Operator Selection in the ALNS Metaheuristic","authors":"Syu-Ning Johnn, Victor-Alexandru Darvariu, J. Handl, Joerg Kalcsics","doi":"10.48550/arXiv.2302.14678","DOIUrl":"https://doi.org/10.48550/arXiv.2302.14678","url":null,"abstract":"ALNS is a popular metaheuristic with renowned efficiency in solving combinatorial optimisation problems. However, despite 16 years of intensive research into ALNS, whether the embedded adaptive layer can efficiently select operators to improve the incumbent remains an open question. In this work, we formulate the choice of operators as a Markov Decision Process, and propose a practical approach based on Deep Reinforcement Learning and Graph Neural Networks. The results show that our proposed method achieves better performance than the classic ALNS adaptive layer due to the choice of operator being conditioned on the current solution. We also discuss important considerations such as the size of the operator portfolio and the impact of the choice of operator scales. Notably, our approach can also save significant time and labour costs for handcrafting problem-specific operator portfolios.","PeriodicalId":146403,"journal":{"name":"International Conferences on Optimization and Learning","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130382602","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Partial k-means to avoid outliers, mathematical programming formulations, complexity results 偏k均值避免离群值，数学规划公式，复杂性结果
International Conferences on Optimization and Learning Pub Date : 2023-02-11 DOI: 10.1007/978-3-031-34020-8_22
N. Dupin, F. Nielsen
{"title":"Partial k-means to avoid outliers, mathematical programming formulations, complexity results","authors":"N. Dupin, F. Nielsen","doi":"10.1007/978-3-031-34020-8_22","DOIUrl":"https://doi.org/10.1007/978-3-031-34020-8_22","url":null,"abstract":"","PeriodicalId":146403,"journal":{"name":"International Conferences on Optimization and Learning","volume":"246 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132028785","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Improved SAT models for NFA learning 改进的SAT模型用于NFA学习
International Conferences on Optimization and Learning Pub Date : 2021-07-13 DOI: 10.1007/978-3-030-85672-4_20
F. Lardeux, É. Monfroy
{"title":"Improved SAT models for NFA learning","authors":"F. Lardeux, É. Monfroy","doi":"10.1007/978-3-030-85672-4_20","DOIUrl":"https://doi.org/10.1007/978-3-030-85672-4_20","url":null,"abstract":"","PeriodicalId":146403,"journal":{"name":"International Conferences on Optimization and Learning","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132721369","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Automatic Synthesis of Boolean Networks from Biological Knowledge and Data 基于生物知识和数据的布尔网络自动合成
International Conferences on Optimization and Learning Pub Date : 2021-06-23 DOI: 10.1007/978-3-030-85672-4_12
Athénaïs Vaginay, T. Boukhobza, Malika Smaïl-Tabbone
{"title":"Automatic Synthesis of Boolean Networks from Biological Knowledge and Data","authors":"Athénaïs Vaginay, T. Boukhobza, Malika Smaïl-Tabbone","doi":"10.1007/978-3-030-85672-4_12","DOIUrl":"https://doi.org/10.1007/978-3-030-85672-4_12","url":null,"abstract":"","PeriodicalId":146403,"journal":{"name":"International Conferences on Optimization and Learning","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123697590","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
An Application of BnB-NSGAII: Initializing NSGAII to Solve 3 Stage Reducer Problem BnB-NSGAII的应用:初始化NSGAII求解三级减速器问题
International Conferences on Optimization and Learning Pub Date : 2021-05-14 DOI: 10.1007/978-3-030-85672-4_25
A. Jaber, Pascal Lafon, R. Younes
{"title":"An Application of BnB-NSGAII: Initializing NSGAII to Solve 3 Stage Reducer Problem","authors":"A. Jaber, Pascal Lafon, R. Younes","doi":"10.1007/978-3-030-85672-4_25","DOIUrl":"https://doi.org/10.1007/978-3-030-85672-4_25","url":null,"abstract":"","PeriodicalId":146403,"journal":{"name":"International Conferences on Optimization and Learning","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124387335","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Automatic Structural Search for Multi-task Learning VALPs 多任务学习valp的自动结构搜索
International Conferences on Optimization and Learning Pub Date : 2020-02-17 DOI: 10.1007/978-3-030-41913-4_3
Unai Garciarena, A. Mendiburu, Roberto Santana
{"title":"Automatic Structural Search for Multi-task Learning VALPs","authors":"Unai Garciarena, A. Mendiburu, Roberto Santana","doi":"10.1007/978-3-030-41913-4_3","DOIUrl":"https://doi.org/10.1007/978-3-030-41913-4_3","url":null,"abstract":"","PeriodicalId":146403,"journal":{"name":"International Conferences on Optimization and Learning","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116735889","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Designing a Flexible Evaluation of Container Loading Using Physics Simulation 基于物理仿真的集装箱装载柔性评估设计
International Conferences on Optimization and Learning Pub Date : 2020-02-17 DOI: 10.1007/978-3-030-41913-4_21
Shuhei Nishiyama, Chonho Lee, T. Mashita
{"title":"Designing a Flexible Evaluation of Container Loading Using Physics Simulation","authors":"Shuhei Nishiyama, Chonho Lee, T. Mashita","doi":"10.1007/978-3-030-41913-4_21","DOIUrl":"https://doi.org/10.1007/978-3-030-41913-4_21","url":null,"abstract":"","PeriodicalId":146403,"journal":{"name":"International Conferences on Optimization and Learning","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121973856","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A Heuristic Algorithm for the Set k-Cover Problem 集k-覆盖问题的一种启发式算法
International Conferences on Optimization and Learning Pub Date : 2020-02-17 DOI: 10.1007/978-3-030-41913-4_9
A. Salehipour
{"title":"A Heuristic Algorithm for the Set k-Cover Problem","authors":"A. Salehipour","doi":"10.1007/978-3-030-41913-4_9","DOIUrl":"https://doi.org/10.1007/978-3-030-41913-4_9","url":null,"abstract":"","PeriodicalId":146403,"journal":{"name":"International Conferences on Optimization and Learning","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116884796","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Checking the Difficulty of Evolutionary-Generated Maps in a N-Body Inspired Mobile Game 基于n体的手机游戏中进化生成地图的难度检验
International Conferences on Optimization and Learning Pub Date : 2020-02-17 DOI: 10.1007/978-3-030-41913-4_17
Carlos López-Rodríguez, Antonio J. Fernández, R. Lara-Cabrera, A. García, P. García-Sánchez
{"title":"Checking the Difficulty of Evolutionary-Generated Maps in a N-Body Inspired Mobile Game","authors":"Carlos López-Rodríguez, Antonio J. Fernández, R. Lara-Cabrera, A. García, P. García-Sánchez","doi":"10.1007/978-3-030-41913-4_17","DOIUrl":"https://doi.org/10.1007/978-3-030-41913-4_17","url":null,"abstract":"","PeriodicalId":146403,"journal":{"name":"International Conferences on Optimization and Learning","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132314245","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信