7129 search results - page 726 / 1426 » Approximation Algorithms for Treewidth |
215
click to vote
SPAA
2004
ACM
16 years 16 days ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
212
click to vote
CGF
2006
15 years 7 months ago
2006
Spline curves are useful in a variety of geometric modeling and graphics applications and covering problems abound in practical settings. This work defines a class of covering dec...
177
click to vote
DATAMINE
2006
15 years 7 months ago
2006
To efficiently find global patterns from a multi-database, information in each local database must first be mined and summarized at the local level. Then only the summarized infor...
212
click to vote
ORL
2006
15 years 7 months ago
2006
The strategic safety stock placement problem is a constrained separable concave minimization problem and so is solvable, in principle, as a sequence of mixed-integer programming p...
196
click to vote
ICML
2009
IEEE
16 years 8 months ago
2009
IEEE
We consider the task of reinforcement learning with linear value function approximation. Temporal difference algorithms, and in particular the Least-Squares Temporal Difference (L...