Results 71 to 80 of about 4,775,611 (190)

Navigating Ideological Tensions: Pre‐Service Teachers’ Beliefs and Practices of Translanguaging in ESL Classrooms

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

BINARY HONEY BADGER ALGORITHM ENHANCED WITH TIME-VARYING SIGMOID TRANSFER FUNCTION AND CROSSOVER STRATEGY

Eskişehir Osmangazi Üniversitesi Mühendislik ve Mimarlık Fakültesi Dergisi
Modeling the foraging behavior of honey badgers, the Honey Badger Algorithm (HBA) is a recently proposed metaheuristic algorithm. In this study, a binary version of this algorithm that was proposed for solving continuous optimization problems was ...
Emine Baş, Gülnur Yıldızdan
doaj   +1 more source

FINDING OF OPTIMAL SUBSET STRUCTURE IN THE KNAPSACK PROBLEM

Доклады Белорусского государственного университета информатики и радиоэлектроники, 2019
An algorithm for solving the knapsack problem based on the proposed multi-criteria model is considered. The implementation of this algorithm allows to define the structure of the optimal subset as a union of certain elements of a Pareto layers group into
S. V. Chebakov, L. V. Serebryanaya
doaj   +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, Roberto Aringhieri, Pierre Hosteins   +2 more
wiley   +1 more source

Knapsack problems

, 2004
Thirteen years have passed since the seminal book on knapsack problems by Martello and Toth appeared. On this occasion a former colleague exclaimed back in 1990: "How can you write 250 pages on the knapsack problem?" Indeed, the definition of the ...
Kellerer, Hans, Pisinger, David, Pferschy, Ulrich   +2 more
core   +1 more source

Knapsack Problems for Wreath Products [PDF]

, 2018
In recent years, knapsack problems for (in general non-commutative) groups have attracted attention. In this paper, the knapsack problem for wreath products is studied. It turns out that decidability of knapsack is not preserved under wreath product.
Zetzsche, Georg, König, Daniel, Lohrey, M., Zetzsche, G., König, D., Lohrey, Markus, Ganardi, M., Ganardi, Moses   +7 more
core   +1 more source

Modeling Bloons Tower Defense as a temporal two‐dimensional knapsack problem with irregular shapes and side constraints: integer programming–based approaches

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

Enhancing computational efficiency in solving Knapsack problem: insights from algorithmic parallelization and optimization

Advances in Computing and Engineering
The Knapsack problem is a combinatorial optimization problem whose exact solution using exhaustive search method is impractical. Hence, the application of approximate algorithms is usually considered when encountering this optimization problem.
Bashar Bin Usman, Okeyinka Aderemi Elisha, Ibrahim Abdullahi, Idris Rabiu, Adamu Isah, Abdulganiyyu Abdulrahman   +5 more
doaj   +1 more source

An algorithm for solving a class of knapsack problems and its generalization [PDF]

Computer Science Journal of Moldova, 2005
A class of knapsack problems which generalizes the classical ones is studied. Algorithms based on the dynamical programming and Branch and Bound methods are proposed. The correctness and time estimation of the algorithm are given.
Elena Balan
doaj  

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, Victor U. Pugliese, Sanderson L. Gonzaga de Oliveira, Oseias Ferreira, Antonio A. Chaves, Fabio A. Faria   +5 more
wiley   +1 more source