7129 search results - page 923 / 1426 » Approximation Algorithms for Treewidth |
148
click to vote
JMLR
2010
14 years 11 months ago
2010
Round-based games are an instance of discrete planning problems. Some of the best contemporary game tree search algorithms use random roll-outs as data. Relying on a good policy, ...
137
Voted
JMLR
2010
14 years 11 months ago
2010
Virtually all methods of learning dynamic systems from data start from the same basic assumption: the learning algorithm will be given a sequence of data generated from the dynami...
145
click to vote
SIAMCO
2010
14 years 11 months ago
2010
Abstract. We establish results for the problem of tracking a time-dependent manifold arising in realtime optimization by casting this as a parametric generalized equation. We demon...
186
click to vote
SIAMNUM
2010
14 years 11 months ago
2010
A straightforward discretisation of problems in d spatial dimensions often leads to an exponential growth in the number of degrees of freedom. Thus, even efficient algorithms like ...
160
click to vote
TOG
2010
14 years 11 months ago
2010
Accurately rendering glossy materials in design applications, where previewing and interactivity are important, remains a major challenge. While many fast global illumination solu...