Results 151 to 160 of about 18,622 (181)
Some of the next articles are maybe not open access.
An effective heuristic algorithm for the maximum satisfiability problem
Applied Intelligence, 2006Stochastic local search algorithms (SLS) have been increasingly applied to approximate solutions of the weighted maximum satisfiability problem (MAXSAT), a model for solutions of major problems in AI and combinatorial optimization. While MAXSAT instances have generally a strong intrinsic dependency between their variables, most of SLS algorithms start ...
Mohamed El-bachir Menai +1 more
openaire +1 more source
New $\frac{3}{4}$-Approximation Algorithms for the Maximum Satisfiability Problem
SIAM Journal on Discrete Mathematics, 1994Summary: Yannakakis recently presented the first \({3\over 4}\)-approximation algorithm for the Maximum Satisfiability Problem (MAX SAT). His algorithm makes nontrivial use of solutions to maximum flow problems. New, simple \({3\over 4}\)-approximation algorithms that apply the probabilistic method/randomized rounding to the solution to a linear ...
David P Williamson
exaly +2 more sources
Solving disjunctive temporal problems with preferences using maximum satisfiability [PDF]
AI Communications, 2012 The Disjunctive Temporal Problem (DTP) involves conjunction of DTP constraints, each DTP constraint being a disjunction of difference constraints of the form x−y≤c, where x and y range over a domain of interpretation, and c is a numeric constant. The DTP is recognized to be an expressive framework for constraints modeling and processing.
Marco Maratea, Luca Pulina
openalex +5 more sources
DNA computing by competitive hybridization for maximum satisfiability problem
Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600), 2003We propose a strategy using competitive hybridization for DNA computing. DNA computing is a means of solving intractable computation problems such as NP-complete problems. In our strategy, each spot on a DNA microarray represents the candidate solution.
Yoichi Takenaka, Akihiro Hashimoto
openaire +1 more source
A New Artificial Immune System for Solving the Maximum Satisfiability Problem
, 2010 In this paper we investigate the use of Artificial Immune Systems' principles to cope with the satisfiability problem. We describe ClonSAT, a new iterative approach for solving the well known Maximum Satisfiability (Max-SAT) problem. This latter has been shown to be NP-hard if the number of variables per clause is greater than 3. The underlying idea is
Abdesslem Layeb +2 more
openalex +2 more sources
Maximum Satisfiability: Anatomy of the Fitness Landscape for a Hard Combinatorial Optimization Problem [PDF]
IEEE Transactions on Evolutionary Computation, 2012 The fitness landscape of MAX-3-SAT is investigated for random instances above the satisfiability phase transition. This paper includes a scaling analysis of the time to reach a local optimum, the number of local optima, the expected probability of reaching a local optimum as a function of its fitness, the expected fitness found by local search and the ...
Adam Prügel-Bennett
exaly +4 more sources
SIAM Journal on Computing, 2017
Summary: We give a simple, randomized greedy algorithm for the maximum satisfiability problem (MAX SAT) that obtains a \(\frac{3}{4}\)-approximation in expectation. In contrast to previously known \(\frac{3}{4}\)-approximation algorithms, our algorithm does not use flows or linear programming.
Matthias Poloczek, David P Williamson
exaly +2 more sources
Summary: We give a simple, randomized greedy algorithm for the maximum satisfiability problem (MAX SAT) that obtains a \(\frac{3}{4}\)-approximation in expectation. In contrast to previously known \(\frac{3}{4}\)-approximation algorithms, our algorithm does not use flows or linear programming.
Matthias Poloczek, David P Williamson
exaly +2 more sources
Cooperative Bees Swarm for Solving the Maximum Weighted Satisfiability Problem
, 2005 Solving a NP-Complete problem precisely is spiny: the combinative explosion is the ransom of this accurateness. It is the reason for which we have often resort to approached methods assuring the obtaining of a good solution in a reasonable time.
Habiba Drias, Souhila Sadeg, Safa Yahi
openalex +3 more sources
An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem
ACM Journal of Experimental Algorithmics, 2016We evaluate the performance of fast approximation algorithms for MAX SAT on the comprehensive benchmark sets from the SAT and MAX SAT contests. Our examination of a broad range of algorithmic techniques reveals that greedy algorithms offer particularly striking performance, delivering very good solutions at low computational cost.
Matthias Poloczek, David P. Williamson
openaire +2 more sources
Mixed-integer column generation algorithms and the probabilistic maximum satisfiability problem
European Journal of Operational Research, 1998zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pierre Hansen, Brigitte Jaumard
exaly +3 more sources