Literatura científica selecionada sobre o tema "Max-SAT Problem"
Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos
Índice
Consulte a lista de atuais artigos, livros, teses, anais de congressos e outras fontes científicas relevantes para o tema "Max-SAT Problem".
Ao lado de cada fonte na lista de referências, há um botão "Adicionar à bibliografia". Clique e geraremos automaticamente a citação bibliográfica do trabalho escolhido no estilo de citação de que você precisa: APA, MLA, Harvard, Chicago, Vancouver, etc.
Você também pode baixar o texto completo da publicação científica em formato .pdf e ler o resumo do trabalho online se estiver presente nos metadados.
Artigos de revistas sobre o assunto "Max-SAT Problem"
Chieu, H. L., e W. S. Lee. "Relaxed Survey Propagation for The Weighted Maximum Satisfiability Problem". Journal of Artificial Intelligence Research 36 (30 de outubro de 2009): 229–66. http://dx.doi.org/10.1613/jair.2808.
Texto completo da fonteAbu Doush, Iyad, Amal Lutfi Quran, Mohammed Azmi Al-Betar e Mohammed A. Awadallah. "MAX-SAT Problem using Hybrid Harmony Search Algorithm". Journal of Intelligent Systems 27, n.º 4 (25 de outubro de 2018): 643–58. http://dx.doi.org/10.1515/jisys-2016-0129.
Texto completo da fontePy, Matthieu, Mohamed Sami Cherif e Djamal Habet. "Proofs and Certificates for Max-SAT". Journal of Artificial Intelligence Research 75 (8 de dezembro de 2022): 1373–400. http://dx.doi.org/10.1613/jair.1.13811.
Texto completo da fonteLi, C. M., F. Manya e J. Planes. "New Inference Rules for Max-SAT". Journal of Artificial Intelligence Research 30 (23 de outubro de 2007): 321–59. http://dx.doi.org/10.1613/jair.2215.
Texto completo da fonteBouhmala, 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.
Texto completo da fonteWang, Xiaofeng, e Jiulei Jiang. "Warning Propagation Algorithm for the MAX-3-SAT Problem". IEEE Transactions on Emerging Topics in Computing 7, n.º 4 (1 de outubro de 2019): 578–84. http://dx.doi.org/10.1109/tetc.2017.2736504.
Texto completo da fonteBertoni, Alberto, Marco Carpentieri, Paola Campadelli e Giuliano Grossi. "A Genetic Model: Analysis and Application to MAXSAT". Evolutionary Computation 8, n.º 3 (setembro de 2000): 291–309. http://dx.doi.org/10.1162/106365600750078790.
Texto completo da fonteAlasow, Abdirahman, Peter Jin e Marek Perkowski. "Quantum Algorithm for Variant Maximum Satisfiability". Entropy 24, n.º 11 (5 de novembro de 2022): 1615. http://dx.doi.org/10.3390/e24111615.
Texto completo da fonteGallo, G., C. Gentile, D. Pretolani e G. Rago. "Max Horn SAT and the minimum cut problem in directed hypergraphs". Mathematical Programming 80, n.º 2 (janeiro de 1998): 213–37. http://dx.doi.org/10.1007/bf01581727.
Texto completo da fonteZhu, Wenxing, e Yuanhui Yan. "Solving the weighted MAX-SAT problem using the dynamic convexized method". Optimization Letters 8, n.º 1 (8 de novembro de 2012): 359–74. http://dx.doi.org/10.1007/s11590-012-0583-4.
Texto completo da fonteTeses / dissertações sobre o assunto "Max-SAT Problem"
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.
Texto completo da fonteIn this thesis, we are interested in the maximum satisfiability problem (Max-SAT), which consists,given a Boolean formula in conjunctive normal form, in finding an assignment of the variables of the formula which allows to satisfy as many clauses as possible. The most widely used Max-SAT proof system is based on the Max-SAT resolution inference rule which is the adaptation for Max-SAT of the resolution rule used for the SAT problem. The resolution rule deduces a new clause from two opposing clauses, enabling to certify that a formula is unsatisfiable by gradually deducing new clauses until deducing a contradiction, represented in the form of an empty clause. The adaptation of such proofs, referred to as resolution refutations, for Max-SAT without considerably increasing its size is an open problem since the introduction of Max-SAT resolution.We propose in this thesis two methods to adapt any resolution resfutation into a valid refutation for Max-SAT, referred to as max-refutation. Another contribution is the construction of certificates to demonstrate the optimality of a solution for the Max-SAT problem. To generate such certificates, we use the max-refutations that we are now able to generate from the resolution refutations. Finally, we are interested in the problem which consists, given an initial formula and a given information (clause or formula), of inferring this information by Max-SAT-equivalence-preserving inference rules. As the max-resolution is incomplete for the inference in Max-SAT, we propose a new proof system as well as an algorithm allowing to infer, if possible, a given clause or formula
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.
Texto completo da fonteAndré, 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.
Texto completo da fonteMORALES, HUERTA MARTHA GUADALUPE 786078, e 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.
Texto completo da fonteTeixeira, 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.
Texto completo da fonteComputar 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 quantidade significativa de problemas e seus resultados serão comparados com os de outras heurísticas já desenvolvidas para esse tipo de problema, dentre elas as heurísticas consideradas "estado da arte", ou seja, heurísticas que têm obtido os melhores resultados no universo das heurísticas existentes.
Belaïdouni, Mériéma. "Métaheuristiques et paysages de recherche". Angers, 2001. http://www.theses.fr/2001ANGE0022.
Texto completo da fonteMetaheuristics are a class of methods which are able to provide solutions of good quality in a reasonnable amount of time for difficult combinatorial problems. There exist a large number of applications of these methods but only few studies concern their fondamental aspects. This thesis is devoted to study some fondamental issues of metaheuristics. Three tightly related axis are explored : 1)the study of problems properties and measures, 2)the study of dynamics of metaheuristics, 3)the establishment of the relations between measures of problems and dynamics of metaheuristics. To validate this approach we have apllied it to two NP-complete problems : MAX-CSP and SAT
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.
Texto completo da fonteΑραβαντινού, Άννα. "Πιθανοτική ικανοποιησιμότητα : πολυπλοκότητα και υπολογιστικές προσεγγίσεις". Thesis, 2015. http://hdl.handle.net/10889/8631.
Texto completo da fonteThis thesis is about the problem of probabilistic satisfiability. We describe its computational complexity, we solve the problem using CPLEX, we discribe some approximations on Maximum Satisfiability. Finally, we describe the connection between the problem of Probabilistic Satisfiability and the inverse frequent itemset mining.
Livros sobre o assunto "Max-SAT Problem"
Monahan, Chris. My max score SAT math 1 & 2 subject test: Maximize your score in less time. Naperville, Ill: Sourcebooks, 2011.
Encontre o texto completo da fonteCapítulos de livros sobre o assunto "Max-SAT Problem"
Joy, Steve, John Mitchell e Brian Borchers. "A branch and cut algorithm for MAX-SAT and weighted MAX-SAT". In Satisfiability Problem: Theory and Applications, 519–36. Providence, Rhode Island: American Mathematical Society, 1997. http://dx.doi.org/10.1090/dimacs/035/13.
Texto completo da fonteFu, Zhaohui, e Sharad Malik. "On Solving the Partial MAX-SAT Problem". In Lecture Notes in Computer Science, 252–65. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11814948_25.
Texto completo da fonteResende, Mauricio, Leonidas Pitsoulis e Panos Pardalos. "Approximate solution of weighted MAX-SAT problems using GRASP". In Satisfiability Problem: Theory and Applications, 393–405. Providence, Rhode Island: American Mathematical Society, 1997. http://dx.doi.org/10.1090/dimacs/035/11.
Texto completo da fonteBattiti, R., e M. Protasi. "Solving MAX-SAT with nonoblivious functions and history-based heuristics". In Satisfiability Problem: Theory and Applications, 649–67. Providence, Rhode Island: American Mathematical Society, 1997. http://dx.doi.org/10.1090/dimacs/035/19.
Texto completo da fonteOchoa, Gabriela, Francisco Chicano e Marco Tomassini. "Global Landscape Structure and the Random MAX-SAT Phase Transition". In Parallel Problem Solving from Nature – PPSN XVI, 125–38. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-58115-2_9.
Texto completo da fontePankratov, Denis, e 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, 223–36. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-14186-7_19.
Texto completo da fonteSadeg, Souhila, Habiba Drias, Ouassim Ait El Hara e Ania Kaci. "ABSO: Advanced Bee Swarm Optimization Metaheuristic and Application to Weighted MAX-SAT Problem". In Brain Informatics, 226–37. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-23605-1_24.
Texto completo da fonteBenatchba, Karima, Lotfi Admane e 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, 212–20. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11499305_22.
Texto completo da fonteEscoffier, Bruno, e Vangelis Th Paschos. "Differential Approximation of min sat, max sat and Related Problems". In Computational Science and Its Applications – ICCSA 2005, 192–201. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11424925_22.
Texto completo da fontePardalos, P. M., L. Pitsoulis e M. G. C. Resende. "A parallel GRASP for MAX-SAT problems". In Applied Parallel Computing Industrial Computation and Optimization, 575–85. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-62095-8_62.
Texto completo da fonteTrabalhos de conferências sobre o assunto "Max-SAT Problem"
Ali, H. M., David Mitchell e 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.
Texto completo da fontePy, Matthieu, Mohamed Sami Cherif e Djamal Habet. "Proofs and Certificates for Max-SAT (Extended Abstract)". In Thirty-Second International Joint Conference on Artificial Intelligence {IJCAI-23}. California: International Joint Conferences on Artificial Intelligence Organization, 2023. http://dx.doi.org/10.24963/ijcai.2023/787.
Texto completo da fonteAli, Hafiz Munsub, e 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.
Texto completo da fonteAli, Hafiz Munsub, Waleed Ejaz, May Al Taei e 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.
Texto completo da fonteKhadilkar, 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.
Texto completo da fonteGrimaldi, Andrea, Eleonora Raimondo, Anna Giordano, Kerem Y. Çamsarı e 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.
Texto completo da fonteTönshoff, Jan, Berke Kisin, Jakob Lindner e 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}. California: International Joint Conferences on Artificial Intelligence Organization, 2023. http://dx.doi.org/10.24963/ijcai.2023/476.
Texto completo da fonteSadeg, Souhila, Habiba Drias, Hafid Aid e 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.
Texto completo da fonteMolnar, Botond, e 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.
Texto completo da fontePinto, Pedro C., Thomas A. Runkler e Joao M. C. Sousa. "An Ant Algorithm for Static and Dynamic Max-Sat Problems". In 2006 1st Bio-Inspired Models of Network, Information and Computing Systems. IEEE, 2006. http://dx.doi.org/10.1109/bimnics.2006.361793.
Texto completo da fonte