Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
25,159
A New Method for Solving Hard Satisfiability Problems
- AAAI
, 1992
"... We introduce a greedy local search procedure called GSAT for solving propositional satisfiability problems. Our experiments show that this procedure can be used to solve hard, randomly generated problems that are an order of magnitude larger than those that can be handled by more traditional approac ..."
Abstract
-
Cited by 730 (21 self)
- Add to MetaCart
We introduce a greedy local search procedure called GSAT for solving propositional satisfiability problems. Our experiments show that this procedure can be used to solve hard, randomly generated problems that are an order of magnitude larger than those that can be handled by more traditional
Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming
- Journal of the ACM
, 1995
"... We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2-satisfiability (MAX 2SAT) problems that always deliver solutions of expected value at least .87856 times the optimal value. These algorithms use a simple and elegant technique that randomly rounds the solution ..."
Abstract
-
Cited by 1211 (13 self)
- Add to MetaCart
We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2-satisfiability (MAX 2SAT) problems that always deliver solutions of expected value at least .87856 times the optimal value. These algorithms use a simple and elegant technique that randomly rounds
On the Satisfiability Problem for Word Equations
"... We prove that satisfiability problem for word equations is in PSPACE. ..."
Approximating Satisfiable Satisfiability Problems
- In Proceedings of the 5th European Symposium on Algorithms
, 1997
"... We study the approximability of the Maximum Satisfiability Problem (Max SAT) and of the boolean k-ary Constraint Satisfaction Problem (Max kCSP) restricted to satisfiable instances. For both problems we improve on the performance ratios of known algorithms for the unrestricted case. Our approximatio ..."
Abstract
-
Cited by 19 (2 self)
- Add to MetaCart
We study the approximability of the Maximum Satisfiability Problem (Max SAT) and of the boolean k-ary Constraint Satisfaction Problem (Max kCSP) restricted to satisfiable instances. For both problems we improve on the performance ratios of known algorithms for the unrestricted case. Our
Generating satisfiable problem instances
- In AAAI/IAAI
, 2000
"... A major difficulty in evaluating incomplete local search style algorithms for constraint satisfaction problems is the need for a source of hard problem instances that are guaranteed to be satisfiable. A standard approach to evaluate incomplete search methods has been to use a general problem generat ..."
Abstract
-
Cited by 92 (11 self)
- Add to MetaCart
A major difficulty in evaluating incomplete local search style algorithms for constraint satisfaction problems is the need for a source of hard problem instances that are guaranteed to be satisfiable. A standard approach to evaluate incomplete search methods has been to use a general problem
Generating Hard Satisfiability Problems
- Artificial Intelligence
, 1996
"... We report results from large-scale experiments in satisfiability testing. As has been observed by others, testing the satisfiability of random formulas often appears surprisingly easy. Here we show that by using the right distribution of instances, and appropriate parameter values, it is possible ..."
Abstract
-
Cited by 108 (2 self)
- Add to MetaCart
We report results from large-scale experiments in satisfiability testing. As has been observed by others, testing the satisfiability of random formulas often appears surprisingly easy. Here we show that by using the right distribution of instances, and appropriate parameter values
Evolutionary algorithms for the satisfiability problem
- Evolutionary Computation
, 2002
"... Several evolutionary algorithms have been proposed for the satisfiability problem. We review the solution representations suggested in literature and choose the most promising one – the bit string representation – for further evaluation. An empirical comparison on commonly used benchmarks is present ..."
Abstract
-
Cited by 27 (1 self)
- Add to MetaCart
Several evolutionary algorithms have been proposed for the satisfiability problem. We review the solution representations suggested in literature and choose the most promising one – the bit string representation – for further evaluation. An empirical comparison on commonly used benchmarks
Results 1 - 10
of
25,159
