Gotowa bibliografia na temat „SAT solver”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Spis treści
Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „SAT solver”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Artykuły w czasopismach na temat "SAT solver"
Klyucharev, P. G. "Exploring Practicability for Solving a Task Based on the Generalized Cellular Automata via SAT Solvers". Mechanical Engineering and Computer Science, nr 11 (2.01.2019): 11–22. http://dx.doi.org/10.24108/1118.0001439.
Pełny tekst źródłaAudemard, Gilles, i Laurent Simon. "On the Glucose SAT Solver". International Journal on Artificial Intelligence Tools 27, nr 01 (luty 2018): 1840001. http://dx.doi.org/10.1142/s0218213018400018.
Pełny tekst źródłaSonobe, Tomohiro. "An Experimental Survey of Extended Resolution Effects for SAT Solvers on the Pigeonhole Principle". Algorithms 15, nr 12 (16.12.2022): 479. http://dx.doi.org/10.3390/a15120479.
Pełny tekst źródłaČapek, Martin, i Pavel Surynek. "DPLL(MAPF): an Integration of Multi-Agent Path Finding and SAT Solving Technologies". Proceedings of the International Symposium on Combinatorial Search 12, nr 1 (21.07.2021): 153–55. http://dx.doi.org/10.1609/socs.v12i1.18567.
Pełny tekst źródłaVieira, Bernardo C., Fabrício V. Andrade i Antônio O. Fernandes. "Framework for Generating Configurable SAT Solvers". Journal of Integrated Circuits and Systems 6, nr 1 (27.12.2011): 50–59. http://dx.doi.org/10.29292/jics.v6i1.338.
Pełny tekst źródłaAl-Yahya, Tasniem, Mohamed El Bachir Menai i Hassan Mathkour. "Boosting the Performance of CDCL-Based SAT Solvers by Exploiting Backbones and Backdoors". Algorithms 15, nr 9 (26.08.2022): 302. http://dx.doi.org/10.3390/a15090302.
Pełny tekst źródłaMueller, Matthias. "Polynomial Exact-3-SAT-Solving Algorithm". International Journal of Engineering & Technology 9, nr 3 (4.08.2020): 670. http://dx.doi.org/10.14419/ijet.v9i3.30749.
Pełny tekst źródłaAono, Masashi, Song-Ju Kim, Liping Zhu, Makoto Naruse, Motoichi Ohtsu, Hirokazu Hori i Masahiko Hara. "Amoeba-inspired SAT Solver". IEICE Proceeding Series 1 (17.03.2014): 586–89. http://dx.doi.org/10.15248/proc.1.586.
Pełny tekst źródłaSurynek, Pavel, Roni Stern, Eli Boyarski i Ariel Felner. "Migrating Techniques from Search-based Multi-Agent Path Finding Solvers to SAT-based Approach". Journal of Artificial Intelligence Research 73 (10.02.2022): 553–618. http://dx.doi.org/10.1613/jair.1.13318.
Pełny tekst źródłaJärvisalo, Matti, Daniel Le Berre, Olivier Roussel i Laurent Simon. "The International SAT Solver Competitions". AI Magazine 33, nr 1 (15.03.2012): 89–92. http://dx.doi.org/10.1609/aimag.v33i1.2395.
Pełny tekst źródłaRozprawy doktorskie na temat "SAT solver"
Izrael, Petr. "SAT Solver akcelerovaný pomocí GPU". Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2013. http://www.nusl.cz/ntk/nusl-236336.
Pełny tekst źródłaKokotov, Daniel (Daniel L. ). 1978. "PSolver : a distributed SAT solver framework". Thesis, Massachusetts Institute of Technology, 2001. http://hdl.handle.net/1721.1/86807.
Pełny tekst źródłaIncludes bibliographical references (p. 129-130).
by Daniel Kokotov.
M.Eng.and S.B.
Pilz, Enrico. "Boolsche Gleichungssysteme, SAT Solver und Stromchiffren". [S.l. : s.n.], 2008. http://nbn-resolving.de/urn:nbn:de:bsz:289-vts-65265.
Pełny tekst źródłaLe, Piane Fabio. "Il teorema di Cook-Levin e i SAT-solver". Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2015. http://amslaurea.unibo.it/9026/.
Pełny tekst źródłaZhao, Yuting. "Answer set programming : SAT based solver and phase transition /". View abstract or full-text, 2003. http://library.ust.hk/cgi/db/thesis.pl?COMP%202003%20ZHAOY.
Pełny tekst źródłaPintjuk, Daniil. "Boosting SAT-solver Performance on FACT Instances with Automatic Parameter Tuning". Thesis, KTH, Skolan för datavetenskap och kommunikation (CSC), 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-166552.
Pełny tekst źródłaSubramanian, Rishi Bharadwaj. "FPGA Based Satisfiability Checking". University of Cincinnati / OhioLINK, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1583154848438753.
Pełny tekst źródłaHoessen, Benoît. "Solving the Boolean satisfiability problem using the parallel paradigm". Thesis, Artois, 2014. http://www.theses.fr/2014ARTO0406/document.
Pełny tekst źródłaThis 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
Silveira, Jaime Kirch da. "Parallel SAT solvers and their application in automatic parallelization". reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2014. http://hdl.handle.net/10183/95373.
Pełny tekst źródłaSince the slowdown in improvement in the frequency of processors, a new tendency has arisen to allow software to take advantage of faster hardware: parallelization. However, different from increasing the frequency of processors, using parallelization requires a different kind of programming, parallel programming, which is usually harder than common sequential programming. In this context, automatic parallelization has arisen, allowing software to take advantage of parallelism without the need of parallel programming. We present here two proposals: SAT-PaDdlinG and RePaSAT. SAT-PaDdlinG is a parallel DPLL SAT Solver on GPU, which allows RePaSAT to use this environment. RePaSAT is our proposal of a parallel machine that uses the SAT Problem to automatically parallelize sequential code. Because GPU provides a cheap, massively parallel environment, SATPaDdlinG aims at providing this massive parallelism and low cost to RePaSAT, as well as to any other tool or problem that uses SAT Solvers.
Kibria, Raihan Hassnain [Verfasser], i Hans [Akademischer Betreuer] Eveking. "Soft Computing Approaches to DPLL SAT Solver Optimization / Raihan Hassnain Kibria. Betreuer: Hans Eveking". Darmstadt : Universitäts- und Landesbibliothek Darmstadt, 2011. http://d-nb.info/1105563952/34.
Pełny tekst źródłaKsiążki na temat "SAT solver"
Halvorson, Christine. Solve it with salt and vinegar. Lincolnwood, Ill: Publications International, 2002.
Znajdź pełny tekst źródłaMailer, Carol. Jumping problems solved: Gridwork, the secret to success. North Pomfret, VT: Trafalgar Square Pub., 2005.
Znajdź pełny tekst źródłaCorrigan, Peter. Soldier U: SAS: Bandit country. Rochester: 22 Books, 1995.
Znajdź pełny tekst źródłaSam Houston: Soldier and statesman. Mankato, Minn: Bridgestone Books, 2003.
Znajdź pełny tekst źródłaSan Martín: Argentine soldier, American hero. New Haven: Yale University Press, 2009.
Znajdź pełny tekst źródłaSoldier A : SAS: Behind Iraqui lines. London: 22, 1993.
Znajdź pełny tekst źródłaSoldier R: SAS: Death on Gibraltar. Rochester: 22 Books, 1994.
Znajdź pełny tekst źródłaSoldier N: SAS: The Gambian bluff. Rochester: 22 Books, 1994.
Znajdź pełny tekst źródłaClarke, Shaun. Soldier A: SAS: Behind Iraqi lines. Bath: Chivers Large Print, 1994.
Znajdź pełny tekst źródłaSolve it with salt: 110 surprising and ingenious household uses for table salt. New York: Three Rivers Press, 1998.
Znajdź pełny tekst źródłaCzęści książek na temat "SAT solver"
Eén, Niklas, i Niklas Sörensson. "An Extensible SAT-solver". W Theory and Applications of Satisfiability Testing, 502–18. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-24605-3_37.
Pełny tekst źródłaFuchs, Tobias, Jakob Bach i Markus Iser. "Active Learning for SAT Solver Benchmarking". W Tools and Algorithms for the Construction and Analysis of Systems, 407–25. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-30823-9_21.
Pełny tekst źródłaFleury, Mathias. "Optimizing a Verified SAT Solver". W Lecture Notes in Computer Science, 148–65. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-20652-9_10.
Pełny tekst źródłaAudemard, Gilles, Jean-Marie Lagniez, Nicolas Szczepanski i Sébastien Tabary. "An Adaptive Parallel SAT Solver". W Lecture Notes in Computer Science, 30–48. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-44953-1_3.
Pełny tekst źródłaMahajan, Yogesh S., Zhaohui Fu i Sharad Malik. "Zchaff2004: An Efficient SAT Solver". W Theory and Applications of Satisfiability Testing, 360–75. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11527695_27.
Pełny tekst źródłaOhmura, Kei, i Kazunori Ueda. "c-sat: A Parallel SAT Solver for Clusters". W Lecture Notes in Computer Science, 524–37. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-02777-2_47.
Pełny tekst źródłaBryant, Randal E., Armin Biere i Marijn J. H. Heule. "Clausal Proofs for Pseudo-Boolean Reasoning". W Tools and Algorithms for the Construction and Analysis of Systems, 443–61. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-99524-9_25.
Pełny tekst źródłaManthey, Norbert. "The MergeSat Solver". W Theory and Applications of Satisfiability Testing – SAT 2021, 387–98. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-80223-3_27.
Pełny tekst źródłaOe, Duckki, Aaron Stump, Corey Oliver i Kevin Clancy. "versat: A Verified Modern SAT Solver". W Lecture Notes in Computer Science, 363–78. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-27940-9_24.
Pełny tekst źródłaJain, Siddhartha, Eoin O’Mahony i Meinolf Sellmann. "A Complete Multi-valued SAT Solver". W Principles and Practice of Constraint Programming – CP 2010, 281–96. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-15396-9_24.
Pełny tekst źródłaStreszczenia konferencji na temat "SAT solver"
Safar, Mona, M. El-kharashi i Ashraf Salem. "FPGA-Based SAT Solver". W 2006 Canadian Conference on Electrical and Computer Engineering. IEEE, 2006. http://dx.doi.org/10.1109/ccece.2006.277452.
Pełny tekst źródłaUstaoglu, Buse, Sebastian Huhn, Frank Sill Torres, Daniel Grosse i Rolf Drechsler. "SAT-Hard: A Learning-Based Hardware SAT-Solver". W 2019 22nd Euromicro Conference on Digital System Design (DSD). IEEE, 2019. http://dx.doi.org/10.1109/dsd.2019.00021.
Pełny tekst źródłaBrowning, B., i A. Remshagen. "A SAT-based solver for Q-ALL SAT". W the 44th annual southeast regional conference. New York, New York, USA: ACM Press, 2006. http://dx.doi.org/10.1145/1185448.1185456.
Pełny tekst źródłaGong, Weiwei, i Xu Zhou. "A survey of SAT solver". W APPLIED MATHEMATICS AND COMPUTER SCIENCE: Proceedings of the 1st International Conference on Applied Mathematics and Computer Science. Author(s), 2017. http://dx.doi.org/10.1063/1.4981999.
Pełny tekst źródłaOzolins, Emils, Karlis Freivalds, Andis Draguns, Eliza Gaile, Ronalds Zakovskis i Sergejs Kozlovics. "Goal-Aware Neural SAT Solver". W 2022 International Joint Conference on Neural Networks (IJCNN). IEEE, 2022. http://dx.doi.org/10.1109/ijcnn55064.2022.9892733.
Pełny tekst źródłaLuo, Mao, Chu-Min Li, Fan Xiao, Felip Manyà i Zhipeng Lü. "An Effective Learnt Clause Minimization Approach for CDCL SAT Solvers". W Twenty-Sixth International Joint Conference on Artificial Intelligence. California: International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/98.
Pełny tekst źródłaAmendola, Giovanni, Carmine Dodaro i Marco Maratea. "A Formal Approach for Cautious Reasoning in Answer Set Programming (Extended Abstract)". W Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. California: International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/652.
Pełny tekst źródłaMeyer, Q., F. Schönfeld, M. Stamminger i R. Wanka. "3-SAT on CUDA: Towards a massively parallel SAT solver". W Simulation (HPCS 2010). IEEE, 2010. http://dx.doi.org/10.1109/hpcs.2010.5547116.
Pełny tekst źródłaVieira, Bernardo C., Fabrício V. Andrade i Antônio O. Fernandes. "A modular CNF-based SAT solver". W the 23rd symposium. New York, New York, USA: ACM Press, 2010. http://dx.doi.org/10.1145/1854153.1854202.
Pełny tekst źródłaHara, Kazuaki, Naoki Takeuchi, Masashi Aono i Yuko Hara-Azumi. "Amoeba-Inspired Stochastic Hardware SAT Solver". W 2019 20th International Symposium on Quality Electronic Design (ISQED). IEEE, 2019. http://dx.doi.org/10.1109/isqed.2019.8697729.
Pełny tekst źródłaRaporty organizacyjne na temat "SAT solver"
Baader, Franz, Pavlos Marantidis i Alexander Okhotin. Approximately Solving Set Equations. Technische Universität Dresden, 2016. http://dx.doi.org/10.25368/2022.227.
Pełny tekst źródłaMalik, Sharad. Augmenting SAT Solvers for Network Configuration/Planning. Fort Belvoir, VA: Defense Technical Information Center, listopad 2006. http://dx.doi.org/10.21236/ada459907.
Pełny tekst źródłaBaader, Franz, i Barbara Morawska. Matching with respect to general concept inclusions in the Description Logic EL. Technische Universität Dresden, 2014. http://dx.doi.org/10.25368/2022.205.
Pełny tekst źródłaBannochie, C. Results of Hg speciation testing on 3Q15 tank 50, salt solution feed tank (SSFT), and solvent hold tank (SHT) materials. Office of Scientific and Technical Information (OSTI), sierpień 2015. http://dx.doi.org/10.2172/1212656.
Pełny tekst źródłaRodier, Caroline, Andrea Broaddus, Miguel Jaller, Jeffery Song, Joschka Bischoff i Yunwan Zhang. Cost-Benefit Analysis of Novel Access Modes: A Case Study in the San Francisco Bay Area. Mineta Transportation Institute, listopad 2020. http://dx.doi.org/10.31979/mti.2020.1816.
Pełny tekst źródłaKolb, G., D. Neary, M. Ringham i T. Greenlee. Dynamic simulation of a molten-salt solar receiver. Office of Scientific and Technical Information (OSTI), marzec 1989. http://dx.doi.org/10.2172/6346050.
Pełny tekst źródłaGölles, Markus, Viktor Unterberger, Valentin Kaisermayer, Thomas Nigitz i Daniel Muschick. Supervisory control of large-scale solar thermal systems. IEA SHC Task 55, styczeń 2021. http://dx.doi.org/10.18777/ieashc-task55-2021-0001.
Pełny tekst źródłaRapp, Jim, Ken Duncan i Steve Albert. Solar Feasibility Study May 2013 - San Carlos Apache Tribe. Office of Scientific and Technical Information (OSTI), maj 2013. http://dx.doi.org/10.2172/1132530.
Pełny tekst źródłaMoridis, G. J. A new set of direct and iterative solvers for the TOUGH2 family of codes. Office of Scientific and Technical Information (OSTI), kwiecień 1995. http://dx.doi.org/10.2172/72891.
Pełny tekst źródłaPeters, T. B., F. F. Fondeur i K. M. L. Taylor-Pashow. Results From The Salt Disposition Project Next Generation Solvent Demonstration Plan. Office of Scientific and Technical Information (OSTI), kwiecień 2014. http://dx.doi.org/10.2172/1127074.
Pełny tekst źródła