標題: Titlebook: Learning and Intelligent Optimization; 9th International Co Clarisse Dhaenens,Laetitia Jourdan,Marie-Eléonore Conference proceedings 2015 [打印本頁] 作者: Enclosure 時間: 2025-3-21 17:57
書目名稱Learning and Intelligent Optimization影響因子(影響力)
書目名稱Learning and Intelligent Optimization影響因子(影響力)學科排名
書目名稱Learning and Intelligent Optimization網(wǎng)絡(luò)公開度
書目名稱Learning and Intelligent Optimization網(wǎng)絡(luò)公開度學科排名
書目名稱Learning and Intelligent Optimization被引頻次
書目名稱Learning and Intelligent Optimization被引頻次學科排名
書目名稱Learning and Intelligent Optimization年度引用
書目名稱Learning and Intelligent Optimization年度引用學科排名
書目名稱Learning and Intelligent Optimization讀者反饋
書目名稱Learning and Intelligent Optimization讀者反饋學科排名
作者: 駕駛 時間: 2025-3-21 21:53 作者: IST 時間: 2025-3-22 03:34 作者: Overstate 時間: 2025-3-22 06:47 作者: 裝入膠囊 時間: 2025-3-22 11:17
,Dynamic Service Selection with Optimal Stopping and ‘Trivial Choice’,Two different strategies for searching a best-available service in adaptive, open software systems are simulated. The practical advantage of the theoretically optimal strategy is confirmed over a ‘trivial choice’ approach, however the advantage was only small in the simulation.作者: Antecedent 時間: 2025-3-22 16:20 作者: ARBOR 時間: 2025-3-22 19:58
https://doi.org/10.1007/978-3-319-19084-6Algorithm construction; Answer set programming; Bio-inspired approaches; Bio-inspired optimization; Clas作者: Cardiac 時間: 2025-3-22 23:35
Learning a Hidden Markov Model-Based Hyper-heuristic,ng useful mutation heuristics. Empirical evidence supports this on the ., ., . and . problems. A new approach to hyper-heuristics is proposed that addresses this problem by modeling and learning hyper-heuristics by means of a hidden Markov Model. Experiments show that this is a feasible and promising approach.作者: ALLAY 時間: 2025-3-23 03:52
Exploring Non-neutral Landscapes with Neutrality-Based Local Search,tion. Some experiments on NK landscapes show that an adaptive discretization is useful to reach high local optima and to launch diversifications automatically. We believe that a hill-climbing using such an adaptive evaluation function could be more appropriated than a classical iterated local search mechanism.作者: 使熄滅 時間: 2025-3-23 06:32
A Biased Random-Key Genetic Algorithm for the Multiple Knapsack Assignment Problem,em. The MKAP is a hard problem even for small-sized instances. In this paper, we propose an approximate approach for the MKAP based on a biased random key genetic algorithm. Our solution approach exhibits competitive performance when compared to the best approximate approach reported in the literature.作者: Cirrhosis 時間: 2025-3-23 12:46
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 作者: 沒有貧窮 時間: 2025-3-23 20:42 作者: ALE 時間: 2025-3-24 02:11
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
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
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
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 作者: 節(jié)約 時間: 2025-3-24 19:56
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
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作者: osteopath 時間: 2025-3-25 05:03 作者: 污點 時間: 2025-3-25 09:10 作者: 擴張 時間: 2025-3-25 11:49 作者: TRACE 時間: 2025-3-25 16:36
Minimizing Total Tardiness on Identical Parallel Machines Using VNS with Learning Memory, learning mechanism for guiding the search. Computational results comparing with the best approaches for this problem reveals that our algorithm is a suitable alternative to efficiently solve this problem.作者: 鉗子 時間: 2025-3-25 23:48
A Selector Operator-Based Adaptive Large Neighborhood Search for the Covering Tour Problem,presents a solution procedure based on a . operator that allows to convert a giant tour into an optimal CTP solution. This operator is embedded in an adaptive large neighborhood search. The method is competitive as shown by the quality of results evaluated using the output of a state-of-the-art exact algorithm.作者: Monolithic 時間: 2025-3-26 02:27
Conference proceedings 2015ecial focus is given to algorithm selection and configuration, learning, fitness landscape, applications, dynamic optimization, multi-objective, max-clique problems, bayesian optimization and global optimization, data mining and - in a special session - also on dynamic optimization..作者: ALOFT 時間: 2025-3-26 08:02
y IT strategy. It also considers the distinction from digitalisation and digitalisation strategies and contains additional explanations on agile methods, DevOps as well as bi-modal IT structures. As a result, t978-3-658-38774-7978-3-658-38772-3作者: 草率男 時間: 2025-3-26 12:03 作者: 白楊 時間: 2025-3-26 14:38 作者: 啜泣 時間: 2025-3-26 18:09
Martin Drozdik,Hernan Aguirre,Youhei Akimoto,Kiyoshi Tanaka作者: AGONY 時間: 2025-3-26 23:00
M. Lindauer,H. Hoos,F. Hutter focuses on manufacturing companies in order to take into account the industry focus of any IT strategy. It also considers the distinction from digitalisation and digitalisation strategies and contains additional explanations on agile methods, DevOps as well as bi-modal IT structures. As a result, t作者: beta-cells 時間: 2025-3-27 02:06
Mustafa M?s?r,Stephanus Daniel Handoko,Hoong Chuin Lauearning through a process of discussion were impressive and gave me insight into a few aspects of the concept formally known as “cooperative learning,” which defines the process of learning together rather than being passive individual receivers of knowledge (e.g., teacher lecturing and students hea作者: Incisor 時間: 2025-3-27 06:56 作者: Genome 時間: 2025-3-27 10:08
Mustafa M?s?r,Stephanus Daniel Handoko,Hoong Chuin Lauts more quickly, all the while employing less resources. The effect of these initiatives at the organisational level was a rationalisation of the production process and a simplification of the work with a view to reducing the unit costs of production. A further effect related to the dimensions of th作者: 鉗子 時間: 2025-3-27 15:22 作者: 除草劑 時間: 2025-3-27 21:33 作者: vector 時間: 2025-3-27 23:59
Pierre Desport,Matthieu Basseur,Adrien Go?ffon,Frédéric Lardeux,Frédéric Saubionurde von Experten des Arbeitskreises CAFM des Deutschen Verbandes für Facility Management e.V. (GEFMA) aus Wissenschaft und Praxis geschrieben...Es wendet sich sowohl an Anwender, Berater, Softwareanbieter, Dienstleister, Lehrende und Studierende als auch Entscheider im Facility Management..978-3-540-35217-4作者: 東西 時間: 2025-3-28 05:48 作者: 破布 時間: 2025-3-28 07:31
Matthieu Basseur,Adrien Go?ffon,Hugo Traversonurde von Experten des Arbeitskreises CAFM des Deutschen Verbandes für Facility Management e.V. (GEFMA) aus Wissenschaft und Praxis geschrieben...Es wendet sich sowohl an Anwender, Berater, Softwareanbieter, Dienstleister, Lehrende und Studierende als auch Entscheider im Facility Management..978-3-540-35217-4作者: FLIC 時間: 2025-3-28 10:40
Leticia Vargas,Nicolas Jozefowiez,Sandra Ulrich Ngueveuurde von Experten des Arbeitskreises CAFM des Deutschen Verbandes für Facility Management e.V. (GEFMA) aus Wissenschaft und Praxis geschrieben...Es wendet sich sowohl an Anwender, Berater, Softwareanbieter, Dienstleister, Lehrende und Studierende als auch Entscheider im Facility Management..978-3-540-35217-4作者: 不適當 時間: 2025-3-28 16:43
Alan Tus,Andrea Rendl,Günther R. Raidlurde von Experten des Arbeitskreises CAFM des Deutschen Verbandes für Facility Management e.V. (GEFMA) aus Wissenschaft und Praxis geschrieben...Es wendet sich sowohl an Anwender, Berater, Softwareanbieter, Dienstleister, Lehrende und Studierende als auch Entscheider im Facility Management..978-3-540-35217-4作者: crease 時間: 2025-3-28 20:30 作者: 紡織品 時間: 2025-3-29 02:29 作者: syncope 時間: 2025-3-29 06:56 作者: 祖先 時間: 2025-3-29 07:52
Genetic Programming, Logic Design and Case-Based Reasoning for Obstacle Avoidance,ecision trees that can be used to control a mobile robot. The enhanced search works faster than a standard GP search while also providing improvements in best and average results. The resulting programs are non-intuitive yet solve difficult obstacle avoidance and exploration tasks using a parsimonio作者: 不確定 時間: 2025-3-29 12:35 作者: Esophagitis 時間: 2025-3-29 17:04 作者: 乞討 時間: 2025-3-29 19:56
An Algorithm Selection Benchmark of the Container Pre-marshalling Problem,oblem from the field of container terminal optimization. Novel features are introduced and then systematically expanded through the recently proposed approach of latent feature analysis. The CPMP benchmark is interesting, as it involves a homogeneous set of parameterized algorithms that nonetheless 作者: META 時間: 2025-3-30 03:26
ADVISER: A Web-Based Algorithm Portfolio Deviser,set of problem instances. Algorithm portfolios have taken on a new and practical meaning today with the wide availability of multi-core processors: from an enterprise perspective, the interest is to make best use of parallel machines within the organization by running different algorithms simultaneo作者: Outspoken 時間: 2025-3-30 06:12 作者: 慢慢沖刷 時間: 2025-3-30 09:43 作者: 向外才掩飾 時間: 2025-3-30 12:24 作者: institute 時間: 2025-3-30 19:43
Learning a Hidden Markov Model-Based Hyper-heuristic,ng useful mutation heuristics. Empirical evidence supports this on the ., ., . and . problems. A new approach to hyper-heuristics is proposed that addresses this problem by modeling and learning hyper-heuristics by means of a hidden Markov Model. Experiments show that this is a feasible and promisin作者: jocular 時間: 2025-3-31 00:20
Comparison of Parameter Control Mechanisms in Multi-objective Differential Evolution,ent on the right choice of parameters. To mitigate this problem, mechanisms have been developed to automatically control the parameters during the algorithm run. These mechanisms are usually a part of a unified DE algorithm, which makes it difficult to compare them in isolation. In this paper, we go作者: 全等 時間: 2025-3-31 04:53 作者: crutch 時間: 2025-3-31 05:37 作者: GOAD 時間: 2025-3-31 10:11
Empirical Analysis of Operators for Permutation Based Problems,ors can be defined by a distance metric that define the neighborhood of the current configuration, and a selector that chooses the next configuration to be explored within this neighborhood. The performance of local search algorithms strongly depends on their ability to efficiently explore and explo作者: 百靈鳥 時間: 2025-3-31 14:42 作者: neologism 時間: 2025-3-31 18:31 作者: myalgia 時間: 2025-4-1 00:27 作者: 偉大 時間: 2025-4-1 02:26
Metaheuristics for the Two-Dimensional Container Pre-Marshalling Problem,ng Problem (PMP) that is crucial in container storage. The 2D-PMP is particularly challenging due to its complex side constraints that are challenging to express and difficult to consider with standard techniques for the PMP. We present three different heuristic approaches for the 2D-PMP. First, we 作者: Immunoglobulin 時間: 2025-4-1 09:35
Improving the State of the Art in Inexact TSP Solving Using Per-Instance Algorithm Selection,t TSP solvers, LKH and EAX. Our comprehensive experiments demonstrate that the solvers exhibit complementary performance across a diverse set of instances, and the potential for improving the state of the art by selecting between them is significant. Using TSP features from the literature as well as作者: 變量 時間: 2025-4-1 11:00 作者: correspondent 時間: 2025-4-1 17:39
rh?hung des Time-to-Market von IT-Organisationen durch effizCreate an IT strategy for your company with this book..In seven consecutive steps, this book presents the development of an IT strategy for manufacturing companies with the possibility of practical implementation using ready-made worksheets
