7519 search results - page 300 / 1504 » Optimizing Generic Functions |
202
click to vote
ICIP
2007
IEEE
16 years 8 months ago
2007
IEEE
In this paper, we present a novel active contour model, in which the traditional gradient descent optimization is replaced by graph cut optimization. The basic idea is to first de...
154
click to vote
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
Hyper-heuristics (HHs) are heuristics that work with an arbitrary set of search operators or algorithms and combine these algorithms adaptively to achieve a better performance tha...
188
click to vote
ICWS
2009
IEEE
15 years 4 months ago
2009
IEEE
We present a Semantic Optimized Service Discovery (SemOSD) approach capable of handling Web service search requests on a fine-grained level of detail where we augment semantic ser...
162
click to vote
MP
2006
15 years 6 months ago
2006
We show that for even quasi-concave objective functions the worst-case distribution, with respect to a family of unimodal distributions, of a stochastic programming problem is a u...
187
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
We consider a robust model proposed by Scarf, 1958, for stochastic optimization when only the marginal probabilities of (binary) random variables are given, and the correlation be...