79 search results - page 2 / 16 » A Recurrent Neural Network for Solving the Shortest Path Pro... |
100
Voted
ICANN
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. This paper presents Recurrent Policy Gradients, a modelfree reinforcement learning (RL) method creating limited-memory stochastic policies for partially observable Markov...
141
Voted
IWANN
1997
Springer
15 years 7 months ago
1997
Springer
: The path planning problem is relevant for all applications in which a mobil robot should autonomously navigate. Finding the shortest path in an environment that is only partialy ...
140
Voted
ACSC
2008
IEEE
15 years 5 months ago
2008
IEEE
Recurrent neural networks are able to store information about previous as well as current inputs. This "memory" allows them to solve temporal problems such as language r...
169
Voted
OL
2011
14 years 10 months ago
2011
In this paper, we study a minimum Connected Dominating Set problem (CDS) in wireless networks, which selects a minimum CDS with property that all intermediate nodes inside every pa...
140
Voted
PVLDB
2010
15 years 2 months ago
2010
The current widespread use of location-based services and GPS technologies has revived interest in very fast and scalable shortest path queries. We introduce a new shortest path q...