Results 41 to 50 of about 53,710 (343)
Quality-Of-Control-Aware Scheduling of Communication in TSN-Based Fog Computing Platforms Using Constraint Programming [PDF]
, 2020 In this paper we are interested in real-time control applications that are implemented using Fog Computing Platforms consisting of interconnected heterogeneous Fog Nodes (FNs).
Barzegaran, Mohammadreza +2 more
core +1 more source
Nonparametric Comparison of Two Dynamic Parameter Setting Methods in a Meta-Heuristic Approach [PDF]
Journal of Systemics, Cybernetics and Informatics, 2007 Meta-heuristics are commonly used to solve combinatorial problems in practice. Many approaches provide very good quality solutions in a short amount of computational time; however most meta-heuristics use parameters to tune the performance of the meta ...
Seyhun HEPDOGAN +3 more
doaj
Aerospace, 2021 This paper presents the application of an active energy management strategy to a hybrid system consisting of a proton exchange membrane fuel cell (PEMFC), battery, and supercapacitor.
Hasan Çınar, Ilyas Kandemir
doaj +1 more source
Investigating Evaluation Measures in Ant Colony Algorithms for Learning Decision Tree Classifiers [PDF]
, 2015 Ant-Tree-Miner is a decision tree induction algorithm that is based on the Ant Colony Optimization (ACO) meta- heuristic. Ant-Tree-Miner-M is a recently introduced extension of Ant-Tree-Miner that learns multi-tree classification models.
Abdelbar, Ashraf M. +2 more
core +1 more source
Hybrid meta-heuristics for combinatorial optimization [PDF]
Constraints, 2015 Combinatorial optimization problems arise, in many forms, in various aspects of everyday life. Nowadays, a lot of services are driven by optimization algorithms, enabling us to make the best use of the available resources while guaranteeing a level of service. Examples of such services are public transportation, goods delivery, university time-tabling,
openaire +1 more source
Algorithms, 2021 This paper describes a unique meta-heuristic technique for hybridizing bio-inspired heuristic algorithms. The technique is based on altering the state of agents using a logistic probability function that is dependent on an agent’s fitness rank.
Robertas Damaševičius +1 more
doaj +1 more source
An Ant Colony based Hyper-Heuristic Approach for the Set Covering Problem
Advances in Distributed Computing and Artificial Intelligence Journal, 2015 The Set Covering Problem (SCP) is a NP-hard combinatorial optimization problem that is challenging for meta-heuristic algorithms. In the optimization literature, several approaches using meta-heuristics have been developed to tackle the SCP and the ...
Alexandre Silvestre FERREIRA +2 more
doaj +1 more source
The probabilistic heuristic in local (PHIL) search meta-strategy [PDF]
, 2005 Local search, in either best or first admissible form, generally suffers from poor solution qualities as search cannot be continued beyond locally optimal points. Even multiple start local search strategies can suffer this problem.
A. Ernst +10 more
core +1 more source
A Lightweight Procedural Layer for Hybrid Experimental–Computational Workflows in Materials Science
Advanced Engineering Materials, EarlyView.We unveil a prototype hybrid‐workflow framework that fuses automatedcomputation with hands‐on experiments. Built atop pyiron, a lightweight, parameterized layer translates procedure descriptions into executable manual steps, syncing instrument settings, human interventions, and data capture in real‐time today.
Steffen Brinckmann +8 more
wiley +1 more source
Engineering ProceedingsThe Vehicle Routing Problem (VRP) is related to determining the route of several vehicles to distribute goods to customers efficiently and minimize transportation costs or optimize other objective functions.
Wayan Firdaus Mahmudy +2 more
doaj +1 more source