Results 111 to 120 of about 4,775,611 (190)
A polyhedral approach for the generalized assignment problem. [PDF]
The generalized assignment problem (GAP) consists of finding a maximal profit assignment of n jobs over m capacity constrained agents, whereby each job has to be processed by only one agent.
Degraeve, Zeger, Tistaert, J
core
Concatenation versus addition in knapsack problems
, 1993 "Appeared in Information Processing Letters 54 (1995),169-174. We consider the complexity of two knapsack problems that are defined with the operation ``concatenation'' instead of ``addition''.
Jenner Núñez, Birgit
core +1 more source
Using Texts as Megaphones: The Power of African American Readers Hearing Themselves in Books
The Reading Teacher, Volume 80, Issue 3, November/December 2026.ABSTRACT This article highlights the power of authentic children's literature to affirm African American English as a legitimate, rule‐governed linguistic system and elevate it as a source of cognitive strength, cultural richness, and academic potential.
Ramona T. Pittman +3 more
wiley +1 more source
An improved hybrid encoding cuckoo search algorithm for 0-1 knapsack problems. [PDF]
Comput Intell Neurosci, 2014 Feng Y, Jia K, He Y.
europepmc +1 more source
Social Development, Volume 35, Issue 4, November 2026.ABSTRACT There is little doubt that children's social‐emotional skills predict better educational outcomes, yet few public preschool evaluation studies have explored associations between public preschool attendance and children's social‐emotional development through elementary school.
Deborah A. Phillips +5 more
wiley +1 more source
Multimodal Video Summarization Using Vision‐Language Embeddings and Hierarchical Temporal Modeling
Applied AI Letters, Volume 7, Issue 3, October 2026.Combining BLIP‐2 image captions with CLIP vision–language embeddings gives video frames semantic meaning that pixels alone cannot convey. Processed by a multi‐scale temporal U‐Net and hierarchical shot‐aware transformer, these multimodal features achieve a state‐of‐the‐art 59.27% F1‐score on SumMe using only 28.27M parameters.
Saadman Sakib, Kaushik Deb
wiley +1 more source
An effective hybrid cuckoo search algorithm with improved shuffled frog leaping algorithm for 0-1 knapsack problems. [PDF]
Comput Intell Neurosci, 2014 Feng Y, Wang GG, Feng Q, Zhao XJ.
europepmc +1 more source
Psychology &Marketing, Volume 43, Issue 10, Page 2532-2551, October 2026.ABSTRACT This research examines how AI role disclosure transparency—the consumers' subjective perception of how clearly and informatively an advertisement communicates the role that AI played in the ad creation process—influences consumer evaluation of AI‐generated ads via ad creation process credibility. A high level of perceived transparency enhances
Khanh Bao Quang Le +3 more
wiley +1 more source
Knapsack Problems with Setups [PDF]
, 2009 International audienceKnapsack problems with setups find their application in many concrete industrial and financial problems. Moreover, they also arise as subproblems in a Dantzig-Wolfe decomposition approach to more complex combinatorial optimization ...
Vanderbeck, François +2 more
core
GCKSign: Simple and efficient signatures from generalized compact knapsack problems. [PDF]
PLoS OneWoo J, Lee K, Park JH.
europepmc +1 more source