Sciweavers

3415 search results - page 620 / 683
» Lower Bounds for Kernelizations
Sort
View
AIPS
2010
14 years 9 days ago
When Policies Can Be Trusted: Analyzing a Criteria to Identify Optimal Policies in MDPs with Unknown Model Parameters
Computing a good policy in stochastic uncertain environments with unknown dynamics and reward model parameters is a challenging task. In a number of domains, ranging from space ro...
Emma Brunskill
PODS
2010
ACM
228views Database» more  PODS 2010»
13 years 11 months ago
Capturing missing tuples and missing values
Databases in real life are often neither entirely closed-world nor entirely open-world. Indeed, databases in an enterprise are typically partially closed, in which a part of the d...
Wenfei Fan, Floris Geerts
ICCCN
2007
IEEE
13 years 11 months ago
Greedy Face Routing with Face ID Support in Wireless Networks
—Geographic face routing provides an attractive way for packet delivery in wireless networks due to its high reliability and low overhead. A good face routing protocol should pro...
Shao Tao, Akkihebbal L. Ananda, Mun Choon Chan
FORMATS
2008
Springer
13 years 11 months ago
Timed Parity Games: Complexity and Robustness
We consider two-player games played in real time on game structures with clocks and parity objectives. The games are concurrent in that at each turn, both players independently pro...
Krishnendu Chatterjee, Thomas A. Henzinger, Vinaya...
IPCO
2010
125views Optimization» more  IPCO 2010»
13 years 11 months ago
A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information
Abstract. We consider two-person zero-sum stochastic mean payoff games with perfect information, or BWR-games, given by a digraph G = (V = VB VW VR, E), with local rewards r : E R...
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvic...