4843 search results - page 747 / 969 » The Shortcut Problem - Complexity and Approximation |
150
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
A well studied special case of bin packing is the 3-partition problem, where n items of size > 1 4 have to be packed in a minimum number of bins of capacity one. The famous Kar...
156
Voted
DISOPT
2008
15 years 3 months ago
2008
This paper is motivated by the fact that mixed integer nonlinear programming is an important and difficult area for which there is a need for developing new methods and software f...
123
Voted
EOR
2008
15 years 3 months ago
2008
We study a queueing network where customers go through several stages of processing, with the class of a customer used to indicate the stage of processing. The customers are servic...
145
Voted
FUIN
2008
15 years 3 months ago
2008
Abstract. Approximation of an image by the attractor evolved through iterations of a set of contractive maps is usually known as fractal image compression. The set of maps is calle...
157
Voted
IJACT
2008
15 years 3 months ago
2008
: In Crypto 1997, Goldreich, Goldwasser and Halevi (GGH) proposed a lattice analogue of McEliece public key cryptosystem, in which security is related to the hardness of approximat...