Results 71 to 80 of about 417,011 (184)
Online Contention Resolution Schemes
, 2015 We introduce a new rounding technique designed for online optimization problems, which is related to contention resolution schemes, a technique initially introduced in the context of submodular function maximization. Our rounding technique, which we call
Feldman, Moran +2 more
core +1 more source
Methods in Ecology and Evolution, Volume 17, Issue 5, Page 1519-1534, May 2026.Abstract Optimal allocation of resources to the management of biosecurity risk, threatened species conservation or natural hazards such as bushfires is imperative—because program budgets are usually finite and, therefore, constrained. However, effectively dividing resources among management activities to achieve the greatest benefit remains a ...
Aaron Dodd, Edith Arndt, Anca Hanea
wiley +1 more source
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
Dependent randomized rounding for clustering and partition systems with knapsack constraints
, 2020 Clustering problems are fundamental to unsupervised learning. There is an increased emphasis on fairness in machine learning and AI; one representative notion of fairness is that no single demographic group should be over-represented among the cluster ...
Harris, David G. +3 more
core
A Class of Continuous Separable Nonlinear Multidimensional Knapsack Problems
American Journal of Operations Research, 2018 The nonlinear multidimensional knapsack problem is defined as the minimization of a convex function with multiple linear constraints. The methods developed for nonlinear multidimensional programming problems are often applied to solve the nonlinear multidimensional knapsack problems, but they are inefficient or limited since most of them do not ...
Bin Zhang, Zhe Lin, Yu Wang
openaire +2 more sources
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
Art Adds Value to Ecological Field Courses: A Multi‐Year Case Study in Higher Education
Ecology and Evolution, Volume 16, Issue 4, April 2026.This study presents Earth Projects, an interdisciplinary, place‐based field course that merges ecology and ecological art (eco‐art) to foster deeper engagement with environmental learning. Pre‐ and post‐survey comparisons show that incorporating eco‐art can strengthen students' emotional connections to their identities, disciplines, and place.
Anna Mehlhorn, Anna M. Davidson
wiley +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
Journal of King Saud University: Computer and Information SciencesThe 0–1 knapsack problem (0-1KP) is a well-known discrete combinatorial optimization problem with various applications across multiple fields. Compared with traditional methods, metaheuristic algorithms show higher efficiency and flexibility in solving ...
Fengbin Wu +5 more
doaj +1 more source
A binary grasshopper optimization algorithm for solving uncapacitated facility location problem
Engineering Science and Technology, an International JournalThe Uncapacitated Facility Location Problem (UFLP) is a real-world binary optimization problem that aims to find the number of facilities to open, minimizing the total cost of exchange between customers and facilities, as well as the opening costs of ...
Ahmet Babalik, Aybuke Babadag
doaj +1 more source