Results 11 to 20 of about 33,491 (214)
CAAI Transactions on Intelligence Technology, EarlyView., 2023 Abstract The Internet of Things is emerging as a crucial technology in aiding humans and making their lives easier. Among the human population, a large percentage of people suffer from disabilities resulting in challenges in everyday life particularly people with visual disabilities.
Hania Tarik +8 more
wiley +1 more source
Optimalisasi Penyelesaian Knapsack Problem Dengan Algoritma Genetika
Lontar Komputer, 2016 Knapsack problems is a problem that often we encounter in everyday life. Knapsack problem itself is a problem where a person faced with the problems of optimization on the selection of objects that can be inserted into the container which has limited ...
I Wayan Supriana
doaj +1 more source
Matroid and Knapsack Center Problems [PDF]
, 2013 In the classic $k$-center problem, we are given a metric graph, and the objective is to open $k$ nodes as centers such that the maximum distance from any vertex to its closest center is minimized.
A. Schrijver +15 more
core +1 more source
A novel approach for solving travelling thief problem using enhanced simulated annealing [PDF]
PeerJ Computer Science, 2021 Real-world optimization problems are getting more and more complex due to the involvement of inter dependencies. These complex problems need more advanced optimizing techniques.
Hamid Ali +5 more
doaj +2 more sources
Improved Online Algorithms for Knapsack and GAP in the Random Order Model [PDF]
, 2019 The knapsack problem is one of the classical problems in combinatorial optimization: Given a set of items, each specified by its size and profit, the goal is to find a maximum profit packing into a knapsack of bounded capacity.
Albers, Susanne +2 more
core +2 more sources
A Deep Reinforcement Learning-Based Scheme for Solving Multiple Knapsack Problems
Applied Sciences, 2022 A knapsack problem is to select a set of items that maximizes the total profit of selected items while keeping the total weight of the selected items no less than the capacity of the knapsack.
Giwon Sur +3 more
doaj +1 more source
A Comparison of Greedy Algorithm and Dynamic Programming Algorithm [PDF]
SHS Web of Conferences, 2022 Two algorithms to handle the problem include greedy algorithms and dynamic programming. Because of their simplicity, intuitiveness, and great efficiency in addressing problems, they are frequently employed in a variety of circumstances.
Chen Xiaoxi
doaj +1 more source
Comparative analysis of genetic crossover operators in knapsack problem
Journal of Applied Sciences and Environmental Management, 2016 The Genetic Algorithm (GA) is an evolutionary algorithms and technique based on natural selections of individuals called chromosomes. In this paper, a method for solving Knapsack problem via GA (Genetic Algorithm) is presented. We compared six different
D Hakimi +3 more
doaj +1 more source
Knapsack Problems for Wreath Products [PDF]
, 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
Cybernetics and Information Technologies, 2021 Merkle-Hellman public key cryptosystem is a long-age old algorithm used in cryptography. Despite being computationally fast, for very large input sizes it may operate slower due to thread creation overhead or reaching a deadlock situation. In this paper,
Rahul Vaddadi Sai +2 more
doaj +1 more source