Sciweavers

28888 search results - page 114 / 5778
» Computability and complexity in analysis
Sort
View
CIE
2007
Springer
14 years 2 months ago
Computational Complexity of Constraint Satisfaction
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...
Heribert Vollmer
STOC
1993
ACM
141views Algorithms» more  STOC 1993»
14 years 4 days ago
Bounds for the computational power and learning complexity of analog neural nets
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
Wolfgang Maass
ICC
2007
IEEE
147views Communications» more  ICC 2007»
14 years 2 months ago
MIMO OFDM Frequency Offset Estimator with Low Computational Complexity
— This paper addresses a low complexity frequency offset estimator for multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) systems over freque...
Yanxiang Jiang, Xiaohu You, Xiqi Gao, Hlaing Minn
WSC
2004
13 years 9 months ago
A Generalized Multiple Response Surface Methodology for Complex Computer Simulation Applications
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...
Jeffrey B. Schamburg, Donald E. Brown
UC
2005
Springer
14 years 1 months ago
On Computational Complexity of Counting Fixed Points in Symmetric Boolean Graph Automata
Abstract. We study computational complexity of counting the fixed point configurations (FPs) in certain classes of graph automata viewed as discrete dynamical systems. We prove t...
Predrag T. Tosic, Gul A. Agha