2266 search results - page 10 / 454 » Evolutionary Algorithms for the Satisfiability Problem |
83
Voted
GLOBECOM
2008
IEEE
15 years 3 months ago
2008
IEEE
—In this paper, we address the problem of establishing full connectivity and satisfying required traffic capacity between disconnected clusters in large wireless ad-hoc ground n...
SAC
2004
ACM
15 years 2 months ago
2004
ACM
It is increasingly important to optimally select base stations in the design of cellular networks, as customers demand cheaper and better wireless services. From a set of potentia...
CORR
2002
Springer
14 years 9 months ago
2002
Springer
: We study the satisfiability of randomly generated formulas formed by M clauses of exactly K literals over N Boolean variables. For a given value of N the problem is known to be m...
AMAI
2000
Springer
15 years 1 months ago
2000
Springer
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Comp...
KES
2007
Springer
14 years 9 months ago
2007
Springer
Abstract. This work presents an analysis of the static Aging operator for different evolutionary algorithms: two immunological algorithms (OptIA and Clonalg), a standard genetic a...