Cirrhosis
发表于 2025-3-23 12:46:55
0302-9743 ynamic optimization, multi-objective, max-clique problems, bayesian optimization and global optimization, data mining and - in a special session - also on dynamic optimization..978-3-319-19083-9978-3-319-19084-6Series ISSN 0302-9743 Series E-ISSN 1611-3349
没血色
发表于 2025-3-23 17:33:51
http://reply.papertrans.cn/59/5829/582896/582896_12.png
没有贫穷
发表于 2025-3-23 20:42:31
http://reply.papertrans.cn/59/5829/582896/582896_13.png
ALE
发表于 2025-3-24 02:11:38
Empirical Analysis of Operators for Permutation Based Problems,oach allows us to define a simple generic hyperheuristic that adapt the choice of its operators to the problem at hand and that manages their use in order to ensure a good trade-off between intensification and diversification. Moreover this hyperheuristic can be used on different permutation-based problems.
Paradox
发表于 2025-3-24 03:29:45
Fitness Landscape of the Factoradic Representation on the Permutation Flowshop Scheduling Problem,th the classic permutation representation establishes that local moves on the factoradic representation are less able to lead to the global optima on the PFSP. The study ends by presenting directions for using and improving the factoradic representation.
photophobia
发表于 2025-3-24 10:01:50
Identifying Best Hyperparameters for Deep Architectures Using Random Forests,f deep architectures with respect to hyperparameter variants and to explore underlying interactions of hyperparameters. This is a general method suitable for all types of deep architecture. Our approach is tested by using deep belief network: the error rate reduced from . to . by merely replacing three hyperparameter values.
表两个
发表于 2025-3-24 11:12:41
Programming by Optimisation Meets Parameterised Algorithmics: A Case Study for Cluster Editing,lly most effective preprocessing algorithm, which yields a 2.-vertex kernel. Notably, this 2.-vertex kernel is analysed empirically for the first time here. Our new algorithm was developed by integrating Programming by Optimisation into the classical algorithm engineering cycle – an approach which we expect to be successful in many other contexts.
北极人
发表于 2025-3-24 17:42:21
http://reply.papertrans.cn/59/5829/582896/582896_18.png
节约
发表于 2025-3-24 19:56:15
Improving the State of the Art in Inexact TSP Solving Using Per-Instance Algorithm Selection,rovements in practice. Our selectors represent a significant improvement in the state-of-the-art in inexact TSP solving, and hence in the ability to find optimal solutions (without proof of optimality) for challenging TSP instances in practice.
Cholesterol
发表于 2025-3-25 01:53:02
Conference proceedings 2015hich was held in Lille, France, in January 2015..The 31 contributions presented were carefully reviewed and selected for inclusion in this book. The papers address all fields between machine learning, artificial intelligence, mathematical programming and algorithms for hard optimization problems. Sp