Results 121 to 130 of about 33,818 (220)

Softening the Border: A Capacities Approach to the Perception–Cognition Distinction

Philosophy and Phenomenological Research, Volume 112, Issue 3, Page 707-723, May 2026.
ABSTRACT Approaches to the perception–cognition distinction tend toward two extremes. Many embrace a hard border, treating perception and cognition as mutually exclusive, non‐overlapping categories. By contrast, eliminativism denies that any principled, theoretically useful distinction exists between perception and cognition.
Jacob Beck, Casey O'Callaghan
wiley   +1 more source

OPTIMIZATION OF THE PROBLEM SOLVING WITH LIMITED RESOURCE

Доклады Белорусского государственного университета информатики и радиоэлектроники, 2019
The knapsack problem is analyzed on the basis of the mathematical model, which uses the means of multicriterial optimization. The method which defines possible redundancy of the initial data set is offered for the problem. The algorithm of the transition
S. V. Chebakov, L. V. Serebryanaya
doaj  

Distribution of Computational Load between Processors in an Exact Solution of the Knapsack Problem with Exhaustive Search

Безопасность информационных технологий, 2015
Keywords:  In this paper, we propose a new approach to the definition of basic problems in a constructive enumeration of combinations of knapsack vector elements.
Georgii Ivanovich Borzunov, Mikhail Andreevich Kupriyashin   +1 more
doaj  

A portfolio selection model based on the knapsack problem under uncertainty. [PDF]

PLoS One, 2019
Vaezi F, Sadjadi SJ, Makui A.
europepmc   +1 more source

How Humans Solve Complex Problems: The Case of the Knapsack Problem. [PDF]

Sci Rep, 2016
Murawski C, Bossaerts P.
europepmc   +1 more source

Combinatorial efficiency evaluation: the knapsack problem in data envelopment analysis. [PDF]

ScientificWorldJournal, 2014
Qi XG, Guo B.
europepmc   +1 more source

Approximate Solutions to the Multiple-Choice Knapsack Problem by Multiobjectivization and Chebyshev Scalarization [PDF]

Operations Research and Decisions
The method BISSA, proposed by Bednarczuk, Miroforidis, and Pyzel, provides approximate solutions to the multiple-choice knapsack problem. To fathom the optimality gap that is left by BISSA, we present a method that starts from the BISSA solution and it ...
Ewa M. Bednarczuk, Ignacy Kaliszewski, Janusz Miroforidis   +2 more
doaj  

Solving the 0/1 knapsack problem by a biomolecular DNA computer. [PDF]

Adv Bioinformatics, 2013
Taghipour H, Rezaei M, Esmaili HA.
europepmc   +1 more source