Results 21 to 30 of about 417,011 (184)
Complexity, 2023 In this paper, a binary variant of a novel nature-inspired metaheuristic algorithm called the nutcracker optimization algorithm (NOA) is presented for binary optimization problems.
Mohamed Abdel-Basset +3 more
doaj +1 more source
Discrete Data Rate Adaptation for Wireless Body Area Networks
Applied Sciences, 2023 eHealth services require continuous data streaming and a stable level of quality of service. However, wireless network connections can be characterized by variable bandwidths.
Tibor Szkaliczki
doaj +1 more source
A library for continuous convex separable quadratic knapsack problems [PDF]
European Journal of Operational Research, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
FRANGIONI, ANTONIO, E. Gorgone
openaire +4 more sources
IEEE Access, 2019 The 0-1 knapsack problem is a typical discrete combinatorial optimization problem with numerous applications. In this paper, a binary multi-scale quantum harmonic oscillator algorithm (BMQHOA) with genetic operator is proposed for solving 0-1 knapsack ...
Yan Huang +4 more
doaj +1 more source
Flexible Wolf Pack Algorithm for Dynamic Multidimensional Knapsack Problems
Research, 2020 Optimization problems especially in a dynamic environment is a hot research area that has attracted notable attention in the past decades. It is clear from the dynamic optimization literatures that most of the efforts have been devoted to continuous ...
Husheng Wu, Renbin Xiao
doaj +1 more source
BQIABC: A new Quantum-Inspired Artificial Bee Colony Algorithm for Binary Optimization Problems [PDF]
Journal of Artificial Intelligence and Data Mining, 2018 Artificial bee colony (ABC) algorithm is a swarm intelligence optimization algorithm inspired by the intelligent behavior of honey bees when searching for food sources.
F. Barani, H. Nezamabadi-pour
doaj +1 more source
Mathematics, 2022 Population-based approaches have given us new search strategies and ideas in order to solve optimization problems. Usually, these methods are based on the performance carried out by a finite number of agents, which by the interaction between them they ...
Emanuel Vega +5 more
doaj +1 more source
Amplitude Angle Modulated Bat Algorithm With Application to Zero-One Knapsack Problem
IEEE Access, 2019 Angle-modulated bat algorithm (AMBA) provides a technique that enables the bat algorithm (BA) developed for continuous problems to operate in binary spaces, which employs an angle modulation technique to generate a bit string corresponding to a binary ...
Xingwang Huang, Peijia Li, Yunming Pu
doaj +1 more source
Binary Honey Badger Algorithm for 0-1 Knapsack Problem
Journal of Intelligent Systems, 2023 Honey Badger Algorithm (HBA) is one of the recently proposed optimization techniques inspired by the foraging behavior of honey badger. Although it has been successfully applied in solving continuous problems, the algorithm cannot be implemented directly
Gülşen Orucova Büyüköz +1 more
semanticscholar +1 more source
Throughput Maximization in the Speed-Scaling Setting [PDF]
, 2013 We are given a set of $n$ jobs and a single processor that can vary its speed dynamically. Each job $J_j$ is characterized by its processing requirement (work) $p_j$, its release date $r_j$ and its deadline $d_j$. We are also given a budget of energy $E$
Angel, Eric +2 more
core +4 more sources