Results 51 to 60 of about 33,818 (220)
Construction of Generating Feasible Subsets in the Knapsack Problem
Доклады Белорусского государственного университета информатики и радиоэлектроникиA method for constructing a group of generating feasible subsets in the knapsack problem under the condition that the non-dominance depth of a given Pareto layer is greater than zero is developed.
S. V. Chebakov, L. V. Serebryanaya
doaj +1 more source
Small Extended Formulation for Knapsack Cover Inequalities from Monotone Circuits
, 2016 Initially developed for the min-knapsack problem, the knapsack cover inequalities are used in the current best relaxations for numerous combinatorial optimization problems of covering type.
Bazzi, Abbas +3 more
core +1 more source
Journal of Field Robotics, EarlyView.ABSTRACT This work presents a non‐geometrical navigation approach based on a purely topological understanding of underground environments. By conceptualizing subterranean scenarios as a set of tunnels that intersect with each other, and taking a navigation approach based on topological instructions, we simplify the navigation problem to the sequential ...
Lorenzo Cano +2 more
wiley +1 more source
A Novel Genetic Algorithm using Helper Objectives for the 0-1 Knapsack Problem [PDF]
, 2014 The 0-1 knapsack problem is a well-known combinatorial optimisation problem. Approximation algorithms have been designed for solving it and they return provably good solutions within polynomial time.
Dong, Hongbin, He, Feidun, He, Jun
core
Inkjet‐Printed Physical Unclonable Functions For Secure Authentication
Small, EarlyView.Herein, we propose a low‐cost authentication system based on a scalable fabrication technology and user friendly recognition system. It involves inkjet printing as a manufacturing method and an optical recognition system based on contour features extraction.
Riccardo Sargeni +5 more
wiley +1 more source
Online Minimization Knapsack Problem
Theoretical Computer Science, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xin Han, Kazuhisa Makino
openaire +2 more sources
Evolution of Knapsack Ciphersystems
Безопасность информационных технологий, 2015 The knapsack problem is known to be used in numerous public key ciphersystems designs. These ciphersystems have been receiving increased attention from analytics, resulting in many being compromised.
Georgii Ivanovich Borzunov +1 more
doaj
Computational Enhancement in the Application of the Branch and Bound Method for Linear Integer Programs and Related Models [PDF]
International Journal of Mathematical, Engineering and Management Sciences, 2019 In this paper, a reformulation that was proposed for a knapsack problem has been extended to single and bi-objective linear integer programs. A further reformulation by adding an upper bound constraint for a knapsack problem is also proposed and extended
Masar Al-Rabeeah +4 more
doaj +1 more source
Improvement of the ergonomical structure of Knapsack sprayer to propel cart sprayer (PCS) [PDF]
, 2020 A sprayer is a device used to spray a liquid projection mostly used in agriculture crop used to apply such as pesticides. The sprayer’s usage are based on the type of the background of the farmers scale in agriculture. Large scale of farmers will use the
Ahamad Azahari, Ahmad Syakir +3 more
core
CAAI Transactions on Intelligence Technology, EarlyView.ABSTRACT Networked control systems (NCSs) often suffer from performance degradation due to limited communication bandwidth, which can cause data transmission conflicts and packet loss. Existing scheduling strategies may fail to simultaneously meet the real‐time requirements and the importance of multisensor data, and they are particularly vulnerable ...
Da Chen +5 more
wiley +1 more source