Results 41 to 50 of about 28,713 (220)

Truthful Assignment without Money [PDF]

open access: yes, 2010
We study the design of truthful mechanisms that do not use payments for the generalized assignment problem (GAP) and its variants. An instance of the GAP consists of a bipartite graph with jobs on one side and machines on the other.
Dughmi, Shaddin, Ghosh, Arpita
core   +4 more sources

Investigation of The Effect of Feeding Period in Honey Bee Algorithm

open access: yesSakarya Üniversitesi Fen Bilimleri Enstitüsü Dergisi, 2022
In the study, it was investigated the ejaculation ability and semen quality of drones, according to feeding with pollen in different periods. In the first step of the study, 16 %, 32 %, 47 %, 63 %, 79 %, and 100 % feeding periods were applied to the ...
Mustafa Kaya
doaj   +1 more source

Knapsack Problems for Wreath Products [PDF]

open access: yes, 2018
In recent years, knapsack problems for (in general non-commutative) groups have attracted attention. In this paper, the knapsack problem for wreath products is studied. It turns out that decidability of knapsack is not preserved under wreath product.
  +3 more
core   +2 more sources

Fundamental Challenges, Physical Implementations, and Integration Strategies for Ising Machines in Large‐Scale Optimization Tasks

open access: yesAdvanced 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

A Sequence-Based Hyper-Heuristic for Traveling Thieves

open access: yesApplied Sciences, 2022
A plethora of combinatorial optimization problems can be linked to real-life decision scenarios. Even nowadays, more diverse and complex problems are popping up. One of these problems is the traveling thief problem (TTP), which combines elements from the
Daniel Rodríguez   +3 more
doaj   +1 more source

Terrestrial Cyborg Insects for Real‐Life Applications

open access: yesAdvanced 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

Approximation of the Quadratic Knapsack Problem [PDF]

open access: yesINFORMS Journal on Computing, 2016
We study the approximability of the classical quadratic knapsack problem (QKP) on special graph classes. In this case the quadratic terms of the objective function are not given for each pair of knapsack items. Instead, an edge weighted graph, whose vertices represent the knapsack items, induces a quadratic profit for every pair of items, which is ...
Ulrich Pferschy, Joachim Schauer
openaire   +5 more sources

Using photovoice to understand community perceptions of firearm risks and protective factors among Asian Americans

open access: yesAmerican Journal of Community Psychology, EarlyView.
Abstract This study used photovoice methodology to explore Asian Americans' perspectives on the root causes and protective factors of firearm violence in their communities. Photovoice provided a participatory platform for community members to document lived experiences and identify priorities for change.
Tsu‐Yin Wu   +4 more
wiley   +1 more source

Solving the 0-1 Knapsack Problem by Using Tissue P System With Cell Division

open access: yesIEEE Access, 2019
Membrane computing is a kind of distributed and parallel computing model inspired by a biological cell mechanism. The maximum parallelism of membrane computing improves the computational efficiency of its computational model.
Lian Ye   +3 more
doaj   +1 more source

Shaping Decision Models for Stochastic Dynamic Optimization Problems via Reinforcement Learning

open access: yesNetworks, EarlyView.
ABSTRACT With rising customer expectations and increasing computational potential, many transport, manufacturing, and production operations face real‐time decision making in stochastic dynamic environments. Decision makers must find and adapt complex plans that are effective now but also flexible with respect to future developments.
Florentin D. Hildebrandt   +3 more
wiley   +1 more source

Home - About - Disclaimer - Privacy