7519 search results - page 76 / 1504 » Optimizing Generic Functions |
142
click to vote
CEC
2007
IEEE
15 years 11 months ago
2007
IEEE
Abstract— We recast the problem of unconstrained continuous evolutionary optimization as inference in a fixed graphical model. This approach allows us to address several pervasi...
128
click to vote
ECCV
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. In this paper we develop an algorithm for structured prediction that optimizes against complex performance measures, those which are a function of false positive and fals...
134
click to vote
SODA
2010
ACM
16 years 2 months ago
2010
ACM
We present a new optimization technique that yields the first FPTAS for several geometric problems. These problems reduce to optimizing a sum of non-negative, constant description...
166
click to vote
CONSTRAINTS
2008
15 years 4 months ago
2008
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...
141
click to vote
VLDB
2002
ACM
15 years 4 months ago
2002
ACM
The cost of a query plan depends on many parameters, such as predicate selectivities and available memory, whose values may not be known at optimization time. Parametric query opt...