Searching for "Maximum Satisfiability Problem." – sorted by Relevance.
95 documents found, showing 1 through 10.
Next 10 →
-
NEW-aa-APPROXIMATION ALGORITHMS FOR THE MAXIMUM SATISFIABILITY PROBLEM*
- … and Applied Mathematics 013 NEW -aa-APPROXIMATION ALGORITHMS FOR THE MAXIMUM SATISFIABILITY PROBLEM* MICHEL X…
- Add To MetaCart
-
Satisfiability Problems
- … Satisfiability Problems Richard J. Wallace and Eugene C. Freuder Department of Computer Science University…
- Cited by 17 (0 self) – Add To MetaCart
-
Trap Escaping Strategies in Discrete Lagrangian Methods for Solving Hard Satisfiability and Maximum
- … Satisfiability and Maximum Satisfiability Problems Zhe Wu and Benjamin W. Wah Department of Electrical…
- Cited by 21 (1 self) – Add To MetaCart
-
MAX-2-SAT: How Good is Tabu Search in the Worst-Case?
- … local search based methods for the maximum satisfiability problem. The practical superiority of tabu…
- Cited by 1 (0 self) – Add To MetaCart
-
New 3/4-Approximation Algorithms for MAX SAT
- … for the Maximum Satisfiability Problem (MAX SAT). His algorithm makes non-trivial use of solutions to maximum flow…
- Cited by 18 (5 self) – Add To MetaCart
-
Reactive Local Search Techniques for the Maximum k-Conjunctive Constraint Satisfaction Problem (MAX-k-CCSP)
- … algorithm (H-RTS) previously proposed for the Maximum Satisfiability problem is studied for the different…
- Cited by 2 (2 self) – Add To MetaCart
-
Improved Approximation Algorithms for MAX SAT
- … SAT (the maximum satisfiability problem) is stated as follows: given a set of clauses with weights…
- Cited by 28 (0 self) – Add To MetaCart
-
GRASP with path-relinking for the weighted MAXSAT problem
- …-quality solutions of the weighted maximum satisfiability problem (MAX-SAT) is described in this paper. GRASP…
- Cited by 5 (4 self) – Add To MetaCart
-
Approximating satisfiable satisfiability problems (Extended Abstract)
- …. We study the approximability of the Maximum Satisfiability Problem (Max SAT) and of the boolean k…
- Cited by 1 (1 self) – Add To MetaCart
-
Reactive Search, a history-based heuristic for MAX-SAT
- … for the approximated solution of the Maximum Satisfiability problem: a component based on local search with temporary…
- Cited by 21 (1 self) – Add To MetaCart
Showing 1 through 10.
Next 10 →
