13603 search results - page 138 / 2721 » On the Computational Complexity of Cut-Reduction |
169
click to vote
GRID
2005
Springer
15 years 11 months ago
2005
Springer
In this paper we describe the architecture and initial performance analysis results of the SERVOGrid Complexity Computational Environments (CCE). The CCE architecture is based on ...
147
click to vote
GECCO
2004
Springer
15 years 11 months ago
2004
Springer
We discuss the computational complexity of random 2D Ising spin glasses, which represent an interesting class of constraint satisfaction problems for black box optimization. Two ex...
174
click to vote
CIE
2007
Springer
16 years 10 days ago
2007
Springer
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
181
click to vote
ICC
2007
IEEE
16 years 14 days 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...