79 search results - page 2 / 16 » A Recurrent Neural Network for Solving the Shortest Path Pro... |
ICANN
2007
Springer
13 years 11 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...
IWANN
1997
Springer
13 years 9 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 ...
ACSC
2008
IEEE
13 years 7 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...
OL
2011
13 years 7 days 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...
PVLDB
2010
13 years 3 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...