|
|
|
|
|
Tibor Szkaliczki
eHealth services require continuous data streaming and a stable level of quality of service. However, wireless network connections can be characterized by variable bandwidths. This requires continuous adaptation of systems, including adapting the bit rat...
ver más
|
|
|
|
|
|
|
|
|
|
|
Stephen A. Adubi, Olufunke O. Oladipupo and Oludayo O. Olugbara
Hyper-heuristics are widely used for solving numerous complex computational search problems because of their intrinsic capability to generalize across problem domains. The fair-share iterated local search is one of the most successful hyper-heuristics fo...
ver más
|
|
|
|
|
|
|
|
|
|
|
Patcharin Buayen and Jeeraporn Werapun
The multiple knapsack problem (0/1-mKP) is a valuable NP-hard problem involved in many science-and-engineering applications. In current research, there exist two main approaches: 1. the exact algorithms for the optimal solutions (i.e., branch-and-bound, ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Fekhr Eddine Keddous and Amir Nakib
Convolutional neural networks (CNNs) have powerful representation learning capabilities by automatically learning and extracting features directly from inputs. In classification applications, CNN models are typically composed of: convolutional layers, po...
ver más
|
|
|
|
|
|
|
|
|
|
|
Rafet Durgut, Mehmet Emin Aydin and Abdur Rakib
In the past two decades, metaheuristic optimisation algorithms (MOAs) have been increasingly popular, particularly in logistic, science, and engineering problems. The fundamental characteristics of such algorithms are that they are dependent on a paramet...
ver más
|
|
|
|
|
|
|
|
|
|
|
Jean Ruppert, Marharyta Aleksandrova and Thomas Engel
Deterioration of the searchability of Pareto dominance-based, many-objective evolutionary optimization algorithms is a well-known problem. Alternative solutions, such as scalarization-based and indicator-based approaches, have been proposed in the litera...
ver más
|
|
|
|
|
|
|
|
|
|
|
Elias Munapo
Pág. 59 - 69
The paper presents a new reformulation approach to reduce the complexity of a branch and bound algorithm for solving the knapsack linear integer problem. The branch and bound algorithm in general relies on the usual strategy of first relaxing the integer...
ver más
|
|
|
|
|
|
|
|
|
|
|
Aleksandr Moshnikov and Vladimir Bogatyrev
This article is devoted to an approach to develop a safety system process according to functional safety standards. With the development of technologies and increasing the specific energy stored in the equipment, the issue of safety during operation beco...
ver más
|
|
|
|
|
|
|
|
|
|
|
Yuan Ping, Baocang Wang, Shengli Tian, Jingxian Zhou and Hui Ma
By introducing an easy knapsack-type problem, a probabilistic knapsack-type public key cryptosystem (PKCHD) is proposed. It uses a Chinese remainder theorem to disguise the easy knapsack sequence. Thence, to recover the trapdoor information, the implicit...
ver más
|
|
|
|
|
|
|
|
|
|
|
Jason Deane, Anurag Agarwal
The multi-dimensional knapsack problem (MDKP) is a well-studied problem in Decision Sciences. The problems NP-Hard nature prevents the successful application of exact procedures such as branch and bound, implicit enumeration and dynamic programming for l...
ver más
|
|
|
|
|
|