• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 25,159
Next 10 →

A New Method for Solving Hard Satisfiability Problems

by Bart Selman, Hector Levesque, David Mitchell - 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

by M. X. Goemans, D.P. Williamson - 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

Satisfiability Problem

by Witold Pedrycz Giancarlo Succi
"... to the immense size of the search space in the SAT problem, ..."
Abstract - Add to MetaCart
to the immense size of the search space in the SAT problem,

On the satisfiability problem

by Xiaowang Zhang, Jan Van Den Bussche , 2014
"... ar ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Abstract not found

satisfiability problem

by Frédéric Lardeux
"... GASAT: a genetic local search algorithm for the ..."
Abstract - Add to MetaCart
GASAT: a genetic local search algorithm for the

On the Satisfiability Problem for Word Equations

by Wojciech Plandowski
"... We prove that satisfiability problem for word equations is in PSPACE. ..."
Abstract - Add to MetaCart
We prove that satisfiability problem for word equations is in PSPACE.

Approximating Satisfiable Satisfiability Problems

by Luca Trevisan - 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

by Dimitris Achlioptas, Carla Gomes, Henry Kautz, Bart Selman - 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

by Bart Selman, David Mitchell, Hector Levesque - 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

by Jens Gottlieb, Elena Marchiori, Claudio Rossi - 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
Next 10 →
Results 1 - 10 of 25,159
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University