In this paper, we address the problem of routing nets on multi-FPGA systems interconnected by a switch matrix. Switch matrices were introduced to route signals going from one channel to another inside the FPGA chips. We extend the switch matrix architecture proposed by Zhu et al. [1] to route nets between FPGA chips in a multi-FPGA system. Given a limited number of routing resources in the form...

In this paper, we address the online minimization knapsack problem, i. e., the items are given one by one over time and the goal is to minimize the total cost of items that covers a knapsack. We study the removable model, where it is allowed to remove old items from the knapsack in order to accept a new item. We obtain the following results. (i) We propose an 8-competitive deterministic algorit...

One of the promises of the service-oriented architecture (SOA) is that complex services can be composed using individual services. Individual services can be selected and integrated either statically or dynamically based on the service functionalities and performance constraints. For many distributed applications, the runtime performance (e.g. end-to-end delay, cost, reliability and availabilit...

0/1 Multiple Knapsack Problem, a generalization of more popular 0/1 Knapsack Problem, is NP-hard and considered harder than simple Knapsack Problem. 0/1 Multiple Knapsack Problem has many applications in disciplines related to computer science and operations research. Quantum Inspired Evolutionary Algorithms (QIEAs), a subclass of Evolutionary algorithms, are considered effective to solve diffi...

In this article we identify a class of two-dimensional knapsack problems and related three-criteria unconstrained combinatorial optimization problems that can be solved in polynomial time by greedy algorithms. For the latter problem, the proposed algorithm explores the connectedness of the set of efficient solutions. Extensive computational results show that this approach can solve the three-cr...

ABSTRACT In recent years, RTB(Real Time Bidding) becomes a popular online advertisement trading method. During the auction, each DSP(Demand Side Platform) is supposed to evaluate current opportunity and respond with an ad and corresponding bid price. It’s essential for DSP to find an optimal ad selection and bid price determination strategy which maximizes revenue or performance under budget an...

This paper introduces a knapsack cryptosystem based on the problem of discrete logarithm. The proposed algorithm obtains the public knapsack values by finding the discrete logarithms of the secret knapsack ones. Also, it encrypts the message block by obtaining its binary bits and then computing the modular multiplication of the public knapsack values corresponding to the 1-bits of the binary fo...

In this work we address a game theoretic variant of the Subset Sum problem, in which two decision makers (agents/players) compete for the usage of a common resource represented by a knapsack capacity. Each agent owns a set of integer weighted items and wants to maximize the total weight of its own items included in the knapsack. The solution is built as follows: Each agent, in turn, selects one...