Sciweavers

5326 search results - page 233 / 1066
» On what we can ensure
Sort
View
EWRL
2008
15 years 8 months ago
Markov Decision Processes with Arbitrary Reward Processes
Abstract. We consider a control problem where the decision maker interacts with a standard Markov decision process with the exception that the reward functions vary arbitrarily ove...
Jia Yuan Yu, Shie Mannor, Nahum Shimkin
CCCG
2010
15 years 8 months ago
Connected dominating sets on dynamic geometric graphs
We propose algorithms for efficiently maintaining a constant-approximate minimum connected dominating set (MCDS) of a geometric graph under node insertions and deletions. Assuming...
Leonidas J. Guibas, Nikola Milosavljevic, Arik Mot...
AKA
2004
15 years 8 months ago
Towards a Generic Framework for Evaluating Component-Based Software Architectures
Abstract: The evaluation of software architectures is crucial to ensure that the design of software systems meets the requirements. We present a generic methodical framework that e...
Steffen Becker, Viktoria Firus, Simon Giesecke, Wi...
FUIN
2006
81views more  FUIN 2006»
15 years 6 months ago
Redundant Call Elimination via Tupling
Redundant call elimination has been an important program optimisation process as it can produce super-linear speedup in optimised programs. In this paper, we investigate use of the...
Wei-Ngan Chin, Siau-Cheng Khoo, Neil Jones
DPD
2007
84views more  DPD 2007»
15 years 6 months ago
Disseminating dependent data in wireless broadcast environments
In wireless mobile environments, data broadcasting is an effective approach to disseminate information to mobile clients. In some applications, the access pattern of all the data c...
Chuan-Ming Liu, Kun-Feng Lin