Results 21 to 30 of about 18,622 (181)
Negative Learning Ant Colony Optimization for MaxSAT
International Journal of Computational Intelligence Systems, 2022 Recently, a new negative learning variant of ant colony optimization (ACO) has been used to successfully tackle a range of combinatorial optimization problems.
Teddy Nurcahyadi +2 more
doaj +1 more source
A 2-approximation for the maximum satisfying bisection problem [PDF]
European Journal of Operational Research, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bernard Ries, Rico Zenklusen
openaire +3 more sources
Genetic Algorithm for Restricted Maximum k-Satisfiability in the Hopfield Network
International Journal of Interactive Multimedia and Artificial Intelligence, 2016 The restricted Maximum k-Satisfiability MAX- kSAT is an enhanced Boolean satisfiability counterpart that has attracted numerous amount of research. Genetic algorithm has been the prominent optimization heuristic algorithm to solve constraint optimization
Mohd Shareduwan Bin Mohd Kasihmuddin +2 more
doaj +1 more source
Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in SAT-Based Planning [PDF]
Logical Methods in Computer Science, 2007 In Verification and in (optimal) AI Planning, a successful method is to formulate the application as boolean satisfiability (SAT), and solve it with state-of-the-art DPLL-based procedures.
Joerg Hoffmann, Carla Gomes, Bart Selman
doaj +1 more source
Percolation of satisfiability in finite dimensions [PDF]
, 2003 The satisfiability and optimization of finite-dimensional Boolean formulas are studied using percolation theory, rare region arguments, and boundary effects.
A. Alan Middleton +9 more
core +3 more sources
On the shortest common parameterized supersequence problem [PDF]
, 2013 In this paper, we consider an approach to solve the problem of the shortest common parameterized supersequence. This approach is based on an explicit reduction from the shortest common parameterized supersequence problem to the 3-satisfiability problem ...
Gorbenko, A., Popov, V.
core +1 more source
MAX-SAT Problem using Hybrid Harmony Search Algorithm
Journal of Intelligent Systems, 2018 Maximum Satisfiability problem is an optimization variant of the Satisfiability problem (SAT) denoted as MAX-SAT. The aim of this problem is to find Boolean variable assignment that maximizes the number of satisfied clauses in the Boolean formula.
Abu Doush Iyad +3 more
doaj +1 more source
Boolean lexicographic optimization: algorithms & applications [PDF]
, 2011 Multi-Objective Combinatorial Optimization (MOCO) problems find a wide range of practical application problems, some of which involving Boolean variables and constraints.
Argelich Romà, Josep +3 more
core +1 more source
A Variable Neighborhood Walksat-Based Algorithm for MAX-SAT Problems
The Scientific World Journal, 2014 The simplicity of the maximum satisfiability problem (MAX-SAT) combined with its applicability in many areas of artificial intelligence and computing science made it one of the fundamental optimization problems.
Noureddine Bouhmala
doaj +1 more source
Hardness results for decoding the surface code with Pauli noise [PDF]
QuantumReal quantum computers will be subject to complicated, qubit-dependent noise, instead of simple noise such as depolarizing noise with the same strength for all qubits.
Alex Fischer, Akimasa Miyake
doaj +1 more source