Results 101 to 110 of about 25,976 (248)
Developmental Science, Volume 29, Issue 3, May 2026.ABSTRACT This longitudinal study examined the developmental relations between first‐order Theory of Mind (ToM), advanced ToM, and executive function (EF) from ages 4 to 7.5. Two‐hundred‐three German children were assessed at ages 4, 5.5, and 7.5 on measures of ToM, EF (working memory, inhibition, cognitive flexibility), general cognition, and language.
Christopher Osterhaus +3 more
wiley +1 more source
An Improved Shuffled Frog-Leaping Algorithm to Solving 0–1 Knapsack Problem
IEEE AccessTo address the problems of slow convergence, low search accuracy, and easy fall into local optimum, and generating a large number of infeasible solutions when solving the 0–1 Knapsack Problem, which makes it difficult to obtain the optimal ...
Jianhao Zhang, Wei Jiang, Kang Zhao
doaj +1 more source
Cargo Revenue Management: Bid-Prices for a 0-1 Multi Knapsack Problem [PDF]
, 2004 Revenue management is the practice of selecting those customers that generate the maximum revenue from a fixed and perishable capacity. Cargo revenue management differs from the well-known passenger revenue management problem by the fact that its ...
Dekker, R. (Rommert), Pak, K.
core +1 more source
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
Two Knapsacks Are Better than One for Both Soft and Hard Conflict Constraints
MathematicsFor the classic 0–1 knapsack problem, there can be pairs of items that are in conflict. In other words, either at most one item can be inserted into the knapsack (hard conflict constraint) from the conflict pair or there may be a penalty (soft conflict ...
Peter Cadiz +3 more
doaj +1 more source
CASE STUDY IN OPTIMAL TELEVISION ADVERTS SELECTION AS KNAPSACK PROBLEM
Вісник Київського національного університету імені Тараса Шевченка. Серія Економіка, 2014 In this research paper, we shall consider the application of classical 0-1 knapsack problem with a single constraint to selection of television advertisements at critical periods such as prime time news, news adjacencies, break in news and peak times ...
E. Ivokhin, Almodars Barraq Subhi Kaml
doaj +1 more source
A New Genetic Algorithm for the 0-1 Knapsack Problem
Academic Platform Journal of Engineering and Science, 2016 In this paper, The 0-1 Knapsack Problem (KP) which occurs in many different applications is studied and a new genetic algorithm to solve the KP is proposed. In our methodology, n items are represented by n genes on a bit array that compactly stores the values 0 or 1.
BERBERLER, Murat Erşen +2 more
openaire +6 more sources
An efficient hybrid heuristic method for the 0-1 exact k-item quadratic knapsack problem [PDF]
, 2014 Lucas Létocart +2 more
openalex +1 more source
Using Heuristic Algorithms to Solve the 0-1 Knapsack Problem
, 2023 Sanatan Mishra, David Perkins
openalex +2 more sources