Results 1 to 10 of about 43,488 (185)

Fair Knapsack

open access: yesProceedings of the AAAI Conference on Artificial Intelligence, 2018
We study the following multiagent variant of the knapsack problem. We are given a set of items, a set of voters, and a value of the budget; each item is endowed with a cost and each voter assigns to each item a certain value.
Fluschnik, Till   +3 more
core   +3 more sources

Selfish Knapsack

open access: yesProceedings of the AAAI Conference on Artificial Intelligence, 2016
We consider a selfish variant of the knapsack problem. In our version, the items are owned by agents, and each agent can misrepresent the set of items she owns---either by avoiding reporting some of them (understating), or by reporting additional ones ...
Feigenbaum, Itai, Johnson, Matthew P.
core   +2 more sources

An Intelligent Web Service Composition and Resource-Optimization Method Using K-Means Clustering and Knapsack Algorithms

open access: yesMathematics, 2021
Service-oriented architecture (SOA) has emerged as a flexible software design style. SOA focuses on the development, use, and reuse of small, self-contained, independent blocks of code called web services that communicate over the network to perform a ...
Issam Alhadid   +5 more
doaj   +1 more source

Provably Good Solutions to the Knapsack Problem via Neural Networks of Bounded Size [PDF]

open access: yes, 2021
The development of a satisfying and rigorous mathematical understanding of the performance of neural networks is a major challenge in artificial intelligence.
Hertrich, Christoph, Skutella, Martin
core   +3 more sources

Multistage knapsack

open access: yesJournal of Computer and System Sciences, 2022
Many systems have to be maintained while the underlying constraints, costs and/or profits change over time. Although the state of a system may evolve during time, a non-negligible transition cost is incured for transitioning from one state to another. In order to model such situations, Gupta et al. (ICALP 2014) and Eisenstat et al.
Bampis, Evripidis   +2 more
openaire   +7 more sources

Cyber Risk Assessment and Optimization: A Small Business Case Study

open access: yesIEEE Access, 2023
Assessing and controlling cyber risk is the cornerstone of information security management, but also a formidable challenge for organisations due to the uncertainties associated with attacks, the resulting risk exposure, and the availability of scarce ...
Maria Tsiodra   +3 more
doaj   +1 more source

An efficient optimizer for the 0/1 knapsack problem using group counseling [PDF]

open access: yesPeerJ Computer Science, 2023
The field of optimization is concerned with determining the optimal solution to a problem. It refers to the mathematical loss or gain of a given objective function.
Yazeed Yasin Ghadi   +6 more
doaj   +2 more sources

In silico Pharmacokinetic and Toxicity Prediction of Compounds from Andrographis paniculata (Burm.f.) Nees.

open access: yesJournal of Food and Pharmaceutical Sciences, 2023
Many compounds have been isolated from Andrographis paniculata (Burm. f.) Nees (AP). In drug discovery and development, plant secondary metabolites are popular as resources for drug candidates.
Izatunnafis Izatunnafis   +2 more
doaj   +1 more source

Online Knapsack Revisited [PDF]

open access: yesTheory of Computing Systems, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Marek Cygan, Łukasz Jeż, Jiří Sgall
openaire   +2 more sources

Binary salp swarm algorithm for discounted {0-1} knapsack problem.

open access: yesPLoS ONE, 2022
While the classical knapsack problem has been the object to be solved by optimization algorithm proposals for many years, another version of this problem, discounted {0-1} knapsack problem, is gaining a lot of attention recently.
Binh Thanh Dang, Tung Khac Truong
doaj   +1 more source

Home - About - Disclaimer - Privacy