1547 search results - page 3 / 310 » Solving Knapsack Problems in a Sticker Based Model |
IPL
2006
13 years 7 months ago
2006
We present a simple family of algorithms for solving the Generalized Assignment Problem (GAP). Our technique is based on a novel combinatorial translation of any algorithm for the...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
—Cooperative jamming (CJ) schemes support secure wireless communication in the presence of one or more eavesdroppers. Larger numbers of cooperative relays provide better secrecy ...
WSC
1998
13 years 8 months ago
1998
In this paper, we present an approach for measuring certain properties of synthetic optimization problems based on the assumed distribution of coefficient values. We show how to e...
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
Quantum-inspired evolutionary algorithms (QIEAs), as a subset of evolutionary computation, are based on the principles of quantum computing such as quantum bits and quantum superp...
EVOW
2009
Springer
13 years 5 months ago
2009
Springer
Abstract. In this paper we propose a new benchmark problem for dynamic combinatorial optimisation. Unlike most previous benchmarks, we focus primarily on the underlying dynamics of...