2266 search results - page 188 / 454 » Evolutionary Algorithms for the Satisfiability Problem |
147
click to vote
WEA
2010
Springer
15 years 7 months ago
2010
Springer
We investigate how the recently developed different approaches to generate randomized roundings satisfying disjoint cardinality constraints behave when used in two classical algori...
141
click to vote
PRICAI
1998
Springer
15 years 6 months ago
1998
Springer
Many real-world constraint satisfaction problems (CSPs) can be over-constrained but contain a set of mandatory or hard constraints that have to be satisfied for a solution to be ac...
IWANN
2009
Springer
15 years 8 months ago
2009
Springer
This paper proposes a new evolutionary method for generating ANNs. In this method, a simple real-number string is used to codify both architecture and weights of the networks. Ther...
MP
2007
15 years 1 months ago
2007
We present a practical approach to Anstreicher and Lee’s masked spectral bound for maximum-entropy sampling, and we describe favorable results that we have obtained with a Branch...
119
click to vote
EVOW
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. In this paper we address the problem of finding gene regulatory networks from experimental DNA microarray data. We introduce enhancements to an Evolutionary Algorithm op...