2266 search results - page 5 / 454 » Evolutionary Algorithms for the Satisfiability Problem |
COCO
1998
Springer
15 years 1 months ago
1998
Springer
We show that the satisfiability problem for bounded-error probabilistic ordered branching programs is NP-complete. If the error is very small, however (more precisely, if the erro...
103
click to vote
IPPS
1999
IEEE
15 years 1 months ago
1999
IEEE
This paperpresents new resultson anapproach for solvingsatisfiability problems (SAT), that is, creating a logic circuit that is specialized to solve each problem instance on Field ...
GECCO
2008
Springer
14 years 10 months ago
2008
Springer
Quantum-inspired evolutionary algorithms (QIEAs), as a subset of evolutionary computation, are based on the principles of quantum computing such as quantum bits and quantum superp...
GECCO
2003
Springer
15 years 2 months ago
2003
Springer
Estimation of Distribution Algorithms (EDAs) are new promising methods in the field of genetic and evolutionary algorithms. In the case of conventional Genetic and Evolutionary Al...
IJCSA
2007
14 years 9 months ago
2007
A large number of problems that occur in knowledge-representation, learning, VLSI-design, and other areas of artificial intelligence, are essentially satisfiability problems. The ...