801 search results - page 33 / 161 » Computational intelligence in solving bioinformatics problem... |
109
click to vote
CP
2008
Springer
15 years 3 months ago
2008
Springer
Decomposition is a powerful technique for reducing the size of a backtracking search tree. However, when solving constraint optimization problems (COP's) the standard techniqu...
107
click to vote
CEC
2007
IEEE
15 years 8 months ago
2007
IEEE
— We present an ant model that solves a discrete foraging problem. We describe simulations and provide a complete convergence analysis: we show that the ant population computes t...
146
click to vote
AGP
2003
IEEE
15 years 7 months ago
2003
IEEE
Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and check” nature ...
107
click to vote
AI
2008
Springer
15 years 2 months ago
2008
Springer
Stochastic local search (SLS) algorithms have recently been proven to be among the best approaches to solving computationally hard problems. SLS algorithms typically have a number...
118
click to vote
WABI
2007
Springer
15 years 8 months ago
2007
Springer
Predicting the secondary structure of an RNA sequence is an important problem in structural bioinformatics. The general RNA folding problem, where the sequence to be folded may con...