1401 search results - page 153 / 281 » Randomness in Interactive Proofs |
NOMS
1998
IEEE
15 years 2 months ago
1998
IEEE
Network Management Forum (NMF) has defined a set of basic business processes dealing with major TMN service management functions such as performance management, fault management, b...
COCO
2009
Springer
15 years 4 months ago
2009
Springer
—The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to...
SIGECOM
2009
ACM
15 years 4 months ago
2009
ACM
Voting trees describe an iterative procedure for selecting a single vertex from a tournament. vide a very general abstract model of decision-making among a group of individuals, a...
GECCO
2007
Springer
15 years 4 months ago
2007
Springer
The runtime analysis of randomized search heuristics is a growing field where, in the last two decades, many rigorous results have been obtained. These results, however, apply pa...
CCS
2005
ACM
15 years 3 months ago
2005
ACM
We present a formal model and a simple architecture for robust pseudorandom generation that ensures resilience in the face of an observer with partial knowledge/control of the gen...