Results 91 to 100 of about 28,490 (215)

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

open access: yesEskiş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

Anytime Lexicographic Enumeration of the Pareto Front in Multi‐Objective Combinatorial Optimisation

open access: yesJournal of Multi-Criteria Decision Analysis, Volume 33, Issue 1, April 2026.
ABSTRACT Multi‐objective combinatorial optimisation problems are widespread in real‐world scenarios, including resource allocation, scheduling and logistics, where multiple competing objectives need to be optimised simultaneously. In industrial contexts, lexicographic optimisation is often used to solve these problems, requiring the decision‐maker (DM)
Marco Foschini   +3 more
wiley   +1 more source

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

open access: yesComputer 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  

Remembering Courtney Cazden, 1925–2025

open access: yesReading Research Quarterly, Volume 61, Issue 2, April/May/June 2026.
ABSTRACT Here we remember and honor Courtney B. Cazden (1925–2025), whose scholarship, mentorship, and moral clarity profoundly shaped the study of language, literacy, and learning. Drawing on our shared experiences as colleagues, collaborators, students, and friends, we reflect on Courtney's enduring contributions to classroom discourse analysis ...
Kris D. Gutiérrez   +5 more
wiley   +1 more source

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

open access: yesAdvances 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   +5 more
doaj   +1 more source

Enhanced Moth Search Algorithm for the Set-Union Knapsack Problems

open access: yesIEEE Access, 2019
As an important and novel model with multitudinous practical applications, the set-union knapsack problem (SUKP) is a challenging issue in combinatorial optimization.
Yanhong Feng, Jiao-Hong Yi, Gai-Ge Wang
doaj   +1 more source

Testing Nodal Point Relations by Tracking Sediment Through a Bifurcation on the Jefferson River, MT, USA

open access: yesJournal of Geophysical Research: Earth Surface, Volume 131, Issue 4, April 2026.
Abstract River bifurcations control water and sediment distribution in fluvial systems, but the physical mechanisms governing sediment partitioning remain poorly validated in natural rivers. We present a comprehensive field test of nodal point relations using radio frequency identification (RFID) tracking of 376 gravel clasts through a meandering river
Matthew D. Wanker   +4 more
wiley   +1 more source

A case study, nested approach of children with Down Syndrome, their parents' and teachers' experiences of navigating primary–secondary school transition

open access: yesJournal of Research in Special Educational Needs, Volume 26, Issue 2, April 2026.
Abstract Primary‐secondary school transitions are critical developmental periods for children and significant others, within their ecosystem, and can be an uncertain, emotionally unsettling time for all. For children with Special Educational Needs and Disabilities, and Down Syndrome (DS) in particular, this period is believed to be more difficult and ...
Orlaith Kelly   +4 more
wiley   +1 more source

Dynamic programming in package Mathematica [PDF]

open access: yesITM Web of Conferences
Dynamic programming (DP) is a powerful algorithmic technique for solving optimization problems by breaking them down into simpler subproblems. This paper presents an implementation of DP algorithms for two classic optimization problems: the Knapsack ...
Stanimirović Predrag S., Stupin Artem
doaj   +1 more source

Identity and entitlement in accounts of (morally) normative and informational social influence for sustainability

open access: yesBritish Journal of Social Psychology, Volume 65, Issue 2, April 2026.
Abstract Recent discursive psychology research has sought to respecify social influence as a discursive accomplishment and has also begun to identify how the psychological thesaurus is used to portray social influence in situated talk. The present paper contributes to this project by examining how social influence is depicted in accounts of influencing
Liz Cooper
wiley   +1 more source

Home - About - Disclaimer - Privacy