19 search results - page 3 / 4 » On the Tree Width of Ada Programs |
CP
2007
Springer
14 years 1 months ago
2007
Springer
The typical constraint store transmits a limited amount of information because it consists only of variable domains. We propose a richer constraint store in the form of a limited-w...
BMCBI
2010
13 years 7 months ago
2010
Background: Today it is common to apply multiple potentially conflicting data sources to a given phylogenetic problem. At the same time, several different inference techniques are...
CSB
2005
IEEE
14 years 29 days ago
2005
IEEE
Searching genomes for RNA secondary structure with computational methods has become an important approach to the annotation of non-coding RNAs. However, due to the lack of effici...
AAAI
1994
13 years 8 months ago
1994
Neural networks were evolved through genetic algorithms to focus minimax search in the game of Othello. At each level of the search tree, the focus networks decide which moves are...
RECOMB
2005
Springer
14 years 7 months ago
2005
Springer
This paper proposes a novel tree decomposition based side-chain assignment algorithm, which can obtain the globally optimal solution of the side-chain packing problem very efficien...