Results 1 to 10 of about 18,622 (181)
Quantum Algorithm for Variant Maximum Satisfiability [PDF]
Entropy, 2022 In this paper, we proposed a novel quantum algorithm for the maximum satisfiability problem. Satisfiability (SAT) is to find the set of assignment values of input variables for the given Boolean function that evaluates this function as TRUE or prove that
Abdirahman Alasow +2 more
doaj +4 more sources
A Multilevel Tabu Search for the Maximum Satisfiability Problem
International Journal of Communications, Network and System Sciences, 2012 The maximum satisfiability problem (MAX-SAT) refers to the task of finding a variable assignment that satisfies the maximum number of clauses (or the sum of weight of satisfied clauses) in a Boolean Formula. Most local search algorithms including tabu search rely on the 1-flip neighbourhood structure.
Noureddine Bouhmala
exaly +4 more sources
Initial Solution Generation and Diversified Variable Picking in Local Search for (Weighted) Partial MaxSAT [PDF]
Entropy, 2022 The (weighted) partial maximum satisfiability ((W)PMS) problem is an important generalization of the classic problem of propositional (Boolean) satisfiability with a wide range of real-world applications. In this paper, we propose an initialization and a
Zaijun Zhang +4 more
doaj +2 more sources
Multilevel techniques and learning automata for the Maximum Satisfiability (MAXSAT) problem [PDF]
, 2012 The Maximum Satisfiability (MAXSAT) Problem is a propositional logic and an optimization based problem that has great importance in the theoretical and practical domain. In the recent years MAXSAT has risen great interest in the industry.
Brådland, Øystein, Oseland, Mats G.L.
core +2 more sources
Solving Restricted Preemptive Scheduling on Parallel Machines with SAT and PMS [PDF]
Journal of Universal Computer Science, 2023 Restricted preemption plays a crucial role in reducing total completion time while controlling preemption overhead. A typical version of restricted preemptive models is k-restricted preemptive scheduling, where preemption is only allowed after a task has
Xiaojuan Liao +4 more
doaj +3 more sources
Revisiting Maximum Satisfiability and Related Problems in Data Streams
Lecture Notes in Computer Science, 2023 Hoa T. Vu
exaly +2 more sources
Finite-rate sparse quantum codes aplenty [PDF]
Quantum, 2023 We introduce a methodology for generating random multi-qubit stabilizer codes based on solving a constraint satisfaction problem (CSP) on random bipartite graphs.
Maxime Tremblay +2 more
doaj +1 more source
Dynamic Initial Weight Assignment for MaxSAT
Algorithms, 2021 The Maximum Satisfiability (Maximum Satisfiability (MaxSAT)) approach is the choice, and perhaps the only one, to deal with most real-world problems as most of them are unsatisfiable.
Abdelraouf Ishtaiwi, Qasem Abu Al-Haija
doaj +1 more source
Clausal Forms in MaxSAT and MinSAT
International Journal of Computational Intelligence Systems, 2022 We tackle the problem of reducing non-clausal MaxSAT and MinSAT to clausal MaxSAT and MinSAT. Our motivation is twofold: (i) the clausal form transformations used in SAT are unsound for MaxSAT and MinSAT, because they do not preserve the minimum or ...
Chu Min Li +3 more
doaj +1 more source
An Efficient Steady-State Analysis Method for Large Boolean Networks with High Maximum Node Connectivity. [PDF]
PLoS ONE, 2015 Boolean networks have been widely used to model biological processes lacking detailed kinetic information. Despite their simplicity, Boolean network dynamics can still capture some important features of biological systems such as stable cell phenotypes ...
Changki Hong +3 more
doaj +1 more source