801 search results - page 19 / 161 » Computational intelligence in solving bioinformatics problem... |
132
click to vote
GECCO
2005
Springer
15 years 7 months ago
2005
Springer
Memetic algorithms have become to gain increasingly important for solving large scale combinatorial optimization problems. Typically, the extent of the application of local search...
153
click to vote
ICTAI
2009
IEEE
14 years 11 months ago
2009
IEEE
We propose a new method for solving structured CSPs which generalizes and improves the Cyclic-Clustering approach [4]. First, the cutset and the tree-decomposition of the constrai...
151
click to vote
ICC
2008
IEEE
15 years 8 months ago
2008
IEEE
—It is not possible to ensure that a network is absolutely secure. Therefore, network operators must continually change their defense strategies to counter attackers who constant...
199
click to vote
CP
2009
Springer
16 years 2 months ago
2009
Springer
Abstract. In this paper, we show how model-checking can be generalized to temporal logic constraint solving, by considering temporal logic formulae with free variables over some do...
115
click to vote
AAAI
2006
15 years 3 months ago
2006
The MAP (maximum a posteriori hypothesis) problem in Bayesian networks is to find the most likely states of a set of variables given partial evidence on the complement of that set...