2735 search results - page 142 / 547 » Comparing notions of randomness |
AAAI
1997
13 years 11 months ago
1997
This paper steps back from the standard infinite horizon formulation of reinforcement learning problems to consider the simpler case of finite horizon problems. Although finite ho...
ECCC
2006
13 years 10 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...
IJNSEC
2008
13 years 10 months ago
2008
In 1949, Shannon proved the perfect secrecy of the Vernam cryptographic system (One-Time Pad or OTP). It has generally been believed that the perfectly random and uncompressible O...
JNW
2006
13 years 10 months ago
2006
In ad hoc wireless LANs populated by mutually impenetrable groups of anonymous stations, honest stations are prone to "bandwidth stealing" by selfish stations. The proble...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
Calibrated strategies can be obtained by performing strategies that have no internal regret in some auxiliary game. Such strategies can be constructed explicitly with the use of B...