Results 71 to 80 of about 5,533,689 (197)
Fast Polynomial Time Approximate Solution for 0-1 Knapsack Problem. [PDF]
Comput Intell Neurosci, 2022 Wang Z, Zhang H, Li Y.
europepmc +1 more source
Ibis, EarlyView.With the rapid development of tracking technologies revealing fine‐scale information on animal movements, several methods have been developed to identify nesting behaviour in birds retrospectively. However, some research questions require nesting behaviour to be identified in real time such that nests and/or broods can be visually observed.
Ilsa A. Griebel +7 more
wiley +1 more source
IEEE AccessThe quadratic multiple knapsack problem (QMKP) is a well-studied problem in operations research. This problem involves selecting a subset of items that maximizes the linear and quadratic profit without exceeding a set of capacities for each knapsack ...
Diego Yanez-Oyarce +3 more
doaj +1 more source
International Journal of Applied Linguistics, EarlyView.ABSTRACT This study examines how pre‐service teachers (PSTs) in Hong Kong developed beliefs about translanguaging and how they enacted and negotiated these beliefs during teaching practicums in English‐as‐a‐second‐language (ESL) classrooms. Drawing on reflective diaries and follow‐up interviews with nine PSTs, the study found that PSTs’ beliefs were ...
Hanyun (Icey) Wu
wiley +1 more source
Heuristic approaches for a new variant of the team orienteering problem
International Transactions in Operational Research, EarlyView.Abstract In this paper, we tackle the team orienteering problem (TOP) with service times, mandatory nodes and incompatibilities arising from two real‐world healthcare applications. We propose two heuristic algorithms: a variable neighbourhood descent algorithm and a matheuristic based on a cut separation approach.
Alberto Guastalla +2 more
wiley +1 more source
Enhancing Hyperheuristics for the Knapsack Problem through Fuzzy Logic. [PDF]
Comput Intell Neurosci, 2021 Olivas F +4 more
europepmc +1 more source
International Transactions in Operational Research, EarlyView.Abstract In Tower Defense (TD) games, the objective is to defend a specific point on the game map from mobile units by constructing towers with offensive capabilities. In this work, we focus on Bloons Tower Defense (Bloons TD), one of the earliest and most prominent TD games.
Maxence Delorme, Jakub Malinowski
wiley +1 more source
Resource allocation algorithm for situation awareness based on multiple-choice quadratic knapsack
Tongxin xuebao, 2016 In order to deal with the potential cyber-threat and improve the security situation by using limited resource properly, the optimal allocation of resource focused on cyber security situation.
Yan-wei SUN +3 more
doaj
ANALYSIS AND IMPLEMENTATION OF A CRYPTOSYSTEM BASED ON NON-INJECTIVE KNAPSACKS
Безопасность информационных технологийThe paper explores the properties of non-injective linear forms and their application in knapsack cryptosystems. The primary objective of the study is to analyze the potential of using non-injective knapsacks as private keys to enhance the cryptographic ...
Maria Sabina A. Volkov
doaj +1 more source
Random‐key optimization for 2D irregular packing with reusable area evaluation
International Transactions in Operational Research, EarlyView.Abstract The diverse constraints of industrial applications lead to variants of two‐dimensional (2D) irregular packing problems that require tailored solution methods. This paper addresses a real‐world industrial challenge by proposing a new problem definition, the maximum reusable contiguous area problem (MRCAP), and a novel metric, the maximum ...
Felipe S. C. Roberto +5 more
wiley +1 more source