1450 search results - page 159 / 290 » On the Complexity of Hardness Amplification |
184
click to vote
SEKE
2004
Springer
15 years 11 months ago
2004
Springer
One of the challenging research problems in validating a software engineering methodology (SEM), and a part of its validation process, is to answer “How to fairly collect, presen...
139
click to vote
STACS
2004
Springer
15 years 11 months ago
2004
Springer
Motivated by a scheduling problem encountered in multicast environments, we study a vertex labelling problem, called Directed Circular Arrangement (DCA), that requires one to fin...
147
click to vote
CEC
2003
IEEE
15 years 11 months ago
2003
IEEE
Learning Deterministic Finite Automata (DFA) is a hard task that has been much studied within machine learning and evolutionary computation research. This paper presents a new met...
184
click to vote
DSN
2003
IEEE
15 years 11 months ago
2003
IEEE
Energy constrained complex real-time systems are becoming increasingly important in defense, space, and consumer applications. In this paper, we present a sensible heuristic to ad...
181
click to vote
FOCS
2003
IEEE
15 years 11 months ago
2003
IEEE
We show that Yao’s XOR Lemma, and its essentially equivalent rephrasing as a Direct Product Lemma, can be re-interpreted as a way of obtaining error-correcting codes with good l...