Sciweavers

10 search results - page 1 / 2
» The on-line shortest path problem under partial monitoring
Sort
View
ALT
2006
Springer
13 years 8 months ago
Hannan Consistency in On-Line Learning in Case of Unbounded Losses Under Partial Monitoring
In this paper the sequential prediction problem with expert advice is considered when the loss is unbounded under partial monitoring scenarios. We deal with a wide class of the par...
Chamy Allenberg, Peter Auer, László ...
DEDS
2008
87views more  DEDS 2008»
13 years 4 months ago
On-Line Monitoring of Large Petri Net Models Under Partial Observation
This paper deals with the on-line monitoring of large systems modeled as Petri Nets under partial observation. The plant observation is given by a subset of transitions whose occu...
George Jiroveanu, René K. Boel, Behzad Bord...
COLT
2006
Springer
13 years 6 months ago
The Shortest Path Problem Under Partial Monitoring
András György, Tamás Linder, Gy...
CORR
2007
Springer
91views Education» more  CORR 2007»
13 years 4 months ago
The on-line shortest path problem under partial monitoring
András György, Tamás Linder, G&...
JCP
2007
111views more  JCP 2007»
13 years 4 months ago
Partially Dynamic Algorithms for Distributed Shortest Paths and their Experimental Evaluation
— In this paper, we study the dynamic version of the distributed all-pairs shortest paths problem. Most of the solutions given in the literature for this problem, either (i) work...
Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele ...