Search results for "Max-Sat"

Found 10 publication records. Showing 10 according to the selection in the facets

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Miquel Bofill, Dídac Busquets, Mateu Villaret	A declarative approach to robust weighted Max-SAT.	PPDP	2010	DBLP DOI BibTeX RDF	max-sat, robustness
1	Federico Heras, Javier Larrosa	A Max-SAT Inference-Based Pre-processing for Max-Clique.	SAT	2008	DBLP DOI BibTeX RDF	Max-clique, Inference, Max-SAT
1	Teresa Alsinet, Felip Manyà, Jordi Planes	An efficient solver for weighted Max-SAT.	J. Global Optimization	2008	DBLP DOI BibTeX RDF	Weighted Branch and bound, Data structures, Heuristics, Lower bound, Max-SAT
1	Fadi A. Aloul, Arathi Ramani, Karem A. Sakallah, Igor L. Markov	Solution and Optimization of Systems of Pseudo-Boolean Constraints.	IEEE Trans. Computers	2007	DBLP DOI BibTeX RDF	Pseudo Boolean (PB), Max-ONE, Global Routing, Conjunctive Normal Form (CNF), Backtrack Search, Integer Linear Programming (ILP), Max-SAT, Boolean Satisfiability (SAT)
1	Sylvain Darras, Gilles Dequen, Laure Devendeville, Chu Min Li	On Inconsistent Clause-Subsets for Max-SAT Solving.	CP	2007	DBLP DOI BibTeX RDF	Unit Propagation, Inconsistent Subset, Max-SAT
1	Josep Argelich, Felip Manyà	Exact Max-SAT solvers for over-constrained problems.	J. Heuristics	2006	DBLP DOI BibTeX RDF	Soft constraints, Solvers, Max-SAT
1	Teresa Alsinet, Felip Manyà, Jordi Planes	A Max-SAT Solver with Lazy Data Structures.	IBERAMIA	2004	DBLP DOI BibTeX RDF	data structures, heuristics, lower bound, branch and bound, Max-SAT
1	Johan Håstad	Some optimal inapproximability results.	J. ACM	2001	DBLP DOI BibTeX RDF	NP-hard optimization problems, max-sat, linear equations, Inapproximability, probabilistically checkable proofs
1	Sanjeev Mahajan, Ramesh Hariharan	Derandomizing Semidefinite Programming Based Approximation Algorithms.	FOCS	1995	DBLP DOI BibTeX RDF	semidefinite programming based approximation algorithms, Max k-Cut, Max-Dicut, Max-Bisection, k Vertex Coloring, polynomial time randomized algorithms, polynomial time deterministic algorithms, computational complexity, randomized algorithms, semidefinite programming, programming theory, NP-Complete problems, deterministic algorithms, Independent Set, randomised algorithms, Max-Cut, Max-Sat
1	Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, Mario Szegedy	Proof Verification and Hardness of Approximation Problems	FOCS	1992	DBLP DOI BibTeX RDF	approximation problems, polynomial-time probabilistic oracle machine, random bits, MAXSNP-hard, metric TSP, time complexity, NP, MAX-CUT, MAX-SAT, proof verification