找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Advanced Computational Methods for Knowledge Engineering; Proceedings of the 6 Hoai An Le Thi,Hoai Minh Le,Ngoc Thanh Nguyen Conference pro

[复制链接]
楼主: 遮蔽
发表于 2025-3-23 11:26:56 | 显示全部楼层
https://doi.org/10.1007/978-3-662-26636-6pted distance is proposed for discrete space exploration of a derivative-free optimization method. The results obtained with this method on a simplified industrial application are compared with results of state-of-the-art black-box optimization methods.
发表于 2025-3-23 15:12:11 | 显示全部楼层
https://doi.org/10.1007/978-3-662-26633-5erage values of the following and previous sub-sequence of the most similar values. Experimental results on three datasets show that our approach outperforms than seven related methods in case of time series having effective information.
发表于 2025-3-23 19:11:50 | 显示全部楼层
发表于 2025-3-24 01:53:01 | 显示全部楼层
Conference proceedings 2020s and Applications; and Knowledge Information and Engineering Systems. Researchers and practitioners in related areas will find a wealth of inspiring ideas and useful tools & techniques for their own work. .
发表于 2025-3-24 02:30:17 | 显示全部楼层
发表于 2025-3-24 09:56:54 | 显示全部楼层
发表于 2025-3-24 12:33:42 | 显示全部楼层
发表于 2025-3-24 17:06:09 | 显示全部楼层
Beitrag zur Histologie der Zahnwurzelcysten,ness. The original mathematical model is a multi-objective optimization problem with binary integer variables. It is then transformed to a single objective optimization problem. One may use a commercial software to solve such problem but the computation time is expensive especially in large scale pr
发表于 2025-3-24 20:21:05 | 显示全部楼层
Hans-Ernst Schwiete,Wolfram Roth The mathematical model given by Lu, Gupte, Huang [.] is a mixed integer non linear optimization problem. Existing solution methods are complicated and their computing time is long. Hence, it is necessary to develop efficient solution methods for the considered model. Our approach is based on DC (di
发表于 2025-3-25 01:51:47 | 显示全部楼层
Hans-Ernst Schwiete,Wolfram Rothotal travel time of trains in a single track railways network. The model can be written in the form of a mixed 0–1 linear program which has the worst case exponential complexity to calculate the optimal solution. In this paper, we propose a computationally efficient approach to solve the train sched
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-9 09:00
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表