Gotowa bibliografia na temat „SAT”
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”.
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"
Nieuwenhuis, Robert, Albert Oliveras i Cesare Tinelli. "Solving SAT and SAT Modulo Theories". Journal of the ACM 53, nr 6 (listopad 2006): 937–77. http://dx.doi.org/10.1145/1217856.1217859.
Pełny tekst źródłaDal Palù, Alessandro, Agostino Dovier, Andrea Formisano i Enrico Pontelli. "CUD@SAT: SAT solving on GPUs". Journal of Experimental & Theoretical Artificial Intelligence 27, nr 3 (5.09.2014): 293–316. http://dx.doi.org/10.1080/0952813x.2014.954274.
Pełny tekst źródłaGanian, Robert, i Stefan Szeider. "New width parameters for SAT and #SAT". Artificial Intelligence 295 (czerwiec 2021): 103460. http://dx.doi.org/10.1016/j.artint.2021.103460.
Pełny tekst źródłaMagaji, Buhari, Nasiru Yahaya Pindiga i Ibrahim Mohammed Bida. "Synthesis of TiO\(_2\) Impregnated Ribes nigrum Stem Nanoactivated Carbon and their Application to Remove Heavy Metals". Asian Journal of Chemical Sciences 14, nr 2 (26.03.2024): 149–60. http://dx.doi.org/10.9734/ajocs/2024/v14i2300.
Pełny tekst źródłaSugawa, Oka, i I. Putu Suhada Agung. "Strategi Manajemen Acara Festival Sinema Akhir Tahun (SAT) Sebagai Jalur Ekshibisi Film Tahun 2019 - 2021". CandraRupa : Journal of Art, Design, and Media 3, nr 1 (7.03.2024): 10–21. http://dx.doi.org/10.37802/candrarupa.v3i1.580.
Pełny tekst źródłaGregg, Kevin R. "Japan's SAT?" Science 260, nr 5106 (16.04.1993): 277. http://dx.doi.org/10.1126/science.260.5106.277.a.
Pełny tekst źródłaMcLeod, Norman. "Japan's SAT?" Science 260, nr 5106 (16.04.1993): 277. http://dx.doi.org/10.1126/science.260.5106.277.b.
Pełny tekst źródłaCarroll, John J. "Japan's SAT?" Science 260, nr 5106 (16.04.1993): 277. http://dx.doi.org/10.1126/science.260.5106.277.c.
Pełny tekst źródłaCarroll, John J. "Japan's SAT?" Science 260, nr 5106 (16.04.1993): 277. http://dx.doi.org/10.1126/science.260.5106.277-c.
Pełny tekst źródłaObradović, Nadežda, i Vida Ognjenović. "Stari sat". World Literature Today 72, nr 1 (1998): 170. http://dx.doi.org/10.2307/40153662.
Pełny tekst źródłaRozprawy doktorskie na temat "SAT"
AXELSSON, LUDVIG, i TIM LINDEBERG. "SAT doku Att lösa Sudoku med moderna SAT-lösare". Thesis, KTH, Skolan för datavetenskap och kommunikation (CSC), 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-157550.
Pełny tekst źródłaSudoku is a popular puzzle game that originates from Japan. The Sudokuproblem has been shown to be NP-complete and therefore thereprobably does not exist an effecient way of solving large puzzles. In recentyears there has been a lot of research into solving the SAT problem.This report examined various SAT solvers from “The International SATCompetition” to investigate whether there exists a correlation betweenthe execution time and the difficulty level of puzzles and to determinewhich of these are most effective for solving puzzles of varying difficultyand size. To examine the above a large number of puzzles were generatedand two tests were performed. One test measured the executiontime of various SAT solvers when solving puzzles of varying difficulty.The second test measured the time that the SAT solvers took to solvepuzzles of different sizes. The tested SAT solvers are Glucose, Lingling,Minisat, Plingeling, Treengeling and Zenn.The results show a correlation between the execution time of theSAT solvers and the difficulty of the puzzles when looking at the averagetime of the solvers. A linear regression test gave a coefficent ofdetermination of approximately 0.8. Some solvers had a significant correlationand other solvers showed almost no correlation at all. Thecorrelation could also be attributed to the difference in the number ofclues between the puzzles. This however does not explain the disparitybetween puzzles of varying difficulty with the same number of clues.The average time for all solvers were approximately 20 ms for puzzlesof order three and about 50 s for puzzles of order nine. Of the testedSAT solvers, Minisat was the fastest at solving both the puzzles of orderthree and puzzles of higher order.
Szczepanski, Nicolas. "SAT en Parallèle". Thesis, Artois, 2017. http://www.theses.fr/2017ARTO0403/document.
Pełny tekst źródłaThis thesis deals with propositional satisfiability (SAT) in a massively parallel setting. The SAT problem is 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 design of efficient algorithms based on the approaches « portfolio » and « divide and conquer ». Secondly, an adaptation of several parallel programming models including hybrid (parallel and distributed computing) to SAT is proposed. This work has led to several contributions to international conferences and highly competitive distributed SAT solvers
Lardeux, Frédéric. "Approches hybrides pour les problèmes de satisfiabilité (SAT et MAX-SAT)". Angers, 2005. http://www.theses.fr/2005ANGE0024.
Pełny tekst źródłaThis thesis deals with the resolution of the satisfiability problems SAT and MAX-SAT. Our contributions are in three types. First, we have developed the memetic algorithm GASAT for the SAT and MAX-SAT problems which hybridies a tabu algorithm and a genetic algorithm. Some specific tools for the satisfiability problems have been included in it such as intensification mechanisms, diversification mechanisms and a new crossover operator. Next, we have proposed a new resolution framework which permits the exact and the approached methods to handle the same representation of the search space. To do this, we have added a third truth value ``undetermined''. The results obtained by the tri-valued hybrid algorithms show the utility of this resolution framework. Finally, we are interested in the branching heuristics for the Branch and Bound algorithms in the MAX-SAT context. Our study shows that these heuristics react in different ways in function of the initial parameters, the structure of the studied instances and the improved mechanisms for Branch and Bound. The findings of this study may lead to the creation of new heuristics specifically dedicated to the MAX-SAT problem
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.
Pełny tekst źródłaDarras, Sylvain. "Traitements locaux dans les arbres de recherche pour SAT et max-SAT". Amiens, 2008. http://www.theses.fr/2008AMIE0120.
Pełny tekst źródłaThe difficulty of combinatorial problem resolution is mainly due to the exponential size of their search-space. The SAT and Max-SAT problems belong to this category. This thesis aims to increase resolution abilities of complete SAT and Max-SAT solvers, thanks to a better exploitation of information revealed all along the search-tree. About SAT, we propose a new study of the implication graph that allows to highlight possible subsumptions of existing clauses. The objective is to decrease the size of clauses belonging to the formula, in order to get them more expressive and efficient. Therefore, we develop a light computation of the implication graph, guided by the clause to subsume, finding a subsumption of this clause if there exists one. Our research on Max-SAT have focused on a better computation of the lower bound in Branch-and-Bound algorithms. Considering a solver whose lower bound estimation (or at least a part of it) relies on an inconsistent clause-set research, our approach aims to avoid repeated computation of equivalent inconsistent cores. Thanks to a storage of some of these inconsistent clause-sets from a node to its child-nodes, it is possible to reuse directly these elements without any new computation. Moreover, these cores increase the lower bound quality by keeping the efficient inconsistent sets
Bayless, Sam. "SAT modulo monotonic theories". Thesis, University of British Columbia, 2017. http://hdl.handle.net/2429/61062.
Pełny tekst źródłaScience, Faculty of
Computer Science, Department of
Graduate
Suteu, Silviu Cezar. "OPS-SAT Software Simulator". Thesis, Luleå tekniska universitet, Institutionen för system- och rymdteknik, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-59903.
Pełny tekst źródłaBierlee, Hendrik. "The MiniZinc-SAT Compiler". Thesis, Uppsala universitet, Institutionen för informationsteknologi, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-438608.
Pełny tekst źródłaONO, Takao, i Tomio HIRATA. "Approximation Algorithms for MAX SAT". Institute of Electronics, Information and Communication Engineers, 2000. http://hdl.handle.net/2237/15068.
Pełny tekst źródłaNguyen, Van-Hau. "SAT Encodings of Finite CSPs". Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2015. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-162186.
Pełny tekst źródłaKsiążki na temat "SAT"
Lazare, D. De. Sat. Čačak: Pčelica, 2018.
Znajdź pełny tekst źródłaSukhonthā, Suwannī. Rư̄ang san chut sūan sat. [Bangkok]: Samnakphim Dūangtā, 1985.
Znajdź pełny tekst źródłaShāhid, Humāyūn̲ Parvez. Sat zamīnān̲, sat asmān: Panjābī g̲h̲azlān̲. Lāhaur: Pākistān Panjābī Adabī Parhiyā, 1989.
Znajdź pełny tekst źródłaGiunchiglia, Enrico, i Toby Walsh, red. SAT 2005. Dordrecht: Springer Netherlands, 2006. http://dx.doi.org/10.1007/978-1-4020-5571-3.
Pełny tekst źródłaIlić, Dunja. Sat: Roman. Beograd: Draganić, 2010.
Znajdź pełny tekst źródłaGretchen, VanEsselstyn, i Kaplan Inc, red. SAT 1600. New York: Simon & Schuster, 2003.
Znajdź pełny tekst źródłaWestwood, Dean. Organic SAT. Bellevue, Wash: Clerestory Books, 2010.
Znajdź pełny tekst źródłaK, Wolf Ira, red. Barron's SAT. Wyd. 2. Hauppauge, N.Y: Barron's Educational Series, 2010.
Znajdź pełny tekst źródłaInc, Kaplan, red. SAT II. Wyd. 2. New York, NY: Simon & Schuster, 2004.
Znajdź pełny tekst źródłaKarl, Lee, i Kaplan Inc, red. SAT II. Wyd. 2. New York, NY: Simon & Schuster, 2003.
Znajdź pełny tekst źródłaCzęści książek na temat "SAT"
Hari Govind, V. K., Isabel Garcia-Contreras, Sharon Shoham i Arie Gurfinkel. "Speculative SAT Modulo SAT". W Tools and Algorithms for the Construction and Analysis of Systems, 43–60. Cham: Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-57246-3_4.
Pełny tekst źródłaPatanella, Daniel. "SAT". W Encyclopedia of Child Behavior and Development, 1290–91. Boston, MA: Springer US, 2011. http://dx.doi.org/10.1007/978-0-387-79061-9_2499.
Pełny tekst źródłaDwivedi, Amitabh Vikram. "Sat". W Hinduism and Tribal Religions, 1–2. Dordrecht: Springer Netherlands, 2018. http://dx.doi.org/10.1007/978-94-024-1036-5_638-1.
Pełny tekst źródłaFischer, R. X., i W. H. Baur. "SAT". W Zeolite-Type Crystal Structures and their Chemistry. Framework Type Codes RON to STI, 133–40. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-540-70884-1_12.
Pełny tekst źródłaBovaird, James A., i Dylan Schenk. "SAT". W Encyclopedia of Cross-Cultural School Psychology, 830–32. Boston, MA: Springer US, 2010. http://dx.doi.org/10.1007/978-0-387-71799-9_364.
Pełny tekst źródłaDwivedi, Amitabh Vikram. "Sat". W Hinduism and Tribal Religions, 1434–35. Dordrecht: Springer Netherlands, 2022. http://dx.doi.org/10.1007/978-94-024-1188-1_638.
Pełny tekst źródłaKono, Mari, i Shuichi Tsuji. "ST8Sia-V (SAT-V/SAT-III)". W Handbook of Glycosyltransferases and Related Genes, 347–51. Tokyo: Springer Japan, 2002. http://dx.doi.org/10.1007/978-4-431-67877-9_49.
Pełny tekst źródłaSzeider, Stefan. "Parameterized SAT". W Encyclopedia of Algorithms, 1530–32. New York, NY: Springer New York, 2016. http://dx.doi.org/10.1007/978-1-4939-2864-4_283.
Pełny tekst źródłaSzeider, Stefan. "Parameterized SAT". W Encyclopedia of Algorithms, 639–40. Boston, MA: Springer US, 2008. http://dx.doi.org/10.1007/978-0-387-30162-4_283.
Pełny tekst źródłaPosthoff, Christian, i Bernd Steinbach. "SAT-Problems". W Logic Functions and Equations, 299–337. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-02420-8_7.
Pełny tekst źródłaStreszczenia konferencji na temat "SAT"
Hong, Xiaoyan, Dijiang Huang, Mario Gerla i Zhen Cao. "SAT". W the 3rd international workshop. New York, New York, USA: ACM Press, 2008. http://dx.doi.org/10.1145/1403007.1403015.
Pełny tekst źródłaSitawarin, Chawin, Supriyo Chakraborty i David Wagner. "SAT". W CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security. New York, NY, USA: ACM, 2021. http://dx.doi.org/10.1145/3474369.3486878.
Pełny tekst źródłaHassan, Rakibul, Setareh Rafatirad, Houman Homayoun i Sai Manoj Pudukotai Dinakarrao. "SAT to SAT-hard clause translator". W the International Conference. New York, New York, USA: ACM Press, 2019. http://dx.doi.org/10.1145/3349569.3351542.
Pełny tekst źródłaShen, Zhenghui, Kyudeok Oh, Martti Toivakka i Hak Lae Lee. "Preparation of Cellulose Nanofibrils/Salt Hydrate Composite Phase Change Materials for Thermal Energy Storage". W Advances in Pulp and Paper Research. Pulp & Paper Fundamental Research Committee (FRC), Manchester, 2022. http://dx.doi.org/10.15376/frc.2022.1.157.
Pełny tekst źródłaHassan, Rakibul, Gaurav Kolhe, Setareh Rafatirad, Houman Homayoun i Sai Manoj Pudukotai Dinakarrao. "SATConda: SAT to SAT-Hard Clause Translator". W 2020 21st International Symposium on Quality Electronic Design (ISQED). IEEE, 2020. http://dx.doi.org/10.1109/isqed48828.2020.9137052.
Pełny tekst źródłaPy, Matthieu, Mohamed Sami Cherif i Djamal Habet. "Computing Max-SAT Refutations using SAT Oracles". W 2021 IEEE 33rd International Conference on Tools with Artificial Intelligence (ICTAI). IEEE, 2021. http://dx.doi.org/10.1109/ictai52525.2021.00066.
Pełny tekst źródłaUstaoglu, Buse, Sebastian Huhn, Daniel Große i Rolf Drechsler. "SAT-Lancer". W GLSVLSI '18: Great Lakes Symposium on VLSI 2018. New York, NY, USA: ACM, 2018. http://dx.doi.org/10.1145/3194554.3194643.
Pełny tekst źródłaTits, D. "Web-Sat". W IEE Colloquium on EUTELSAT - New Products and Services. IEE, 2000. http://dx.doi.org/10.1049/ic:20000170.
Pełny tekst źródłaFeng, Jianlin, Huijun Liu i Jing Zou. "SAT-MOD". W Special interest tracks and posters of the 14th international conference. New York, New York, USA: ACM Press, 2005. http://dx.doi.org/10.1145/1062745.1062865.
Pełny tekst źródłaXu, Hui, Rob A. Rutenbar i Karem Sakallah. "sub-SAT". W the 2002 international symposium. New York, New York, USA: ACM Press, 2002. http://dx.doi.org/10.1145/505388.505432.
Pełny tekst źródłaRaporty organizacyjne na temat "SAT"
Zawadzki, Erik, Andre Platzer i Geoffrey J. Gordon. A Generalization of SAT and #SAT for Robust Policy Evaluation. Fort Belvoir, VA: Defense Technical Information Center, czerwiec 2014. http://dx.doi.org/10.21236/ada606746.
Pełny tekst źródłaReed, Helen. Three Corner Sat Constellation. Fort Belvoir, VA: Defense Technical Information Center, grudzień 2002. http://dx.doi.org/10.21236/ada418973.
Pełny tekst źródłaClarke, Edmund, Daniel Kroening, Natasha Sharygina i Karen Yorav. SAT-Based Predicate Abstraction of Programs. Fort Belvoir, VA: Defense Technical Information Center, wrzesień 2005. http://dx.doi.org/10.21236/ada441311.
Pełny tekst źródłaBaader, Franz, i Barbara Morawska. SAT Encoding of Unification in EL. Technische Universität Dresden, 2010. http://dx.doi.org/10.25368/2022.177.
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łaGoodman, Joshua, Oded Gurantz i Jonathan Smith. Take Two! SAT Retaking and College Enrollment Gaps. Cambridge, MA: National Bureau of Economic Research, sierpień 2018. http://dx.doi.org/10.3386/w24945.
Pełny tekst źródłaPeñaherrera-León, Ricardo, Adans Bermeo M., Marcos Agurto Adrianzen, Déborah Martínez Villarreal, Lina Salazar i Tsuneki Hori. Mejora de la eficiencia de los sistemas de alerta temprana utilizando ciencias de comportamiento. Inter-American Development Bank, kwiecień 2024. http://dx.doi.org/10.18235/0013041.
Pełny tekst źródłaChauhan, Pankaj, Daniel Kroening i Edmund Clarke. A SAT-Based Algorithm for Reparameterization in Symbolic Simulation. Fort Belvoir, VA: Defense Technical Information Center, grudzień 2003. http://dx.doi.org/10.21236/ada461257.
Pełny tekst źródłaBriones, Roehlano, i Joe-Air Jiang, red. Smart Agricultural Transformation in Asian Countries. Asian Productivity Organization, czerwiec 2023. http://dx.doi.org/10.61145/kgou7399.
Pełny tekst źródłaBaader, Franz, Stefan Borgwardt i Barbara Morawska. SAT Encoding of Unification in ELHR+ w.r.t. Cycle-Restricted Ontologies. Technische Universität Dresden, 2012. http://dx.doi.org/10.25368/2022.186.
Pełny tekst źródła