Results 61 to 70 of about 28,713 (220)
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
Dual population-based incremental learning for problem optimization in dynamic environments [PDF]
, 2003 Copyright @ 2003 Asia Pacific Symposium on Intelligent and Evolutionary SystemsIn recent years there is a growing interest in the research of evolutionary algorithms for dynamic optimization problems since real world problems are usually dynamic, which ...
Yang, S, Yao, X
core +1 more source
CAAI Transactions on Intelligence Technology, EarlyView.ABSTRACT Networked control systems (NCSs) often suffer from performance degradation due to limited communication bandwidth, which can cause data transmission conflicts and packet loss. Existing scheduling strategies may fail to simultaneously meet the real‐time requirements and the importance of multisensor data, and they are particularly vulnerable ...
Da Chen +5 more
wiley +1 more source
ON THE BRIGHTER SIDE OF THE NIGHT: Discovering Community and Care in Night Shift Work
International Journal of Urban and Regional Research, EarlyView.Abstract Within the burgeoning attention being paid to the night‐time economy (NTE) in and by cities, the demands and impacts of night work have gathered increasingly scholarly attention. Research has centred on the darker side of these, pointing to workers' precarity and vulnerability. What if we attend also to a ‘brighter side’ of the night and night
Jesse Mentha +3 more
wiley +1 more source
Using incentive payments to promote human–carnivore coexistence
Conservation Biology, EarlyView.Abstract For many large carnivores, minimizing the financial burden they impose on local people is critical to their conservation. Incentive‐based programs that provide people with financial benefits for taking pro‐conservation actions or achieving conservation goals are a promising tool for promoting human–carnivore coexistence. Although the number of
Adam Pekor +9 more
wiley +1 more source
Solution Methods for the Multiple-Choice Knapsack Problem and Their Applications
MathematicsThe Knapsack Problem belongs to the best-studied classical problems in combinatorial optimization. The Multiple-choice Knapsack Problem (MCKP) represents a generalization of the problem, with various application fields such as industry, transportation ...
Tibor Szkaliczki
doaj +1 more source
The Shapley Value in Knapsack Budgeted Games
, 2014 We propose the study of computing the Shapley value for a new class of cooperative games that we call budgeted games, and investigate in particular knapsack budgeted games, a version modeled after the classical knapsack problem.
Bhagat, Smriti +3 more
core +1 more source
‘AN AUSTRIAN FATE’: TRAUMA, REPRESSION AND WAR IN ADRIAN GOIGINGER'S DER FUCHS (2022)
German Life and Letters, EarlyView.ABSTRACT This article examines one of the highest‐grossing films in recent years in Austria, Der Fuchs (Adrian Goiginger, 2022), which focuses on the friendship of the protagonist, a Wehrmacht soldier, with an abandoned fox cub, but in the process elides more than four years of the soldier's wartime experience.
Katya Krylova
wiley +1 more source
A Subquadratic Approximation Scheme for Partition
, 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
On approximating the Incremental Knapsack Problem [PDF]
Discrete Applied Mathematics, 2019 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Della Croce F. +2 more
openaire +2 more sources