3049 search results - page 59 / 610 » On the Convergence of Bound Optimization Algorithms |
105
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We present a faster exponential-time algorithm for integer optimization over quasi-convex polynomials. We study the minimization of a quasiconvex polynomial subject to s quasi-con...
133
click to vote
ATAL
2006
Springer
15 years 8 months ago
2006
Springer
We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modificati...
146
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
—We consider the problem of minimizing upper bounds and maximizing lower bounds on information rates of stationary and ergodic discrete-time channels with memory. The channels we...
125
click to vote
GECCO
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. We present upper bounds on the time and space complexity of finding the global optimum of additively separable functions, a class of functions that has been studied exten...
127
click to vote
PG
2003
IEEE
15 years 9 months ago
2003
IEEE
We present an algorithm to construct a tight bounding polyhedron for a recursive procedural model. We first use an iterated function system (IFS) to represent the extent of the p...