2244 search results - page 177 / 449 » A new heuristic approach for non-convex optimization problem... |
181
click to vote
ISCAS
1994
IEEE
15 years 11 months ago
1994
IEEE
Earlier research has shown that the problem of optimal weighted median filtering with structural constraints can be formulated as a nonconvex nonlinear programming problem in gene...
173
click to vote
UAI
2004
15 years 8 months ago
2004
Recent research has made significant progress on the problem of bounding log partition functions for exponential family graphical models. Such bounds have associated dual paramete...
220
click to vote
ICCAD
1997
IEEE
15 years 11 months ago
1997
IEEE
We introduce a new technique to solve exactly a discrete optimization problem, based on the paradigm of “negative” thinking. The motivation is that when searching the space of...
187
click to vote
AIPS
2006
15 years 8 months ago
2006
Planning as satisfiability (SAT-Plan) is one of the best approaches to optimal planning, which has been shown effective on problems in many different domains. However, the potenti...
170
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
I present a new estimation-of-distribution approach to program evolution where distributions are not estimated over the entire space of programs. Rather, a novel representationbui...