Results 31 to 40 of about 33,491 (214)
Online Knapsack Problem under Expected Capacity Constraint
, 2017 Online knapsack problem is considered, where items arrive in a sequential fashion that have two attributes; value and weight. Each arriving item has to be accepted or rejected on its arrival irrevocably.
Vaze, Rahul
core +1 more source
Knapsack problems in products of groups [PDF]
, 2015 The classic knapsack and related problems have natural generalizations to arbitrary (non-commutative) groups, collectively called knapsack-type problems in groups. We study the effect of free and direct products on their time complexity.
Frenkel, Elizaveta +2 more
core +1 more source
Truthful Multi-unit Procurements with Budgets [PDF]
, 2014 We study procurement games where each seller supplies multiple units of his item, with a cost per unit known only to him. The buyer can purchase any number of units from each seller, values different combinations of the items differently, and has a ...
A. Archer +8 more
core +2 more sources
Subsidies, Knapsack Auctions and Dantzig’s Greedy Heuristic [PDF]
, 2009 A budget-constrained buyer wants to purchase items from a shortlisted set. Items are differentiated by quality and sellers have private reserve prices for their items. Sellers quote prices strategically, inducing a knapsack game.
Ensthaler, Ludwig, Giebe, Thomas
core +3 more sources
Advanced Electronic Materials, EarlyView.Ising machines are emerging as specialized hardware solvers for computationally hard optimization problems. This review examines five major platforms—digital CMOS, analog CMOS, emerging devices, coherent optics, and quantum systems—highlighting physics‐rooted advantages and shared bottlenecks in scalability and connectivity.
Hyunjun Lee, Joon Pyo Kim, Sanghyeon Kim
wiley +1 more source
Adaptation of a Mosquito Swarm Algorithm to Solve a Binary Knapsack Problem [PDF]
Al-Rafidain Journal of Computer Sciences and Mathematics, 2018 The paper tackled one of the artificial intelligence algorithms which is Mosquito swarm algorithm as a nature inspired algorithms, to solve 0-1 knapsack an optimization problem through adaptation steps of a Mosquito swarm algorithm and the inspiration ...
Ruqaya Sha’ban, Isra Alkallak
doaj +1 more source
A Novel Genetic Algorithm using Helper Objectives for the 0-1 Knapsack Problem [PDF]
, 2014 The 0-1 knapsack problem is a well-known combinatorial optimisation problem. Approximation algorithms have been designed for solving it and they return provably good solutions within polynomial time.
Dong, Hongbin, He, Feidun, He, Jun
core
A performance model of speculative prefetching in distributed information systems
, 1999 Previous studies in speculative prefetching focus on building and evaluating access models for the purpose of access prediction. This paper investigates a complementary area which has been largely ignored, that of performance modelling.
Kumar, M., Tuah, N. J., Venkatesh, S.
core +2 more sources
Terrestrial Cyborg Insects for Real‐Life Applications
Advanced Intelligent Systems, EarlyView.This article reviews the development of terrestrial cyborg insects from their emergence in 1997 to mid‐2025, examining three key aspects: locomotion control methods, associated challenges with proposed solutions, and practical applications. Framing these biohybrid systems as insect‐scale mobile robots, the review provides foundational insights for new ...
Hai Nhan Le +10 more
wiley +1 more source
SOLVING MULTIPLE-CONTAINER PACKING PROBLEMS USING PSEUDO-MEIOSIS GENETIC ALGORITHM
Journal of Engineering, 2005 Knapsack problems are a class of common but difficult (NP-complete or NP -hard) problems. Since, it is believed that no knapsack problem algorithm can be constructed whose computation time optimality increases as any polynomial function of the problem ...
Bara'a Ali Attea +1 more
doaj +1 more source