Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

39

JGAA
2010

favoriteEmaildiscussreport

51views more JGAA 2010»

New complexity results for time-constrained dynamical optimal path problems

13 years 9 months ago

New complexity results for time-constrained dynamical optimal path problems

Download jgaa.info

Sebastian Kluge, Martin Brokate, Konrad Reif

Real-time Traffic

JGAA 2010 |

claim paper

Related Content

» TimeConstrained Scheduling of Weighted Packets on Trees and Meshes

» New results on the computability and complexity of points to analysis

» New dynamic programming algorithms for the resource constrained elementary shortest path p...

» A new approach to dynamic all pairs shortest paths

» Approximation Complexity of minmax Regret Versions of Shortest Path Spanning Tree and Knap...

» Pointbased backup for decentralized POMDPs complexity and new algorithms

» An Improved Integer Local Search for Complex Scheduling Problems

» Dynamic bandwidth reservation for label switched paths An online predictive approach

» A Generalized Path Integral Control Approach to Reinforcement Learning

Post Info
More Details (n/a)

Added	28 Jan 2011
Updated	28 Jan 2011
Type	Journal
Year	2010
Where	JGAA
Authors	Sebastian Kluge, Martin Brokate, Konrad Reif

Comments (0)