3475 search results - page 318 / 695 » Backbones in Optimization and Approximation |
209
click to vote
SIAMSC
2010
15 years 5 months ago
2010
We propose certified reduced basis methods for the efficient and reliable evaluation of a general output that is implicitly connected to a given parameterized input through the ha...
177
click to vote
TALG
2010
15 years 5 months ago
2010
We study the lower-bounded facility location problem, which generalizes the classical uncapacitated facility location problem in that it comes with lower bound constraints for the...
179
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
In the oblivious buy-at-bulk network design problem in a graph, the task is to compute a fixed set of paths for every pair of source-destination in the graph, such that any set of ...
158
click to vote
ICML
2003
IEEE
16 years 7 months ago
2003
IEEE
We consider incorporating action elimination procedures in reinforcement learning algorithms. We suggest a framework that is based on learning an upper and a lower estimates of th...
150
click to vote
STACS
2009
Springer
16 years 1 months ago
2009
Springer
We present a unified optimal semi-online algorithm for preemptive scheduling on uniformly related machines with the objective to minimize the makespan. This algorithm works for a...