172 search results - page 10 / 35 » Improved approximation for directed cut problems |
SIAMCOMP
2000
13 years 7 months ago
2000
We present a linear programming-based method for nding \gadgets", i.e., combinatorial structures reducing constraints of one optimization problem to constraints of another. A...
ICS
2000
Tsinghua U.
13 years 11 months ago
2000
Tsinghua U.
The Midimew network is an excellent contender for implementing the communication subsystem of a high performance computer. This network is an optimal 2D topology in the sense ther...
ESA
2008
Springer
13 years 9 months ago
2008
Springer
Metric Labeling problems have been introduced as a model for understanding noisy data with pair-wise relations between the data points. One application of labeling problems with pa...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
In this paper, we consider approximability issues of the following four problems: triangle packing, full sibling reconstruction, maximum profit coverage and 2-coverage. All of th...
ICML
2002
IEEE
14 years 8 months ago
2002
IEEE
One of the central challenges in reinforcement learning is to balance the exploration/exploitation tradeoff while scaling up to large problems. Although model-based reinforcement ...