Results 81 to 90 of about 24,926 (205)

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

Sensitivity analysis of the greedy heuristic for binary knapsack problems [PDF]

open access: yes
Greedy heuristics are a popular choice of heuristics when we have to solve a large variety of NP -hard combinatorial problems. In particular for binary knapsack problems, these heuristics generate good results.
Chakravarti, N., Ghosh, D., Sierksma, G.
core   +1 more source

A Subquadratic Approximation Scheme for Partition

open access: yes, 2019
The subject of this paper is the time complexity of approximating Knapsack, Subset Sum, Partition, and some other related problems. The main result is an $\widetilde{O}(n+1/\varepsilon^{5/3})$ time randomized FPTAS for Partition, which is derived from a ...
Mucha, Marcin   +2 more
core   +1 more source

Evaluation of single versus multiple site of action preemergence herbicides for waterhemp and giant ragweed control in Wisconsin soybean

open access: yesAgrosystems, Geosciences &Environment, Volume 9, Issue 1, March 2026.
Abstract The use of preemergence (PRE) herbicides with soil residual activity is recognized as an effective strategy for early‐season weed management in Midwest US soybean [Glycine max (L.) Merr.] production. The efficacy of soybean PRE herbicides with single and multiple sites of action (SOAs), including acetolactate synthase (ALS), photosystem II ...
Rodrigo Werle   +4 more
wiley   +1 more source

Transport Logistics Optimization Model Of Passenger Car Based On Heuristic Algorithm

open access: yesMATEC Web of Conferences, 2016
Passenger car logistics transportation problem is at the primary stage of development in China, great economic loss and waste of resources caused in the process of logistics transportation, because most of enterprises in China rely on artificial ...
Zhou Juan   +3 more
doaj   +1 more source

List-Based Simulated Annealing Algorithm With Hybrid Greedy Repair and Optimization Operator for 0–1 Knapsack Problem

open access: yesIEEE Access, 2018
List-based simulated annealing (LBSA) algorithm, which uses list-based cooling scheme to control the change of parameter temperature, was first proposed for traveling salesman problem. This paper extends the application of LBSA algorithm for 0-1 knapsack
Shi-Hua Zhan   +3 more
doaj   +1 more source

Prevalence of Low Back Pain and Associated Factors Among University Students in Bangladesh: A Cross‐Sectional Study

open access: yesHealth Science Reports, Volume 9, Issue 3, March 2026.
ABSTRACT Background University students are susceptible to low back pain (LBP) because of their predisposition to various factors that have been previously linked to the increased risk of LBP among other populations. There is a substantial lack of research that explores the prevalence and risk factors of LBP among university students in Bangladesh ...
Noushin Nohor   +10 more
wiley   +1 more source

Quantum Bacterial Foraging Optimization: From Theory to MIMO System Designs

open access: yesIEEE Open Journal of the Communications Society, 2020
This article develops a quantum bacterial foraging optimization (QBFO) algorithm, a quantum intelligence algorithm based on quantum computing and bacterial foraging optimization (BFO), with application in MIMO system optimization designs.
Fei Li   +6 more
doaj   +1 more source

Perfect Matching Under Precedence Constraints

open access: yesNetworks, Volume 87, Issue 2, Page 175-190, March 2026.
ABSTRACT In this article, we motivate and define variants of perfect matching under precedence constraints where a perfect matching is built incrementally and precedence constraints ensure that an edge may only be added to the matching if the edge's predecessor vertices have already been covered.
Christina Büsing, Corinna Mathwieser
wiley   +1 more source

A Heuristics-Guided Simplified Discrete Harmony Search Algorithm for Solving 0-1 Knapsack Problem

open access: yesAlgorithms
The harmony search (HS) algorithm is a novel metaheuristic which has been widely used to solve both continuous and discrete optimization problems. In order to improve the performance and simplify the implementation of the HS algorithm for solving the 0-1
Fuyuan Zheng   +5 more
doaj   +1 more source

Home - About - Disclaimer - Privacy