Relevant bibliographies by topics / Max-SAT Problem

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers

Academic literature on the topic 'Max-SAT Problem'

Author: Grafiati
Published: 25 May 2024
Last updated: 31 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Max-SAT Problem.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Max-SAT Problem"

1

Chieu, H. L., and W. S. Lee. "Relaxed Survey Propagation for The Weighted Maximum Satisfiability Problem." Journal of Artificial Intelligence Research 36 (October 30, 2009): 229–66. http://dx.doi.org/10.1613/jair.2808.

Full text
Abstract:
The survey propagation (SP) algorithm has been shown to work well on large instances of the random 3-SAT problem near its phase transition. It was shown that SP estimates marginals over covers that represent clusters of solutions. The SP-y algorithm generalizes SP to work on the maximum satisfiability (Max-SAT) problem, but the cover interpretation of SP does not generalize to SP-y. In this paper, we formulate the relaxed survey propagation (RSP) algorithm, which extends the SP algorithm to apply to the weighted Max-SAT problem. We show that RSP has an interpretation of estimating marginals ov
APA, Harvard, Vancouver, ISO, and other styles
2

Abu Doush, Iyad, Amal Lutfi Quran, Mohammed Azmi Al-Betar, and Mohammed A. Awadallah. "MAX-SAT Problem using Hybrid Harmony Search Algorithm." Journal of Intelligent Systems 27, no. 4 (2018): 643–58. http://dx.doi.org/10.1515/jisys-2016-0129.

Full text
Abstract:
Abstract Maximum Satisfiability problem is an optimization variant of the Satisfiability problem (SAT) denoted as MAX-SAT. The aim of this problem is to find Boolean variable assignment that maximizes the number of satisfied clauses in the Boolean formula. In case the number of variables per clause is equal or greater than three, then this problem is considered NP-complete. Hence, many researchers have developed techniques to deal with MAX-SAT. In this paper, we investigate the impact of different hybrid versions of binary harmony search (HS) algorithm on solving MAX 3-SAT problem. Therefore,
APA, Harvard, Vancouver, ISO, and other styles
3

Py, Matthieu, Mohamed Sami Cherif, and Djamal Habet. "Proofs and Certificates for Max-SAT." Journal of Artificial Intelligence Research 75 (December 8, 2022): 1373–400. http://dx.doi.org/10.1613/jair.1.13811.

Full text
Abstract:
Current Max-SAT solvers are able to efficiently compute the optimal value of an input instance but they do not provide any certificate of its validity. In this paper, we present a tool, called MS-Builder, which generates certificates for the Max-SAT problem in the particular form of a sequence of equivalence-preserving transformations. To generate a certificate, MS-Builder iteratively calls a SAT oracle to get a SAT resolution refutation which is handled and adapted into a sound refutation for Max-SAT. In particular, we prove that the size of the computed Max-SAT refutation is linear with resp
APA, Harvard, Vancouver, ISO, and other styles
4

Li, C. M., F. Manya, and J. Planes. "New Inference Rules for Max-SAT." Journal of Artificial Intelligence Research 30 (October 23, 2007): 321–59. http://dx.doi.org/10.1613/jair.2215.

Full text
Abstract:
Exact Max-SAT solvers, compared with SAT solvers, apply little inference at each node of the proof tree. Commonly used SAT inference rules like unit propagation produce a simplified formula that preserves satisfiability but, unfortunately, solving the Max-SAT problem for the simplified formula is not equivalent to solving it for the original formula. In this paper, we define a number of original inference rules that, besides being applied efficiently, transform Max-SAT instances into equivalent Max-SAT instances which are easier to solve. The soundness of the rules, that can be seen as refinem
APA, Harvard, Vancouver, ISO, and other styles
5

Bouhmala, Noureddine. "A Variable Neighborhood Walksat-Based Algorithm for MAX-SAT Problems." Scientific World Journal 2014 (2014): 1–11. http://dx.doi.org/10.1155/2014/798323.

Full text
Abstract:
The simplicity of the maximum satisfiability problem (MAX-SAT) combined with its applicability in many areas of artificial intelligence and computing science made it one of the fundamental optimization problems. This NP-complete problem refers to the task of finding a variable assignment that satisfies the maximum number of clauses (or the sum of weights of satisfied clauses) in a Boolean formula. The Walksat algorithm is considered to be the main skeleton underlying almost all local search algorithms for MAX-SAT. Most local search algorithms including Walksat rely on the 1-flip neighborhood s
APA, Harvard, Vancouver, ISO, and other styles
6

