3049 search results - page 576 / 610 » On the Convergence of Bound Optimization Algorithms |
142
click to vote
DOCENG
2006
ACM
15 years 12 months ago
2006
ACM
With the development of variable-data-driven digital presses where each document printed is potentially unique there is a need for pre-press optimization to identify material that...
170
click to vote
ECAL
2005
Springer
15 years 11 months ago
2005
Springer
We present an example of the dynamical systems approach to learning and adaptation. Our goal is to explore how both control and learning can be embedded into a single dynamical sys...
179
click to vote
ESA
2005
Springer
15 years 11 months ago
2005
Springer
This paper investigates, for the first time in the literature, the approximation of min-max (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
168
click to vote
SIGECOM
2004
ACM
15 years 11 months ago
2004
ACM
In many market settings, agents do not know their preferences a priori. Instead, they may have to solve computationally complex optimization problems, query databases, or perform ...
142
click to vote
ISAAC
2004
Springer
15 years 11 months ago
2004
Springer
We consider two multicriteria versions of the global minimum cut problem in undirected graphs. In the k-criteria setting, each edge of the input graph has k non-negative costs ass...