Specifically, KOMIG IDS comprises a 2-stage feature selection procedure; the first was accomplished with a knapsack optimization algorithm and the second with a mutual information gain filter. In particular, we developed an optimization model for the selection of the most important features...
genetic_algorithm geodesy geometry graphics graphs greedy_methods hashes knapsack tests README.md __init__.py greedy_knapsack.py knapsack.py recursive_approach_knapsack.py linear_algebra linear_programming machine_learning maths matrix networking_flow neural_network other physics project_euler quantum sche...
Particle swarm optimization algorithms have been successfully applied to discrete/valued optimization problems. However, in many cases the algorithms have been tailored specifically for the problem at hand. This paper proposes a generic set-based particle swarm optimization algorithm for use in discrete-...
This paper tackles the NP-hard set-union knapsack problem using a novel adaptive evolutionary algorithm. Such a problem has applications in database query optimization, network design, and project portfolio management. The method starts by creating an archive set with elite and diversified solutions,...
The resource aggregations are, in turn, based on a hierarchy of the peripheral devices. A bin-packing algorithm is employed to determine allocation of the resource requests so as to minimize resource address space allocations. The virtual resource map is then used to perform actual resource ...
This paper presents the implementation of ECC by first transforming the message into an affine point on the EC, and then applying the knapsack algorithm on ECC encrypted message over the finite field GF(p). In ECC we normally start with an affine point called $P_{m}$(x,y). This point...
We also take out computational experience using the commercial software Gurobi and a greedy algorithm (GA), respec- tively. The outcome indicates that the suggest models are active and worka- ble. This paper introduced two different algorithms to study the shortest path problems: the first ...
Jan and Wang =-=[18]-=- use Merkle’s knapsack algorithm, along with other security measures, to encode user privileges in a network. Broadband Communication Ross and Tsang [29] introduce the STOCHASTIC KNAPSACK problem, whe...
In this paper we break a knapsack based two-lock cryptosystem proposed at ICICS03 [7]. The two-lock cryptosystem is a commutative encryption algorithm that is very useful for the construction of the general t-out-of-n oblivious transfers and millionaire protocol. However, our analysis shows ...
greedy algorithmsensor networksA sensor network in the field is usually required to support multiple sensing tasks or missions to be accomplishedsimultaneously. Since missions might compete for the exclusive usage of the same sensing resource we need toassign individual sensors to missions. Missions are...