Bertoni, Alberto, Marco Carpentieri, Paola Campadelli, and Giuliano Grossi. "A Genetic Model: Analysis and Application to MAXSAT." Evolutionary Computation 8, no. 3 (2000): 291–309. http://dx.doi.org/10.1162/106365600750078790.

Full text
Abstract:
In this paper, a genetic model based on the operations of recombination and mutation is studied and applied to combinatorial optimization problems. Results are: The equations of the deterministic dynamics in the thermodynamic limit (infinite populations) are derived and, for a sufficiently small mutation rate, the attractors are characterized; A general approximation algorithm for combinatorial optimization problems is designed. The algorithm is applied to the Max Ek-Sat problem, and the quality of the solution is analyzed. It is proved to be optimal for k≥3 with respect to the worst case anal
APA, Harvard, Vancouver, ISO, and other styles
7

Wang, Xiaofeng, and Jiulei Jiang. "Warning Propagation Algorithm for the MAX-3-SAT Problem." IEEE Transactions on Emerging Topics in Computing 7, no. 4 (2019): 578–84. http://dx.doi.org/10.1109/tetc.2017.2736504.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Das, Rhiddhi Prasad, Anuruddha Paul, Junali Jasmine Jena, Bibhuti Bhusan Dash, Utpal Chandra De, and Mahendra Kumar Gourisaria. "Hybrid Binary SGO-GA for solving MAX-SAT problem." Procedia Computer Science 252 (2025): 944–53. https://doi.org/10.1016/j.procs.2025.01.055.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Kuhlmann, Isabelle, Anna Gessler, Vivien Laszlo, and Matthias Thimm. "Comparison of SAT-Based and ASP-Based Algorithms for Inconsistency Measurement." Journal of Artificial Intelligence Research 82 (February 4, 2025): 563–685. https://doi.org/10.1613/jair.1.16888.

Full text
Abstract:
We present algorithms based on satisfiability problem (SAT) solving, as well as answer set programming (ASP), for solving the problem of determining inconsistency degrees in propositional knowledge bases. We consider six different inconsistency measures whose respective decision problems lie on the first level of the polynomial hierarchy. Namely, these are the contension, forgetting-based, hitting set, max-distance, sum-distance, and hit-distance inconsistency measures. In an extensive experimental analysis, we compare the SAT-based and ASP-based approaches with each other, as well as with a s
APA, Harvard, Vancouver, ISO, and other styles
10

Alasow, Abdirahman, Peter Jin, and Marek Perkowski. "Quantum Algorithm for Variant Maximum Satisfiability." Entropy 24, no. 11 (2022): 1615. http://dx.doi.org/10.3390/e24111615.

Full text
Abstract:
In this paper, we proposed a novel quantum algorithm for the maximum satisfiability problem. Satisfiability (SAT) is to find the set of assignment values of input variables for the given Boolean function that evaluates this function as TRUE or prove that such satisfying values do not exist. For a POS SAT problem, we proposed a novel quantum algorithm for the maximum satisfiability (MAX-SAT), which returns the maximum number of OR terms that are satisfied for the SAT-unsatisfiable function, providing us with information on how far the given Boolean function is from the SAT satisfaction. We used
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Max-SAT Problem"

1

Py, Matthieu. "Inférence et certificats pour le problème de satisfiabilité maximum." Electronic Thesis or Diss., Aix-Marseille, 2021. http://www.theses.fr/2021AIXM0631.

Full text
Abstract:
Dans cette thèse, on s'intéresse au problème de satisfiabilité maximum (Max-SAT), qui consiste, étant donnée une formule propositionnelle sous forme normale conjonctive, à trouver une interprétation des variables de la formule permettant de satisfaire le plus de clauses possible. Le système de preuve le plus utilisé dans Max-SAT est basé sur la règle d'inférence par max-résolution qui est l'adaptation pour Max-SAT de la règle de résolution utilisée pour le problème SAT. La règle de résolution déduit une nouvelle clause à partir de deux clauses, ce qui permet de certifier qu'une formule est ins
APA, Harvard, Vancouver, ISO, and other styles
2

Kolar, Michal. "Statistical Physics and Message Passing Algorithms. Two Case Studies: MAX-K-SAT Problem and Protein Flexibility." Doctoral thesis, SISSA, 2006. http://hdl.handle.net/20.500.11767/4659.

Full text
Abstract:
In the last decades the tl1eory of spin glasses has been developed within the framework of statistical physics. The obtained results showed to be novel not only from the physical point of vie\l\'1 but they have brought also new mathematical techniques and algorithmic approaches. Indeed, the problem of finding ground state of a spin glass is (in general) NP-complete. The methods that were found brought new ideas to the field of Combinatorial Optimization, and on the other side, the similar methods of Combinatorial Optimization, were applied in physical systems. As it happened with the M
APA, Harvard, Vancouver, ISO, and other styles
3

