Search results for "Max-CSP"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
104	Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà	Encoding Max-CSP into Partial Max-SAT.	ISMVL	2008	DBLP DOI BibTeX RDF	Minimal Support, Max-CSP, Partial Max-SAT, Encodings
90	Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen	Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems.	CSR	2007	DBLP DOI BibTeX RDF	maximum constraint satisfaction, complexity, approximability
77	Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà	Modelling Max-CSP as Partial Max-SAT.	SAT	2008	DBLP DOI BibTeX RDF
74	David A. Cohen, Martin C. Cooper, Peter Jeavons 0001, Andrei A. Krokhin	Identifying Efficiently Solvable Cases of Max CSP.	STACS	2004	DBLP DOI BibTeX RDF
53	Thierry Petit, Jean-Charles Régin, Christian Bessière	Meta-constraints on violations for over constrained problems.	ICTAI	2000	DBLP DOI BibTeX RDF	meta constraints, over constrained problems, Max-CSP, real-life problems, constraint programming, constraint handling, communicating sequential processes, real-world problems
50	Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà	Sequential Encodings from Max-CSP into Partial Max-SAT.	SAT	2009	DBLP DOI BibTeX RDF
48	Vladimir G. Deineko, Peter Jonsson, Mikael Klasson, Andrei A. Krokhin	The approximability of MAX CSP with fixed-value constraints.	J. ACM	2008	DBLP DOI BibTeX RDF	Complexity of approximation, maximum constraint satisfaction, dichotomy, Monge properties, supermodularity
48	Thierry Petit, Jean-Charles Régin, Christian Bessière	Range-Based Algorithm for Max-CSP.	CP	2002	DBLP DOI BibTeX RDF
43	Simon de Givry, Javier Larrosa, Pedro Meseguer, Thomas Schiex	Solving Max-SAT as Weighted CSP.	CP	2003	DBLP DOI BibTeX RDF
42	Jean-Marie Normand, Alexandre Goldsztejn, Marc Christie, Frédéric Benhamou	A Branch and Bound Algorithm for Numerical MAX-CSP.	CP	2008	DBLP DOI BibTeX RDF
40	Thomas Schiex	Arc Consistency for Soft Constraints.	CP	2000	DBLP DOI BibTeX RDF
39	Gustav Hast	Beating a Random Assignment.	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
35	Madalina Ionita, Cornelius Croitoru, Mihaela Breaban	Incorporating Inference into Evolutionary Algorithms for Max-CSP.	Hybrid Metaheuristics	2006	DBLP DOI BibTeX RDF
35	Mohand Ou Idir Khemmoudj, Hachemi Bennaceur	Clique Inference Process for Solving Max-CSP.	CP	2006	DBLP DOI BibTeX RDF
35	Rafael Ceballos, Rafael M. Gasca, Carmelo Del Valle, Miguel Toro	Max-CSP Approach for Software Diagnosis.	IBERAMIA	2002	DBLP DOI BibTeX RDF
35	Kalev Kask	New Search Heuristics for Max-CSP.	CP	2000	DBLP DOI BibTeX RDF
31	Josep Argelich, Felip Manyà	Exact Max-SAT solvers for over-constrained problems.	J. Heuristics	2006	DBLP DOI BibTeX RDF	Soft constraints, Solvers, Max-SAT
31	Xi Chen 0001, Chenghao Guo, Emmanouil V. Vlatakis-Gkaragkounis, Mihalis Yannakakis, Xinzhi Zhang 0002	Smoothed complexity of local max-cut and binary max-CSP.	STOC	2020	DBLP DOI BibTeX RDF
31	Xi Chen 0001, Chenghao Guo, Emmanouil V. Vlatakis-Gkaragkounis, Mihalis Yannakakis, Xinzhi Zhang 0002	Smoothed complexity of local Max-Cut and binary Max-CSP.	CoRR	2019	DBLP BibTeX RDF
31	Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà	Regular Encodings from Max-CSP into Partial Max-SAT.	ISMVL	2009	DBLP DOI BibTeX RDF
31	Alex D. Scott, Gregory B. Sorkin	Faster Algorithms for MAX CUT and MAX CSP, with Polynomial Expected Time for Sparse Instances.	RANDOM-APPROX	2003	DBLP DOI BibTeX RDF
27	Martin C. Cooper	High-Order Consistency in Valued Constraint Satisfaction.	Constraints An Int. J.	2005	DBLP DOI BibTeX RDF	discrete optimisation, valued constraint satisfaction, consistency enforcing, MAX-CSP, soft constraints
26	Andrei A. Krokhin, Benoît Larose	Maximum Constraint Satisfaction on Diamonds.	CP	2005	DBLP DOI BibTeX RDF
26	Rina Dechter, Kalev Kask, Javier Larrosa	A General Scheme for Multiple Lower Bound Computation in Constraint Optimization.	CP	2001	DBLP DOI BibTeX RDF
26	Jean-Charles Régin, Thierry Petit, Christian Bessière, Jean-Francois Puget	New Lower Bounds of Constraint Violations for Over-Constrained Problems.	CP	2001	DBLP DOI BibTeX RDF
26	Meriema Belaidouni, Jin-Kao Hao	An Analysis of the Configuration Space of the Maximal Constraint Satisfaction Problem.	PPSN	2000	DBLP DOI BibTeX RDF
26	Javier Larrosa	Boosting Search with Variable Elimination.	CP	2000	DBLP DOI BibTeX RDF
24	Josep Argelich, Felip Manyà	Solving Over-Constrained Problems with SAT Technology.	SAT	2005	DBLP DOI BibTeX RDF
22	Bart M. P. Jansen, Michal Wlodarczyk 0001	Optimal Polynomial-Time Compression for Boolean Max CSP.	ACM Trans. Comput. Theory	2024	DBLP DOI BibTeX RDF
22	Bart M. P. Jansen, Michal Wlodarczyk 0001	Optimal polynomial-time compression for Boolean Max CSP.	CoRR	2020	DBLP BibTeX RDF
22	Bart M. P. Jansen, Michal Wlodarczyk 0001	Optimal Polynomial-Time Compression for Boolean Max CSP.	ESA	2020	DBLP DOI BibTeX RDF
22	Martin C. Cooper, Guillaume Escamocher, Stanislav Zivný	A Characterisation of the Complexity of Forbidding Subproblems in Binary Max-CSP.	CP	2012	DBLP DOI BibTeX RDF
22	Jean-Marie Normand, Alexandre Goldsztejn, Marc Christie, Frédéric Benhamou	A branch and bound algorithm for numerical Max-CSP.	Constraints An Int. J.	2010	DBLP DOI BibTeX RDF
22	Mohand Ou Idir Khemmoudj, Hachemi Bennaceur	Clique inference process for solving Max-CSP.	Eur. J. Oper. Res.	2009	DBLP DOI BibTeX RDF
22	Hachemi Bennaceur, Christophe Lecoutre, Olivier Roussel	A Decomposition Technique for Max-CSP.	ECAI	2008	DBLP DOI BibTeX RDF
22	Wenceslas Fernandez de la Vega, Ravi Kannan, Marek Karpinski	Approximation of Global MAX-CSP Problems.	Electron. Colloquium Comput. Complex.	2006	DBLP BibTeX RDF
22	Wenceslas Fernandez de la Vega, Marek Karpinski	Trading Tensors for Cloning: Constant Time Approximation Schemes for Metric MAX-CSP.	Electron. Colloquium Comput. Complex.	2006	DBLP BibTeX RDF
22	Vladimir G. Deineko, Peter Jonsson, Mikael Klasson, Andrei A. Krokhin	The approximability of MAX CSP with fixed-value constraints	CoRR	2006	DBLP BibTeX RDF
22	Peter Jonsson, Mikael Klasson, Andrei A. Krokhin	The Approximability of Three-valued MAX CSP.	SIAM J. Comput.	2006	DBLP DOI BibTeX RDF
22	David A. Cohen, Martin C. Cooper, Peter Jeavons 0001, Andrei A. Krokhin	Supermodular functions and the complexity of MAX CSP.	Discret. Appl. Math.	2005	DBLP DOI BibTeX RDF
22	Peter Jonsson, Mikael Klasson, Andrei A. Krokhin	The approximability of three-valued MAX CSP	CoRR	2004	DBLP BibTeX RDF
22	Mayur Datar, Tomás Feder, Aristides Gionis, Rajeev Motwani 0001, Rina Panigrahy	A combinatorial algorithm for MAX CSP.	Inf. Process. Lett.	2003	DBLP DOI BibTeX RDF
22	Hachemi Bennaceur, Aomar Osmani	Computing Lower Bound for MAX-CSP Problems.	IEA/AIE	2003	DBLP DOI BibTeX RDF
22	Javier Larrosa, Pedro Meseguer	Partition-Based Lower Bound for Max-CSP.	Constraints An Int. J.	2002	DBLP DOI BibTeX RDF
22	R. Cevallos, Rafael M. Gasca, Carmelo Del Valle, Miguel Toro	Diagnosis de Software usando técnicas Max-CSP.	JISBD	2002	DBLP BibTeX RDF
22	Noga Alon, Wenceslas Fernandez de la Vega, Ravi Kannan, Marek Karpinski	Random sampling and approximation of MAX-CSP problems.	STOC	2002	DBLP DOI BibTeX RDF
22	Noga Alon, Wenceslas Fernandez de la Vega, Ravi Kannan, Marek Karpinski	Random Sampling and Approximation of MAX-CSP Problems	Electron. Colloquium Comput. Complex.	2001	DBLP BibTeX RDF
22	Javier Larrosa, Pedro Meseguer, Thomas Schiex	Maintaining Reversible DAC for Max-CSP.	Artif. Intell.	1999	DBLP DOI BibTeX RDF
22	Javier Larrosa, Pedro Meseguer	Partition-Based Lower Bound for Max-CSP.	CP	1999	DBLP DOI BibTeX RDF
22	Javier Larrosa, Pedro Meseguer, Thomas Schiex, Gérard Verfaillie	Reversible DAC and Other Improvements for Solving Max-CSP.	AAAI/IAAI	1998	DBLP BibTeX RDF
22	Mohamed-Salah Affane, Hachemi Bennaceur	A Weighted Arc Consistency Technique for MAX-CSP.	ECAI	1998	DBLP BibTeX RDF
22	Javier Larrosa, Pedro Meseguer	Partial Lazy Forward Checking for MAX-CSP.	ECAI	1998	DBLP BibTeX RDF
22	Javier Larrosa, Pedro Meseguer	Phase Transition in MAX-CSP.	ECAI	1996	DBLP BibTeX RDF
22	Javier Larrosa, Pedro Meseguer	Exploiting the Use of DAC in MAX-CSP.	CP	1996	DBLP DOI BibTeX RDF
20	Jean-Philippe Métivier, Patrice Boizumault, Samir Loudni	All Different: Softening AllDifferent in Weighted CSPs.	ICTAI (1)	2007	DBLP DOI BibTeX RDF
20	Javier Larrosa, Rina Dechter	Boosting Search with Variable Elimination in Constraint Optimization and Constraint Satisfaction Problems.	Constraints An Int. J.	2003	DBLP DOI BibTeX RDF	bucket elimination, constraint satisfaction, branch and bound, soft constraints, constraint optimization
18	Federico Heras, Javier Larrosa	Intelligent variable orderings and re-orderings in DAC-based solvers for WCSP.	J. Heuristics	2006	DBLP DOI BibTeX RDF	Weighted CSPs, Local consistency
13	Amin Coja-Oghlan, Colin Cooper, Alan M. Frieze	An efficient sparse regularity concept.	SODA	2009	DBLP DOI BibTeX RDF
13	Mihaela Breaban, Madalina Ionita, Cornelius Croitoru	A new PSO approach to constraint satisfaction.	IEEE Congress on Evolutionary Computation	2007	DBLP DOI BibTeX RDF
13	Madalina Ionita, Mihaela Breaban, Cornelius Croitoru	A New Scheme of Using Inference Inside Evolutionary Computation Techniques to Solve CSPs.	SYNASC	2006	DBLP DOI BibTeX RDF
13	Sadok Bouamama, Jlifi Boutheina, Khaled Ghédira	D2G2A: A Distributed Double Guided Genetic Algorithm for Max_CSPs.	KES	2003	DBLP DOI BibTeX RDF
13	Rosella Gennari	Translations for Comparing Soft Frameworks.	CP	2001	DBLP DOI BibTeX RDF