Sciweavers

1341 search results - page 242 / 269
» Probabilistic Abstraction Hierarchies
Sort
View
FORMATS
2010
Springer
14 years 8 months ago
Expected Reachability-Time Games
In an expected reachability-time game (ERTG) two players, Min and Max, move a token along the transitions of a probabilistic timed automaton, so as to minimise and maximise, respec...
Vojtech Forejt, Marta Z. Kwiatkowska, Gethin Norma...
ISAAC
2010
Springer
253views Algorithms» more  ISAAC 2010»
14 years 8 months ago
Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut
Abstract. We consider the Steiner tree problem under a 2-stage stochastic model with recourse and finitely many scenarios (SSTP). Thereby, edges are purchased in the first stage wh...
Immanuel M. Bomze, Markus Chimani, Michael Jü...
103
Voted
MASS
2010
159views Communications» more  MASS 2010»
14 years 8 months ago
Real-time indoor mapping for mobile robots with limited sensing
Abstract--Mapping and localization for indoor robotic navigation is a well-studied field. However, existing work largely relies on long range perceptive sensors in addition to the ...
Ying Zhang, Juan Liu, Gabriel Hoffmann, Mark Quill...
84
Voted
EUSFLAT
2009
175views Fuzzy Logic» more  EUSFLAT 2009»
14 years 8 months ago
The Minimization of the Risk of Falling in Portfolios under Uncertainty
Abstract-- A portfolio model to minimize the risk of falling under uncertainty is discussed. The risk of falling is represented by the value-at-risk of rate of return. Introducing ...
Yuji Yoshida
91
Voted
ICRA
2009
IEEE
122views Robotics» more  ICRA 2009»
14 years 8 months ago
Utilizing reflection properties of surfaces to improve mobile robot localization
Abstract-- A main difficulty that arises in the context of probabilistic localization is the design of an appropriate observation model, i.e., determining the likelihood of a senso...
Maren Bennewitz, Cyrill Stachniss, Sven Behnke, Wo...