14774 search results - page 87 / 2955 » Computational complexity and evolutionary computation |
139
click to vote
AII
1989
15 years 7 months ago
1989
This paper surveys recent results concerning the inference of deterministic finite automata (DFAs). The results discussed determine the extent to which DFAs can be feasibly inferr...
162
click to vote
FOCS
2010
IEEE
15 years 1 months ago
2010
IEEE
Coin flipping is one of the most fundamental tasks in cryptographic protocol design. Informally, a coin flipping protocol should guarantee both (1) Completeness: an honest executi...
137
click to vote
CADE
2008
Springer
15 years 5 months ago
2008
Springer
Recent studies have provided many characterisations of the class of polynomial time computable functions through term rewriting techniques. In this paper we describe a (fully autom...
156
click to vote
ICC
2007
IEEE
15 years 10 months ago
2007
IEEE
— This paper addresses a low complexity frequency offset estimator for multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) systems over freque...
122
click to vote
WSC
2004
15 years 5 months ago
2004
This work provides a generalization of the traditional response surface methodology (RSM) that can be applied to complex, multi-objective simulation studies. These problems involv...