453 search results - page 73 / 91 » Tight bounds for the partial-sums problem |
96
Voted
ADAEUROPE
2004
Springer
15 years 6 months ago
2004
Springer
The tree width of a graph G measures how close G is to being a tree or a series-parallel graph. Many well-known problems that are otherwise NP-complete can be solved efficiently if...
73
Voted
COLT
2004
Springer
15 years 6 months ago
2004
Springer
We consider the problem of learning a general graph using edge-detecting queries. In this model, the learner may query whether a set of vertices induces an edge of the hidden grap...
104
click to vote
CPAIOR
2010
Springer
15 years 4 months ago
2010
Springer
Cutting plane methods are widely used for solving convex optimization problems and are of fundamental importance, e.g., to provide tight bounds for Mixed-Integer Programs (MIPs). T...
102
Voted
AAAI
1993
15 years 2 months ago
1993
This paper analyzes the complexity of on-line reinforcement learning algorithms, namely asynchronous realtime versions of Q-learning and value-iteration, applied to the problem of...
90
Voted
MOR
2002
15 years 10 days ago
2002
We present a polyhedral study of the complementarity knapsack problem. Traditionally, complementarity constraints are modeled by introducing auxiliary binary variables and additio...