13621 search results - page 32 / 2725 » Computability and Complexity in Self-assembly |
106
Voted
CIE
2007
Springer
15 years 5 months 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...
97
Voted
STOC
1993
ACM
15 years 3 months ago
1993
ACM
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...
100
Voted
ICC
2007
IEEE
15 years 5 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...
WSC
2004
15 years 8 days 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...
80
Voted
UC
2005
Springer
15 years 4 months ago
2005
Springer
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...