628 search results - page 67 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
126
click to vote
ECML
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. Approximate Policy Iteration (API) is a reinforcement learning paradigm that is able to solve high-dimensional, continuous control problems. We propose to exploit API for...
163
click to vote
SDM
2012
SIAM
13 years 5 months ago
2012
SIAM
Many high-profile applications pose high-dimensional nearest-neighbor search problems. Yet, it still remains difficult to achieve fast query times for state-of-the-art approache...
132
click to vote
AAIM
2005
Springer
15 years 8 months ago
2005
Springer
Let G be a undirected connected graph. Given a set of g groups each being a subset of V (G), tree routing and coloring is to produce g trees in G and assign a color to each of them...
111
click to vote
CPAIOR
2010
Springer
15 years 8 months ago
2010
Springer
Constrained Optimum Path (COP) problems arise in many real-life applications and are ubiquitous in communication networks. They have been traditionally approached by dedicated algo...
130
click to vote
ITA
2007
15 years 3 months ago
2007
We study the problem of learning regular tree languages from text. We show that the framework of function distinguishability as introduced by the author in Theoretical Computer Sc...