Sciweavers

27 search results - page 1 / 6
» Using nondeterminism to amplify hardness
Sort
View
STOC
2004
ACM
86views Algorithms» more  STOC 2004»
14 years 5 months ago
Using nondeterminism to amplify hardness
We revisit the problem of hardness amplification in NP, as recently studied by O'Donnell (STOC `02). We prove that if NP has a balanced function f such that any circuit of si...
Alexander Healy, Salil P. Vadhan, Emanuele Viola
ISSRE
2000
IEEE
13 years 9 months ago
Testing Nondeterminate Systems
The behavior of nondeterminate systems can be hard to predict, since similar inputs at different times can generate different outputs. In other words, the behavior seen during tes...
Tim Menzies, Bojan Cukic, Harshinder Singh, John D...
WOSP
2010
ACM
13 years 11 months ago
Reducing performance non-determinism via cache-aware page allocation strategies
Performance non-determinism in computer systems complicates evaluation, use, and even development of these systems. In performance evaluation via benchmarking and simulation, nond...
Michal Hocko, Tomás Kalibera
COCO
2003
Springer
114views Algorithms» more  COCO 2003»
13 years 10 months ago
Bounded Nondeterminism and Alternation in Parameterized Complexity Theory
We give machine characterisations and logical descriptions of a number of parameterized complexity classes. The focus of our attention is the class W[P], which we characterise as ...
Yijia Chen, Jörg Flum, Martin Grohe
IPPS
2006
IEEE
13 years 11 months ago
Schedulability analysis of AR-TP, a Ravenscar compliant communication protocol for high-integrity distributed systems
A new token-passing algorithm called AR-TP for avoiding the non-determinism of some networking technologies is presented. This protocol allows the schedulability analysis of the n...
Santiago Urueña, Juan Zamorano, Daniel Berj...