3875 search results - page 685 / 775 » Approximation algorithms for the 0-extension problem |
ESANN
2003
14 years 11 months ago
2003
The resource constraint project scheduling problem (RCPSP) is an NP-hard benchmark problem in scheduling which takes into account the limitation of resources’ availabilities in ...
GECCO
2008
Springer
14 years 11 months ago
2008
Springer
Investors vary with respect to their expected return and aversion to associated risk, and hence also vary in their performance expectations of the stock market portfolios they hol...
101
click to vote
IJACT
2008
14 years 9 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...
SIAMSC
2008
14 years 9 months ago
2008
Abstract. We present a new derivative-free algorithm, ORBIT, for unconstrained local optimization of computationally expensive functions. A trust-region framework using interpolati...
CVPR
2001
IEEE
15 years 11 months ago
2001
IEEE
This paper presents a novel processing scheme for the automatic computation of a medial shape model which is representative for an object population with shape variability. The se...