28888 search results - page 112 / 5778 » Computability and complexity in analysis |
128
Voted
GECCO
2004
Springer
15 years 10 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...
252
Voted
ICLP
2009
Springer
16 years 5 months ago
2009
Springer
Abstract. A class of probabilistic-logic models is considered, which increases the expressibility from HMM's and SCFG's regular and contextfree languages to, in principle...
BIRTHDAY
2003
Springer
15 years 9 months ago
2003
Springer
28
Voted
FCT
1989
Springer
15 years 8 months ago
1989
Springer
CIE
2006
Springer
15 years 8 months ago
2006
Springer