1290 search results - page 215 / 258 » New algorithms of the Q-learning type |
CORR
1998
Springer
13 years 8 months ago
1998
Springer
We examine the computational complexity of testing and nding small plans in probabilistic planning domains with both at and propositional representations. The complexity of plan e...
MIG
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. Navigation meshes are commonly employed as a practical representation for path planning and other navigation queries in animated virtual environments and computer games. ...
NOMS
2010
IEEE
13 years 7 months ago
2010
IEEE
Abstract— Today’s networked systems are extensively instrumented for collecting a wealth of monitoring data. In this paper, we propose a framework called System-wide Similarity...
SDM
2010
SIAM
13 years 7 months ago
2010
SIAM
In this paper, we consider the problem of community detection in directed networks by using probabilistic models. Most existing probabilistic models for community detection are ei...
SPRINGSIM
2010
13 years 7 months ago
2010
Concise and reliable graph-theoretic analysis of complex networks today is a cumbersome task, consisting essentially of the adaptation of intricate libraries for each specific pr...