2657 search results - page 317 / 532 » On the complexity of hierarchical problem solving |
162
Voted
CP
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. The constraint satisfaction problem can be solved in polynomial time for instances where certain parameters (e.g., the treewidth of primal graphs) are bounded. However, t...
200
click to vote
EUROCRYPT
2010
Springer
15 years 10 months ago
2010
Springer
We present a family of verifiable random functions which are provably secure for exponentially-large input spaces under a non-interactive complexity assumption. Prior construction...
171
Voted
PE
2002
Springer
15 years 6 months ago
2002
Springer
Today many formalisms exist for specifying complex Markov chains. In contrast, formalisms for specifying rewards, enabling the analysis of long-run average performance properties,...
196
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Artificial neural networks have already shown their success in face recognition and similar complex pattern recognition tasks. However, a major disadvantage of the technique is th...
176
click to vote
IJON
2010
15 years 4 months ago
2010
Genetic Algorithms (GAs), as nondeterministic conformational search techniques, are promising for solving protein structure prediction (PSP) problems. The crossover operator of a ...