Sciweavers

872 search results - page 113 / 175
» Extreme lower probabilities
Sort
View
COR
2006
129views more  COR 2006»
14 years 12 months ago
Game-theoretic analysis of an ancient Chinese horse race problem
This paper analyzes a legendary Chinese horse race problem involving the King of Qi and General Tianji which took place more than 2000 years ago. In this problem each player owns ...
Mingming Leng, Mahmut Parlar
RAS
2007
148views more  RAS 2007»
14 years 11 months ago
Including probabilistic target detection attributes into map representations
Range measuring sensors can play an extremely important role in robot navigation. All range measuring devices rely on a ‘detection criterion’ made in the presence of noise, to...
John Mullane, Ebi Jose, Martin David Adams, Wijeru...
SODA
2010
ACM
190views Algorithms» more  SODA 2010»
15 years 9 months ago
One-Counter Markov Decision Processes
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
Tomas Brazdil, Vaclav Brozek, Kousha Etessami, Ant...
QEST
2008
IEEE
15 years 6 months ago
Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...
Kousha Etessami, Dominik Wojtczak, Mihalis Yannaka...
MOBICOM
2004
ACM
15 years 5 months ago
Revisiting the TTL-based controlled flooding search: optimality and randomization
In this paper we consider the problem of searching for a node or an object (i.e., piece of data, file, etc.) in a large network. Applications of this problem include searching fo...
Nicholas B. Chang, Mingyan Liu