Literatura científica selecionada sobre o tema "Parallel satisfiability"
Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos
Consulte a lista de atuais artigos, livros, teses, anais de congressos e outras fontes científicas relevantes para o tema "Parallel satisfiability".
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 "Parallel satisfiability"
Martins, Ruben, Vasco Manquinho e Inês Lynce. "Parallel search for maximum satisfiability". AI Communications 25, n.º 2 (2012): 75–95. http://dx.doi.org/10.3233/aic-2012-0517.
Texto completo da fonteMartins, Ruben. "Parallel search for maximum satisfiability". Constraints 20, n.º 4 (10 de setembro de 2015): 469–70. http://dx.doi.org/10.1007/s10601-015-9207-9.
Texto completo da fonteHAGLIN, DAVID J. "APPROXIMATING MAXIMUM 2-CNF SATISFIABILITY". Parallel Processing Letters 02, n.º 02n03 (setembro de 1992): 181–87. http://dx.doi.org/10.1142/s0129626492000301.
Texto completo da fonteFeldman, Yulik, Nachum Dershowitz e Ziyad Hanna. "Parallel Multithreaded Satisfiability Solver: Design and Implementation". Electronic Notes in Theoretical Computer Science 128, n.º 3 (abril de 2005): 75–90. http://dx.doi.org/10.1016/j.entcs.2004.10.020.
Texto completo da fonteSADOWSKI, Adrian. "A parallel pipelined naive method for testing satisfiability". PRZEGLĄD ELEKTROTECHNICZNY 1, n.º 11 (5 de novembro de 2015): 156–59. http://dx.doi.org/10.15199/48.2015.11.38.
Texto completo da fonteBlochinger, Wolfgang, Carsten Sinz e Wolfgang Küchlin. "Parallel propositional satisfiability checking with distributed dynamic learning". Parallel Computing 29, n.º 7 (julho de 2003): 969–94. http://dx.doi.org/10.1016/s0167-8191(03)00068-1.
Texto completo da fonteWen-Zhang, Liu, Zhang Jing-Fu e Long Gui-Lu. "A Parallel Quantum Algorithm for the Satisfiability Problem". Communications in Theoretical Physics 49, n.º 3 (março de 2008): 629–30. http://dx.doi.org/10.1088/0253-6102/49/3/22.
Texto completo da fonteCheng, Dan. "The New Democratic Revolution in Music during the Play Experience of the Ideological and Political Education Function". Applied Mechanics and Materials 556-562 (maio de 2014): 6602–5. http://dx.doi.org/10.4028/www.scientific.net/amm.556-562.6602.
Texto completo da fonteCzutro, Alexander, Ilia Polian, Matthew Lewis, Piet Engelke, Sudhakar M. Reddy e Bernd Becker. "Thread-Parallel Integrated Test Pattern Generator Utilizing Satisfiability Analysis". International Journal of Parallel Programming 38, n.º 3-4 (1 de janeiro de 2010): 185–202. http://dx.doi.org/10.1007/s10766-009-0124-7.
Texto completo da fonteHEAD, TOM. "PHOTOCOMPUTING: EXPLORATIONS WITH TRANSPARENCY AND OPACITY". Parallel Processing Letters 17, n.º 04 (dezembro de 2007): 339–47. http://dx.doi.org/10.1142/s0129626407003071.
Texto completo da fonteTeses / dissertações sobre o assunto "Parallel satisfiability"
Hoessen, Benoît. "Solving the Boolean satisfiability problem using the parallel paradigm". Thesis, Artois, 2014. http://www.theses.fr/2014ARTO0406/document.
Texto completo da fonteThis thesis presents different technique to solve the Boolean satisfiability problem using parallel and distributed architectures. In order to provide a complete explanation, a careful presentation of the CDCL algorithm is made, followed by the state of the art in this domain. Once presented, two propositions are made. The first one is an improvement on a portfolio algorithm, allowing to exchange more data without loosing efficiency. The second is a complete library with its API allowing to easily create distributed SAT solver
Sohanghpurwala, Ali Asgar Ali Akbar. "Exploits in Concurrency for Boolean Satisfiability". Diss., Virginia Tech, 2018. http://hdl.handle.net/10919/86417.
Texto completo da fontePh. D.
Boyd, Mark J. "Complexity analysis of a massive parallel boolean satisfiability implication circuit /". Diss., Digital Dissertations Database. Restricted to UC campuses, 2005. http://uclibs.org/PID/11984.
Texto completo da fonteManthey, Norbert. "Towards Next Generation Sequential and Parallel SAT Solvers". Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2015. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-158672.
Texto completo da fonteGuo, Long. "Résolution séquentielle et parallèle du problème de la satisfiabilité propositionnelle". Thesis, Artois, 2013. http://www.theses.fr/2013ARTO0408/document.
Texto completo da fonteIn this thesis, we deal with the sequential and parallel resolution of the problem SAT. Despite of its complexity, the resolution of SAT problem is an excellent and competitive approach for solving thecombinatorial problems such as the formal verification of hardware and software, the cryptography, theplanning and the bioinfomatics. Several contribution are made in this thesis. The first contribution aims to find the compromise of diversification and intensification in the solver of type portfolio. In our second contribution, we propose to dynamically adjust the configuration of a core in a portfolio parallel sat solver when it is determined that another core performs similar work. In the third contribution, we improve the strategy of reduction of the base of learnt clauses, we construct a portfolio strategy of reduction in parallel solver. Finally, we present a new approach named "Virtual Control" which is to distribute the additional constraints to each core in a parallel solver and verify their consistency during search
Lagniez, Jean-Marie. "Satisfiabilité propositionnelle et raisonnement par contraintes : modèles et algorithmes". Thesis, Artois, 2011. http://www.theses.fr/2011ARTO0404/document.
Texto completo da fonteThis thesis deals with propositional satisfiability (SAT) and constraint satisfaction problems(CSP). These two declarative models are widely used for solving several combinatorial problems (e.g.formal verification of hardware and software, bioinformatics, cryptography, planning, scheduling, etc.).The first contribution of this thesis concerns the proposition of hybridization schemes of complete andincomplete methods, giving rise to an original answer to a well-known challenge open since 1998. Secondly,a new and efficient multi-core parallel approach is proposed. In the third contribution, a novelapproach for improving clause learning management database is designed. This contribution allows spatialcomplexity reduction of the resolution-based component of SAT solvers while maintaining relevantconstraints. This contribution was awarded at the last international SAT conference (best paper award).This work has led to several open sources solving tools for both propositional satisfiability and constraintssatisfaction problems
Legendre, Florian. "Exploitation de la logique propositionnelle pour la résolution parallèle des problèmes cryptographiques". Thesis, Reims, 2014. http://www.theses.fr/2014REIMS006/document.
Texto completo da fonteDemocratization of increasingly high-Performance digital technologies and especially the Internet has considerably changed the world of communication. Consequently, needs in cryptography are more and more numerous and the necessity of verifying the security of cipher algorithms is essential.This thesis deals with a new cryptanalysis, called logical cryptanalysis, which is based on the use of logical formalism to express and solve cryptographic problems. More precisely, works presented here focuses on a particular category of ciphers, called cryptographic hash functions, used in authentication and data integrity protocols.Logical cryptanalysis is a specific algebraic cryptanalysis where the expression of the cryptographic problem is done through the satisfiabilty problem, fluently called sat problem. It consists in a combinatorial problem of decision which is central in complexity theory. In the past years, works led by the scientific community have allowed to develop efficient solvers for industrial and academical problems.Works presented in this thesis are the fruit of an exploration between satisfiability and cryptanalysis, and have enabled to display new results and innovative methods to weaken cryptographic functions.The first contribution is the modeling of a cryptographic problem as a sat problem. For this, we present some rules that lead to describe easily basic operations involved in cipher algorithms. Then, a section is dedicated to logical reasoning in order to simplify the produced sat formulas and show how satisfiability can help to enrich a knowledge on a studied problem. Furthermore, we also present many points of view to use our smooth modeling to apply a probabilistic reasoning on all the data associated with the generated sat formulas. This has then allowed to improve both the modeling and the solving of the problem and underlined a weakness about the use of round constants.Second, a section is devoted to practical attacks. Within this framework, we tackled preimages of the most popular cryptographic hash functions. Moreover, the collision problem is also approached in different ways, and particularly, the one-Bloc collision attack of Stevens on MD5 was translated within a logical context. It's interesting to remark that in both cases, logical cryptanalysis takes a new look on the considered problems
LI, QIAN-WU, e 李謙吾. "A parallel algorithm for satisfiability problem". Thesis, 1990. http://ndltd.ncl.edu.tw/handle/33008809664444510669.
Texto completo da fonteLin, Kung-Ming, e 林拱民. "Implementation of Parallel Boolean Satisfiability Solver by CUDA (Compute Unified Device Architecture)". Thesis, 2011. http://ndltd.ncl.edu.tw/handle/53763433686308452413.
Texto completo da fonte國立臺灣大學
電子工程學研究所
99
Boolean satisfiability (SAT) problem plays a critical role in theoretical and industrial applications. With the advance of SAT solvers in the past 15 years, we are capable to solve fairly large-scale problems. To improve the performance of SAT solvers for much larger and harder SAT problems, parallelization of SAT solvers is gaining much attention in recent years. The state-of-the-art 4-to-8 threaded parallel SAT solvers are more powerful than single-threaded ones in recent international SAT solver competitions. General-Purpose computation on Graphics Processing Units (GPGPU) is also emerging from massive parallel computing realm. To explore the concept of massive parallel SAT solvers, we have implemented the “CUDASAT”, a parallel CDCL-DPLL (Conflict Driven Clause Learning - Davis-Putnam-Logemann-Loveland) SAT solver with clause sharing on CUDA (Compute Unified Device Architecture) platform. To the best of our knowledge, CUDASAT is the first of its kind. The experimental results demonstrated a downward trend in average searching events per solver while increasing the number of parallel solver. While the performance is not comparable to those state-of-the-art parallel SAT solvers, CUDASAT serves as a prototype of massive parallelization toward an affordable and alternative solution for SAT solving.
Manthey, Norbert. "Towards Next Generation Sequential and Parallel SAT Solvers". Doctoral thesis, 2014. https://tud.qucosa.de/id/qucosa%3A28471.
Texto completo da fonteCapítulos de livros sobre o assunto "Parallel satisfiability"
Balyo, Tomáš, e Carsten Sinz. "Parallel Satisfiability". In Handbook of Parallel Constraint Reasoning, 3–29. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-63516-3_1.
Texto completo da fonteLynce, Inês, Vasco Manquinho e Ruben Martins. "Parallel Maximum Satisfiability". In Handbook of Parallel Constraint Reasoning, 61–99. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-63516-3_3.
Texto completo da fonteHyvärinen, Antti E. J., e Christoph M. Wintersteiger. "Parallel Satisfiability Modulo Theories". In Handbook of Parallel Constraint Reasoning, 141–78. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-63516-3_5.
Texto completo da fonteHamadi, Youssef. "Parallel Tree Search for Satisfiability". In Combinatorial Search: From Algorithms to Systems, 27–48. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-41482-4_3.
Texto completo da fonteHamadi, Youssef. "Parallel Local Search for Satisfiability". In Combinatorial Search: From Algorithms to Systems, 49–69. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-41482-4_4.
Texto completo da fonteHeule, Marijn J. H., Oliver Kullmann e Armin Biere. "Cube-and-Conquer for Satisfiability". In Handbook of Parallel Constraint Reasoning, 31–59. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-63516-3_2.
Texto completo da fonteGu, Jun. "Parallel algorithms for satisfiability (SAT) problem". In Parallel Processing of Discrete Optimization Problems, 105–61. Providence, Rhode Island: American Mathematical Society, 1995. http://dx.doi.org/10.1090/dimacs/022/06.
Texto completo da fonteGu, Jun. "Parallel Algorithms for Satisfiability (SAT) Testing". In The IMA Volumes in Mathematics and its Applications, 85–138. New York, NY: Springer New York, 1999. http://dx.doi.org/10.1007/978-1-4612-1492-2_5.
Texto completo da fonteBelov, Anton, Norbert Manthey e Joao Marques-Silva. "Parallel MUS Extraction". In Theory and Applications of Satisfiability Testing – SAT 2013, 133–49. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-39071-5_11.
Texto completo da fonteLewandowski, Gary, e Anne Condon. "Experiments with parallel graph coloring heuristics and applications of graph coloring". In Cliques, Coloring, and Satisfiability, 309–34. Providence, Rhode Island: American Mathematical Society, 1996. http://dx.doi.org/10.1090/dimacs/026/15.
Texto completo da fonteTrabalhos de conferências sobre o assunto "Parallel satisfiability"
Bogdanova, V. G., e S. A. Gorsky. "Scalable parallel solver of boolean satisfiability problems". In 2018 41st International Convention on Information and Communication Technology, Electronics and Microelectronics (MIPRO). IEEE, 2018. http://dx.doi.org/10.23919/mipro.2018.8400042.
Texto completo da fonteSivaramakrishnan, V., S. C. Seth e P. Agrawal. "Parallel test pattern generation using Boolean satisfiability". In [1991] Proceedings. Fourth CSI/IEEE International Symposium on VLSI Design. IEEE, 1991. http://dx.doi.org/10.1109/isvd.1991.185095.
Texto completo da fonteMartins, Ruben, Vasco Manquinho e Inês Lynce. "Exploiting Cardinality Encodings in Parallel Maximum Satisfiability". In 2011 IEEE 23rd International Conference on Tools with Artificial Intelligence (ICTAI). IEEE, 2011. http://dx.doi.org/10.1109/ictai.2011.54.
Texto completo da fonteMenouer, Tarek, e Souheib Baarir. "Parallel Satisfiability Solver Based on Hybrid Partitioning Method". In 2017 25th Euromicro International Conference on Parallel, Distributed and Network-based Processing (PDP). IEEE, 2017. http://dx.doi.org/10.1109/pdp.2017.70.
Texto completo da fonteNemer-Preece, Nicole, e Ralph Wilkerson. "Parallel genetic algorithm to solve the satisfiability problem". In the 1998 ACM symposium. New York, New York, USA: ACM Press, 1998. http://dx.doi.org/10.1145/330560.330565.
Texto completo da fonteAbramovici, Miron, Jose T. de Sousa e Daniel Saab. "A massively-parallel easily-scalable satisfiability solver using reconfigurable hardware". In the 36th ACM/IEEE conference. New York, New York, USA: ACM Press, 1999. http://dx.doi.org/10.1145/309847.310028.
Texto completo da fonteBogdanova, V. G., S. A. Gorsky e A. A. Pashinin. "HPC-based parallel software for solving applied Boolean satisfiability problems". In 2020 43rd International Convention on Information, Communication and Electronic Technology (MIPRO). IEEE, 2020. http://dx.doi.org/10.23919/mipro48935.2020.9245400.
Texto completo da fonteCzutro, A., I. Polian, M. Lewis, P. Engelke, S. M. Reddy e B. Becker. "TIGUAN: Thread-Parallel Integrated Test Pattern Generator Utilizing Satisfiability ANalysis". In 2009 22nd International Conference on VLSI Design. IEEE, 2009. http://dx.doi.org/10.1109/vlsi.design.2009.20.
Texto completo da fonteHerzig, Andreas, Frédéric Maris e Julien Vianey. "Dynamic logic of parallel propositional assignments and its applications to planning". In Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. California: International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/774.
Texto completo da fonteAudemard, Gilles, Benoit Hoessen, Said Jabbour e Cedric Piette. "An Effective Distributed D&C Approach for the Satisfiability Problem". In 2014 22nd Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP). IEEE, 2014. http://dx.doi.org/10.1109/pdp.2014.92.
Texto completo da fonte