724 search results - page 112 / 145 » Some Structural Complexity Aspects of Neural Computation |
FOCS
2007
IEEE
15 years 4 months ago
2007
IEEE
: It is well-known that constraint satisfaction problems (CSP) over an unbounded domain can be solved in time nO(k) if the treewidth of the primal graph of the instance is at most ...
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
In this paper, a model based on genetic algorithms for protein folding prediction is proposed. The most important features of the proposed approach are: i) Heuristic secondary str...
101
click to vote
PPSN
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. We explore a new general-purpose heuristic for nding highquality solutions to hard optimization problems. The method, called extremal optimization, is inspired by self-or...
114
click to vote
ASIAMS
2008
IEEE
14 years 11 months ago
2008
IEEE
The paper elaborates upon the interim results achieved in resolving a few newly discovered 16th century letters now alleged to be written by Queen Mary of Scots (QMS). Despite the...
BMCBI
2007
14 years 9 months ago
2007
Background: The search for enriched features has become widely used to characterize a set of genes or proteins. A key aspect of this technique is its ability to identify correlati...