André, Pascal. "Aspects probabilistes du probleme de la satisfaction d'une formule booleenne, etude des problemes sat, number-sat et max-sat." Paris 6, 1993. http://www.theses.fr/1993PA066681.

Full text
Abstract:
Le probleme sat (existence d'une solution d'un systeme sat) est un probleme np-complet. Le probleme max-sat (nombre maximum de clauses satisfaites d'un systeme sat), bien qu'a priori plus difficile, est egalement un probleme np-complet. Le probleme number-sat (nombre de solutions d'un systeme sat) est plus complexe et appartient a la classe des problemes number-p-complet. Il n'existe donc pas, aujourd'hui, d'algorithme deterministe polynomial capable de resoudre l'un ou l'autre de ces trois problemes. Pourtant, a propos du probleme number-sat, on montre que l'on peut definir des classes de sys
APA, Harvard, Vancouver, ISO, and other styles
4

MORALES, HUERTA MARTHA GUADALUPE 786078, and HUERTA MARTHA GUADALUPE MORALES. "Aproximación de soluciones del problema MAX-SAT usando cómputo cuántico adiabático." Tesis de maestría, Universidad Autónoma del Estado de México, 2018. http://hdl.handle.net/20.500.11799/95499.

Full text
Abstract:
Actualmente, se han propuesto tecnologías cuánticas basadas en el algoritmo de temple cuántico y cómputo cuántico adiabático con aplicaciones a problemas de optimización combinatorios. Diversos estudios teóricos y experimentales se han enfocado en determinar las ventajas y desventajas de resolver clases específicas de problemas tales como detección de fallas en redes de potencia, plegado de proteínas, satisfacción de restricciones, entre otros. En esta tesis se propone una formulación cuántica del problema de máxima satisfactibilidad booleana usando el algoritmo de temple cuántico y cómputo cu
APA, Harvard, Vancouver, ISO, and other styles
5

Teixeira, Giovany Frossard. "MULTIPLEX: um procedimento baseado em simulted annealing aplicado ao problema Max-Sat ponderado." Universidade Federal do Espírito Santo, 2006. http://repositorio.ufes.br/handle/10/6354.

Full text
Abstract:
Made available in DSpace on 2016-12-23T14:33:34Z (GMT). No. of bitstreams: 1 dissertacao.pdf: 412800 bytes, checksum: 479ec97937646fdcffeadd81d19f1b7a (MD5) Previous issue date: 2006-06-01<br>Computar a solução ótima para uma unidade de problema MAX-SAT Ponderado (weighted maximum satisfiability) é difícil mesmo se cada cláusula contiver apenas dois literais. Neste trabalho, será descrita a implementação de uma nova heurística aplicada a instâncias de problema do tipo MAX-SAT Ponderado, mas perfeitamente extensível a outros problemas. Para comparação, serão geradas soluções para uma quantida
APA, Harvard, Vancouver, ISO, and other styles
6

Belaïdouni, Mériéma. "Métaheuristiques et paysages de recherche." Angers, 2001. http://www.theses.fr/2001ANGE0022.

Full text
Abstract:
Les métaheuristiques sont une classe de méthodes qui fournissent des solutions de bonne qualité en temps raisonnable à des problèmes combinatoires réputés difficiles. Il existe de nombreux travaux d'application de ces méthodes mais très peu d'études s'intéressent à leur aspect fondamental. Ainsi la dynamique et le comportement des métaheuristiques restent méconnus. Cette thèse est dédiée à l'étude de quelques questions fondamentales sur les métaheuristiques. Nous avons adopté une méthodologie en trois axes : 1) l'étude des propriétés et mesures des problèmes combinatoires, 2) l'étude des compo
APA, Harvard, Vancouver, ISO, and other styles
7

Ouzia, Hacène. "Hiérarchies de relaxations semi-algébriques pour des programmes linéaires mixtes 0-1 : théorie et applications." Paris 6, 2008. http://www.theses.fr/2008PA066349.

Full text
Abstract:
Dans cette thèse, nous abordons les liens entre diverses hiérarchies de relaxations semi-algébriques pour des programmes linéaires mixtes 0-1. Parmi celles-ci, citons la hiérarchie de Sherali-Adams (S&A) et la hiérarchie Lift-and-Project (L&P). Tout d’abord, nous montrons que la hiérarchie L&P est semi-algébrique. Puis, nous introduisons une nouvelle hiérarchie de relaxations semi-algébriques, dite SRL*, intermédiaire entre les hiérarchies S&A et L&P. Nous examinons les liens entre les hiérarchies L&P et SRL*. Nous aborderons comment renforcer la description linéaire d’une relaxation L&P pour
APA, Harvard, Vancouver, ISO, and other styles
8

Αραβαντινού, Άννα. "Πιθανοτική ικανοποιησιμότητα : πολυπλοκότητα και υπολογιστικές προσεγγίσεις". Thesis, 2015. http://hdl.handle.net/10889/8631.

Full text
Abstract:
Στην εργασία αυτή ασχοληθήκαμε με το πρόβλημα της Πιθανοτικής Ικανοποιησιμότητας. Παρουσιάσαμε ανάλυση της πολυπλοκότητας του προβλήματος και το επιλύσαμε με την βοήθεια του λογισμικού πακέτου CPLEX. Περιγράψαμε προσεγγιστικούς αλγόριθμους για το πρόβλημα της Μέγιστης Ικανοποιησιμότητας που χρησιμοποιείται στην διαδικασία της Column Generation. Τέλος, πριγράψαμε το αντίστροφο πρόβλημα των συχνών στοιχειοσυνόλων και την σχέση του με το πρόβλημα της Μέγιστης Ικανοποιησιμότητας.<br>This thesis is about the problem of probabilistic satisfiability. We describe its computational complexity, we solve
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Max-SAT Problem"

1

Monahan, Chris. My max score SAT math 1 & 2 subject test: Maximize your score in less time. Sourcebooks, 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Max-SAT Problem"

1

Joy, Steve, John Mitchell, and Brian Borchers. "A branch and cut algorithm for MAX-SAT and weighted MAX-SAT." In Satisfiability Problem: Theory and Applications. American Mathematical Society, 1997. http://dx.doi.org/10.1090/dimacs/035/13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Fu, Zhaohui, and Sharad Malik. "On Solving the Partial MAX-SAT Problem." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11814948_25.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Resende, Mauricio, Leonidas Pitsoulis, and Panos Pardalos. "Approximate solution of weighted MAX-SAT problems using GRASP." In Satisfiability Problem: Theory and Applications. American Mathematical Society, 1997. http://dx.doi.org/10.1090/dimacs/035/11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Battiti, R., and M. Protasi. "Solving MAX-SAT with nonoblivious functions and history-based heuristics." In Satisfiability Problem: Theory and Applications. American Mathematical Society, 1997. http://dx.doi.org/10.1090/dimacs/035/19.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Ochoa, Gabriela, Francisco Chicano, and Marco Tomassini. "Global Landscape Structure and the Random MAX-SAT Phase Transition." In Parallel Problem Solving from Nature – PPSN XVI. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-58115-2_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Pankratov, Denis, and Allan Borodin. "On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem." In Theory and Applications of Satisfiability Testing – SAT 2010. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-14186-7_19.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Sadeg, Souhila, Habiba Drias, Ouassim Ait El Hara, and Ania Kaci. "ABSO: Advanced Bee Swarm Optimization Metaheuristic and Application to Weighted MAX-SAT Problem." In Brain Informatics. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-23605-1_24.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Benatchba, Karima, Lotfi Admane, and Mouloud Koudil. "Using Bees to Solve a Data-Mining Problem Expressed as a Max-Sat One." In Artificial Intelligence and Knowledge Engineering Applications: A Bioinspired Approach. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11499305_22.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Escoffier, Bruno, and Vangelis Th Paschos. "Differential Approximation of min sat, max sat and Related Problems." In Computational Science and Its Applications – ICCSA 2005. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11424925_22.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Pardalos, P. M., L. Pitsoulis, and M. G. C. Resende. "A parallel GRASP for MAX-SAT problems." In Applied Parallel Computing Industrial Computation and Optimization. Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-62095-8_62.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Max-SAT Problem"

1

Ali, H. M., David Mitchell, and Daniel C. Lee. "MAX-SAT problem using evolutionary algorithms." In 2014 IEEE Symposium On Swarm Intelligence (SIS). IEEE, 2014. http://dx.doi.org/10.1109/sis.2014.7011783.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Py, Matthieu, Mohamed Sami Cherif, and Djamal Habet. "Proofs and Certificates for Max-SAT (Extended Abstract)." In Thirty-Second International Joint Conference on Artificial Intelligence {IJCAI-23}. International Joint Conferences on Artificial Intelligence Organization, 2023. http://dx.doi.org/10.24963/ijcai.2023/787.

Full text
Abstract:
In this paper, we present a tool, called MS-Builder, which generates certificates for the Max-SAT problem in the particular form of a sequence of equivalence-preserving transformations. To generate a certificate, MS-Builder iteratively calls a SAT oracle to get a SAT resolution refutation which is handled and adapted into a sound refutation for Max-SAT. In particular, the size of the computed Max-SAT refutation is linear with respect to the size of the initial refutation if it is semi-read-once, tree-like regular, tree-like or semi-tree-like. Additionally, we propose an extendable tool, called
APA, Harvard, Vancouver, ISO, and other styles
3

Ali, Hafiz Munsub, and Daniel C. Lee. "Solving the MAX-SAT problem by binary enhanced fireworks algorithm." In 2016 Sixth International Conference on Innovative Computing Technology (INTECH). IEEE, 2016. http://dx.doi.org/10.1109/intech.2016.7845071.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Ali, Hafiz Munsub, Waleed Ejaz, May Al Taei, and Farkhund Iqbal. "Solving MAX-SAT Problem by Binary Biogeograph-based Optimization Algorithm." In 2019 IEEE 10th Annual Information Technology, Electronics and Mobile Communication Conference (IEMCON). IEEE, 2019. http://dx.doi.org/10.1109/iemcon.2019.8936281.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Lima, João P., Anne C. Rocha, Alexandre Arruda, and Dmontier Jr. "Application of Weighted Partial Max-SAT for Post-improvement of the Multiple Traveling Salesman Problem." In Workshop Brasileiro de Lógica. Sociedade Brasileira de Computação, 2024. http://dx.doi.org/10.5753/wbl.2024.2458.

Full text
Abstract:
Advances allow SAT solvers to be used to solve problems in the industrial sector. Therefore, in this paper, we reduce the multiple traveling salesman problem to a weighted partial max-SAT, with the aim of increasing the quality of the solution at a reduced computational cost. A version of Clarke and Wright’s saving algorithm has been implemented to create the initial solution, while the 2-opt algorithm is applied to each route to improve the routes, the search space is extended by adding k nearest neighbors of each vertex so that post-improvement can be performed by the SAT solver. Benchmarks
APA, Harvard, Vancouver, ISO, and other styles
6

Khadilkar, Harshad. "Solving the capacitated vehicle routing problem with timing windows using rollouts and MAX-SAT." In 2022 Eighth Indian Control Conference (ICC). IEEE, 2022. http://dx.doi.org/10.1109/icc56513.2022.10093678.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Grimaldi, Andrea, Eleonora Raimondo, Anna Giordano, Kerem Y. Çamsarı, and Giovanni Finocchio. "A Comparison of Energy Minimization Algorithms for Solving Max-Sat Problem with Probabilistic Ising Machines." In 2023 IEEE 23rd International Conference on Nanotechnology (NANO). IEEE, 2023. http://dx.doi.org/10.1109/nano58406.2023.10231311.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Tönshoff, Jan, Berke Kisin, Jakob Lindner, and Martin Grohe. "One Model, Any CSP: Graph Neural Networks as Fast Global Search Heuristics for Constraint Satisfaction." In Thirty-Second International Joint Conference on Artificial Intelligence {IJCAI-23}. International Joint Conferences on Artificial Intelligence Organization, 2023. http://dx.doi.org/10.24963/ijcai.2023/476.

Full text
Abstract:
We propose a universal Graph Neural Network architecture which can be trained as an end-2-end search heuristic for any Constraint Satisfaction Problem (CSP). Our architecture can be trained unsupervised with policy gradient descent to generate problem specific heuristics for any CSP in a purely data driven manner. The approach is based on a novel graph representation for CSPs that is both generic and compact and enables us to process every possible CSP instance with one GNN, regardless of constraint arity, relations or domain size. Unlike previous RL-based methods, we operate on a global searc
APA, Harvard, Vancouver, ISO, and other styles
9

Sadeg, Souhila, Habiba Drias, Hafid Aid, and Samir Mazouz. "DNA based algorithms for solving both MAX-SAT and MAX-W-SAT problems." In 2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA). IEEE, 2010. http://dx.doi.org/10.1109/bicta.2010.5645331.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Molnar, Botond, and Maria Ercsey-Ravasz. "Analog dynamics for solving max-SAT problems." In 2014 14th International Workshop on Cellular Nanoscale Networks and their Applications (CNNA). IEEE, 2014. http://dx.doi.org/10.1109/cnna.2014.6888597.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Max-SAT Problem' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography