2434 search results - page 147 / 487 » Algorithmic Randomness of Closed Sets |
120
click to vote
CSL
2006
Springer
15 years 7 months ago
2006
Springer
We study observation-based strategies for two-player turn-based games on graphs with omega-regular objectives. An observation-based strategy relies on imperfect information about t...
161
Voted
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
— The automatic detection of failures in IP paths is an essential step for operators to perform diagnosis or for overlays to adapt. We study a scenario where a set of monitors se...
175
click to vote
ICRA
2005
IEEE
15 years 9 months ago
2005
IEEE
Abstract— We present a simple randomized POMDP algorithm for planning with continuous actions in partially observable environments. Our algorithm operates on a set of reachable b...
130
click to vote
ECCC
2006
15 years 3 months ago
2006
Detecting the relevant attributes of an unknown target concept is an important and well studied problem in algorithmic learning. Simple greedy strategies have been proposed that s...
154
Voted
CCS
2007
ACM
15 years 10 months ago
2007
ACM
A group key agreement protocol (GKA) allows a set of players to establish a shared secret key which can be used to secure a subsequent communication. Several efficient constantrou...