3049 search results - page 76 / 610 » On the Convergence of Bound Optimization Algorithms |
145
Voted
MP
2006
15 years 4 months ago
2006
There are many applications related to singly linearly constrained quadratic programs subjected to upper and lower bounds. In this paper, a new algorithm based on secant approximat...
131
click to vote
SAT
2004
Springer
15 years 9 months ago
2004
Springer
Linear Pseudo-Boolean constraints offer a much more compact formalism to express significant boolean problems in several areas, ranging from Artificial Intelligence to Electroni...
136
click to vote
EOR
2008
15 years 4 months ago
2008
Multicut is a fundamental network communication and connectivity problem. It is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimu...
144
Voted
FOCS
2004
IEEE
15 years 8 months ago
2004
IEEE
We consider the approximate nearest neighbour search problem on the Hamming cube {0, 1}d. We show that a randomised cell probe algorithm that uses polynomial storage and word size...
140
click to vote
APPROX
2005
Springer
15 years 10 months ago
2005
Springer
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...