Results 161 to 170 of about 18,622 (181)
Some of the next articles are maybe not open access.
On the Counting Version of the Maximum 2-Satisfiability Problem
Mathematical Notesexaly +2 more sources
Monte-Carlo Tree Search for the Maximum Satisfiability Problem
2016Incomplete algorithms for the Maximum Satisfiability (MaxSAT) problem use a hill climbing approach in tandem with various mechanisms that prevent search stagnation. These solvers’ conflicting goals of maintaining search mobility while discovering high quality solutions constitute an exploration-exploitation dilemma, a problem which has been tackled ...
Jack Goffinet, Raghuram Ramanujan
openaire +1 more source
New local search approximation techniques for maximum generalized satisfiability problems
Information Processing Letters, 1994 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Paola Alimonti
openalex +3 more sources
Tight Bounds on Local Search to Approximate the Maximum Satisfiability Problems
, 2011 Maximum Satisfiability problem is the central problem in theoretical computer science. Local search has been testified to be effective in the practice to solve these problems. This paper presents new local search methods to solve the maximum satisfiability problems and analyzes the performance of the methods.
Daming Zhu, Shaohan Ma, Pingping Zhang
openalex +2 more sources
Journal of Information & Optimization Sciences
Maximum satisfiability (MaxSAT) and optimum satisfiability (OptSAT) problems are two optimization versions of the NP-complete Boolean satisfiability problem. In the literature, these versions have been described and tackled separately by using specialized solvers for each problem.
Anna Konovalenko +2 more
openaire +1 more source
Maximum satisfiability (MaxSAT) and optimum satisfiability (OptSAT) problems are two optimization versions of the NP-complete Boolean satisfiability problem. In the literature, these versions have been described and tackled separately by using specialized solvers for each problem.
Anna Konovalenko +2 more
openaire +1 more source
Cooperative Ant Colonies for Solving the Maximum Weighted Satisfiability Problem
Lecture Notes in Computer Science, 2003This paper presents a new generic Evolutionary Algorithm (EA) for retarding the unwanted effects of premature convergence. This is accomplished by a combination of interacting methods. To be intent on this a new selection scheme is introduced, which is designed to maintain the genetic diversity within the population by advantageous self-adaptive ...
Habiba Drias +2 more
exaly +2 more sources
A Neural Algorithm for the Maximum Satisfiability Problem
1993A Neural Algorithm for the Maximum Satisfiability ...
Maria Alberta Alberti +2 more
openaire +1 more source
Investigation of Maximum and Minimum Satisfiability Problems Using L-Partition
Automation and Remote Control, 2004zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources