2168 search results - page 141 / 434 » Randomized Algorithms and Complexity Theory |
135
click to vote
COLT
1993
Springer
15 years 7 months ago
1993
Springer
We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using param...
150
click to vote
CORR
2010
Springer
14 years 10 months ago
2010
Springer
: In this paper, inspired by the work of Megiddo on the formation of preferences and strategic analysis, we consider an early market model studied in the field of economic theory, ...
108
click to vote
JPDC
2010
15 years 1 months ago
2010
This paper shows that shared coin algorithms can be combined to optimize several complexity measures, even in the presence of a strong adversary. By combining shared coins of Brac...
121
Voted
ATAL
2004
Springer
15 years 8 months ago
2004
Springer
Overhearing is gaining attention as a generic method for cooperative monitoring of distributed, open, multiagent systems. It involves monitoring the routine conversations of agent...
122
Voted
FSE
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. The need of true random number generators for many purposes (ranging from applications in cryptography and stochastic simulation, to search heuristics and game playing) i...