4843 search results - page 240 / 969 » The Shortcut Problem - Complexity and Approximation |
126
Voted
ICRA
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract— Least-squares policy iteration is a useful reinforcement learning method in robotics due to its computational efficiency. However, it tends to be sensitive to outliers...
146
Voted
STACS
2010
Springer
15 years 8 months ago
2010
Springer
Let G = (V, E) be any undirected graph on V vertices and E edges. A path P between any two vertices u, v ∈ V is said to be t-approximate shortest path if its length is at most t ...
109
Voted
ASIACRYPT
1999
Springer
15 years 8 months ago
1999
Springer
Problems of secure communication and computation have been studied extensively in network models. Goldreich, Goldwasser, and Linial, Franklin and Yung, and Franklin and Wright have...
144
Voted
SODA
1998
ACM
15 years 5 months ago
1998
ACM
Given a planar graph on n nodes with costs weights on its edges, de ne the distance between nodes i and j as the length of the shortest path between i and j. Consider this as an i...
108
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Let G = (V, E) be any undirected graph on V vertices and E edges. A path P between any two vertices u, v V is said to be t-approximate shortest path if its length is at most t tim...