Gotowe bibliografie tematyczne / SAT

Gotowa bibliografia na temat „SAT”

Autor: Grafiati
Data publikacji: 4 czerwca 2021
Data aktualizacji: 1 sierpnia 2024

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

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"

1

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ła
Style APA, Harvard, Vancouver, ISO itp.
2

Dal 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ła
Style APA, Harvard, Vancouver, ISO itp.
3

Ganian, 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ła
Style APA, Harvard, Vancouver, ISO itp.
4

Magaji, 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ła
Streszczenie:
Nanoactivated carbons from Ribes nigrum (black currant) stem were prepared using two-step procedure with excellent yield and were characterized using different spectroscopic techniques. The FTIR spectroscopy revealed O-H, C=C, C=N, and C-O stretching. XRD analysis revealed the particle sizes as 29.57 nm for stem activated carbon (SAC) and 26.55 nm for stem activated carbon impregnated with titanium (SAT) while, the morphology of the SAC and SAT were revealed by SEM to be spherical, granular and porous. The prepared nanoactivated materials were used for removal of Pb2+ and Cd2+ from aqueous solution. The influences of initial metal ion concentration, agitation time, adsorbent dose, temperature and pH were studied in batch experiments at room temperature. The adsorption equilibriums were rapid at 60 min of agitation for Pb2+ and Cd2+ on SAT with appreciable %removal. The adsorption data for Pb2+ and Cd2+ on SAT fitted well into Freundlich isotherm than Langmuir given correlation coefficient (R2) very close to unity and appreciable maximum adsorption capacity KF > 1.00. The fitting into Freundlich indicates multilayer coverage on the adsorbents. The kinetic studies showed good correlation coefficient for a pseudo-second order kinetic model for the SAT. The enthalpies of the adsorption process are: +12.754 and +18.377 KJ mol-1 for Pb2+ and Cd2+ on SAT respectively. The entropies of the adsorption process were also evaluated and have been found to be +41.805 and +12.151 KJ mol-1 for Pb2+ and Cd2+ on SAT. The results showed that SAT has the potential to be applied as alternative low-cost nanoadsorbents in the remediation of metal contamination in water.
Style APA, Harvard, Vancouver, ISO itp.
5

Sugawa, 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ła
Streszczenie:
Sinema Akhir Tahun (SAT) merupakan festival film kampus yang diselenggarakan oleh mahasiswa Prodi Film dan Televisi (FTV) Institut Seni Indonesia (ISI) Surakarta. SAT diselenggarakan sebagai distribusi alternatif, supaya para pembuat film, komunitas independen dan mahasiswa dapat menayangkan karyanya. Penelitian ini berfokus pada analisis manajemen acara SAT pada tahun 2019, 2020, dan 2021. Pemilihan tiga tahun tersebut untuk mengetahui strategi manajemen acara SAT sebelum pandemi, saat pandemi dan setelah pandemi. Penelitian ini menggunakan metode penelitian deskriptif kualitatif. Data dikumpulkan dengan wawancara narasumber kunci, studi dokumentasi berupa arsip dan laporan kegiatan, serta triangulasi sumber data. Analisis data SWOT digunakan untuk mengetahui strategi dan aspek evaluatif pada konsep Management Event Joe Goldblatt yang terdiri dari research, design, planning, coordinating, dan evaluation. Hasil penelitian menunjukkan bahwa penyelenggaraan SAT 2019, 2020, dan 2021 terbukti mampu menjadi embrio festival film mahasiswa di Indonesia yang diinisiasi oleh kampus.
Style APA, Harvard, Vancouver, ISO itp.
6

Gregg, 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ła
Style APA, Harvard, Vancouver, ISO itp.
7

McLeod, 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ła
Style APA, Harvard, Vancouver, ISO itp.
8

Carroll, 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ła
Style APA, Harvard, Vancouver, ISO itp.
9

Carroll, 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ła
Style APA, Harvard, Vancouver, ISO itp.
10

Obradović, 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ła
Style APA, Harvard, Vancouver, ISO itp.
Więcej źródeł

Rozprawy doktorskie na temat "SAT"

1

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ła
Streszczenie:
Sudoku är ett mycket populärt pusselspel som härstammar från Japan. Sudokuproblemet har visats vara NP-fullständigt och det finns därför troligen inget effektivt sätt att lösa stora pussel. På senare år har det skett mycket forskning kring SAT-lösare. I denna rapport prövades olika SAT-lösare från ”International SAT-Competition” för att undersöka om det existerar en korrelation mellan exekveringstid och svårighetsgradering samt för att avgöra vilken av dessa som är effektivast för att lösa pussel av olika svårighetsgrad och storlek. För att undersöka detta genereradesett stort antal pussel och två tester utfördes. Ett test mätteexekveringstiden för olika SAT-lösare på pussel av olika svårighetsgrad.Det andra testet mätte tiden för SAT-lösarna på pussel av olika storlek.De prövade SAT-lösarna är Glucose, Lingeling, Minisat, Plingeling,Treengeling och Zenn.Resultaten visar på en korrelation mellan exekveringstid och svårighetsgradför de prövade SAT-lösarna när ett genomsnitt för lösarnabehandlades. Vid ett linjärt regressionstest erhölls en bestämningskoefficentpå ca 0.8. Vissa lösare hade en stor korrelation och andra lösarevisade inte någon korrelation alls. Korrelationen skulle också kunna beropå skillnaden i antalet ledtrådar mellan de olika pusslena. Det förklarardock inte den skillnad som finns mellan pussel av olika svårighetsgradmed samma antal ledtrådar.Genomsnittstiden för samtliga lösare var ca 20 ms för pussel avordning tre och ca 50 s för pussel av ordning nio. Av de prövade SATlösarnavar Minisat snabbast, både för pusslena av ordning tre och avhögre ordningar.
Sudoku 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.
Style APA, Harvard, Vancouver, ISO itp.
2

Szczepanski, Nicolas. "SAT en Parallèle". Thesis, Artois, 2017. http://www.theses.fr/2017ARTO0403/document.

Pełny tekst źródła
Streszczenie:
La thèse porte sur la résolution des problèmes de satisfaisabilité booléenne (SAT) dans un cadre massivement parallèle. Le problème SAT est largement utilisé pour résoudre des problèmes combinatoires de première importance comme la vérification formelle de matériels et de logiciels, la bio-informatique, la cryptographie, la planification et l’ordonnancement de tâches. Plusieurs contributions sont apportées dans cette thèse. Elles vont de la conception d’algorithmes basés sur les approches « portfolio » et « diviser pour mieux régner », à l’adaptation de modèles de programmation parallèle, notamment hybride (destinés à des architectures à mémoire partagée et distribuée), à SAT, en passant par l’amélioration des stratégies de résolution. Ce travail de thèse a donné lieu à plusieurs contributions dans des conférences internationales du domaine ainsi qu’à plusieurs outils (open sources) de résolution des problèmes SAT, compétitifs au niveau international
This 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
Style APA, Harvard, Vancouver, ISO itp.
3

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ła
Streszczenie:
Cette thèse est centrée sur la résolution des problèmes de satisfiabilité SAT et MAX-SAT. Les contributions apportées sont de trois types. Tout d'abord nous avons développé l'algorithme mémétique GASAT pour les problèmes SAT et MAX-SAT hybridant un algorithme tabou et un algorithme génétique. Des outils spécifiques aux problèmes de satisfiabilité y ont été intégrés tels que des mécanismes d'intensification, de diversification et un nouvel opérateur de croisement. Ensuite, nous avons proposé un nouveau cadre de résolution permettant aux méthodes exactes et aux méthodes approchées de manipuler la même représentation de l'espace de recherche. Pour cela, nous avons ajouté une troisième valeur de vérité "indéterminé". Les résultats obtenus par les algorithmes hybrides trivalués montrent l'intérêt de ce cadre de résolution. Enfin, nous nous sommes penchés sur les heuristiques de branchement des algorithmes de Branch and Bound pour le problème MAX-SAT. L'étude que nous présentons montre que ces heuristiques réagissent très différemment en fonction des paramètres initiaux, de la structure de l'instance étudiée et des mécanismes d'amélioration du Branch and Bound. Elle permet d'envisager la création de nouvelles heuristiques spécifiquement dédiées au problème MAX-SAT
This 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
Style APA, Harvard, Vancouver, ISO itp.
4

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ła
Streszczenie:
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 systemes sat pour lesquelles il est possible de calculer, polynomialement par rapport a la taille de ces systemes, l'esperance, ou n'importe quel autre moment, du nombre de solutions. On montre egalement, a propos du probleme max-sat, que l'on peut calculer, pour n'importe quel systeme sat, toujours polynomialement par rapport a la taille du systeme, l'esperance, ou n'importe quel autre moment, du nombre de clauses satisfaites. En revanche, en ce qui concerne le probleme sat, la complexite du calcul de la probabilite d'existence d'une solution d'une classe de systemes sat est toujours un probleme ouvert
Style APA, Harvard, Vancouver, ISO itp.
5

Darras, 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ła
Streszczenie:
La difficulté de résolution des problèmes combinatoires réside dans la taille exponentielle de leur espace de recherche. Parmi ces problèmes figurent les problèmes de satisfaction de contraintes, tels que SAT et Max-SAT. Ce mémoire s'inscrit dans une politique d'augmentation des capacités de résolution des solveurs complets SAT et Max-SAT, grâce à une meilleure exploitation des informations révélées par le parcours de l'arbre de recherche. Concernant le problème SAT, nous proposons une nouvelle étude du graphe d'implication qui nous permet de mettre en relief de possibles subsomptions appliquées aux clauses existantes. L'objectif de cette technique est de provoquer une diminution de la taille des clauses de la formule, afin de rendre celles-ci plus expressives et efficaces. Pour cela, nous développons un parcours peu coûteux du graphe d'implication, dirigé par la clause à subsumer, déterminant (s'il en existe) une subsomption de cette clause. Les travaux appliqués au domaine Max-SAT ont porté sur une amélioration du calcul de la borne inférieure des algorithmes "Branch-and-Bound". Considérant un solveur dont l'estimation de la borne inférieure repose, au moins en partie, sur la recherche d'ensembles conflictuels, notre approche vise à éviter le calcul répété de noyaux inconsistants équivalents. Grâce à l'enregistrement de certains de ces ensembles conflictuels d'un noeud vers ses noeuds-fils, il est possible de réutiliser directement ces éléments sans nécessiter de calcul. De plus, ces noyaux permettent une amélioration de la qualité de la borne inférieure en favorisant la conservation les ensembles conflictuels efficaces
The 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
Style APA, Harvard, Vancouver, ISO itp.
6

Bayless, Sam. "SAT modulo monotonic theories". Thesis, University of British Columbia, 2017. http://hdl.handle.net/2429/61062.

Pełny tekst źródła
Streszczenie:
Satisfiability Modulo Theories (SMT) solvers are a class of efficient constraint solvers which form integral parts of many algorithms. Over the years, dozens of different Satisfiability Modulo Theories solvers have been developed, supporting dozens of different logics. However, there are still many important applications for which specialized SMT solvers have not yet been developed. We develop a framework for easily building efficient SMT solvers for previously unsupported logics. Our techniques apply to a wide class of logics which we call monotonic theories, which include many important elements of graph theory and automata theory. Using this SAT Modulo Monotonic Theories framework, we created a new SMT solver, MonoSAT. We demonstrate that MonoSAT improves the state of the art across a wide body of applications, ranging from circuit layout and data center management to protocol synthesis - and even to video game design.
Science, Faculty of
Computer Science, Department of
Graduate
Style APA, Harvard, Vancouver, ISO itp.
7

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ła
Streszczenie:
OPS-SAT is an in-orbit laboratory mission designed to allow experimenters todeploy new on-board software and perform in-orbit demonstrations of new tech-nology and concepts related to mission operations. The NanoSat MO Frame-work facilitates the process of developing experimental on-board software for OPS-SAT by abstracting the complexities related to communication across the space toground link as well as the details of low-level device access. The objective of thisproject is to implement functional simulation models of OPS-SAT peripherals andorbit/attitude behavior, which integrated together with the NanoSat MO Frame-work provide a sufficiently realistic runtime environment for OPS-SAT on-boardsoftware experiment development. Essentially, the simulator exposes communi-cation interfaces for executing commands which affect the payload instrumentsand/or retrieve science data and telemetry. The commands can be run either fromthe MO Framework or manually, from an intuitive GUI which performs syntaxcheck. In this case, the output will be displayed for advanced debugging. The endresult of the thesis work is a virtual machine which has all the tools installed todevelop cutting edge technology space applications.
Style APA, Harvard, Vancouver, ISO itp.
8

Bierlee, 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ła
Streszczenie:
Combinatorial (optimization) problems occur in nature and society. Constraint modeling languages such as MiniZinc allow the user to declaratively specify such problems in terms of its decision variables and constraints. Subsequently, the MiniZinc model can be compiled into an equivalent (Boolean) SAT formula to be solved by a SAT solver. This thesis reports on the design, implementation and experimental evaluation of the new MiniZinc-SAT compiler, which supports single or even mixed usage of three distinct integer variable encoding methods.
Style APA, Harvard, Vancouver, ISO itp.
9

ONO, 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ła
Style APA, Harvard, Vancouver, ISO itp.
10

Nguyen, 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ła
Streszczenie:
Boolean satisfiability (SAT) is the problem of determining whether there exists an assignment of the Boolean variables to the truth values such that a given Boolean formula evaluates to true. SAT was the first example of an NP-complete problem. Only two decades ago SAT was mainly considered as of a theoretical interest. Nowadays, the picture is very different. SAT solving becomes mature and is a successful approach for tackling a large number of applications, ranging from artificial intelligence to industrial hardware design and verification. SAT solving consists of encodings and solvers. In order to benefit from the tremendous advances in the development of solvers, one must first encode the original problems into SAT instances. These encodings should not only be easily generated, but should also be efficiently processed by SAT solvers. Furthermore, an increasing number of practical applications in computer science can be expressed as constraint satisfaction problems (CSPs). However, encoding a CSP to SAT is currently regarded as more of an art than a science, and choosing an appropriate encoding is considered as important as choosing an algorithm. Moreover, it is much easier and more efficient to benefit from highly optimized state-of-the-art SAT solvers than to develop specialized tools from scratch. Hence, finding appropriate SAT encodings of CSPs is one of the most fascinating challenges for solving problems by SAT. This thesis studies SAT encodings of CSPs and aims at: 1) conducting a comprehensively profound study of SAT encodings of CSPs by separately investigating encodings of CSP domains and constraints; 2) proposing new SAT encodings of CSP domains; 3) proposing new SAT encoding of the at-most-one constraint, which is essential for encoding CSP variables; 4) introducing the redundant encoding and the hybrid encoding that aim to benefit from both two efficient and common SAT encodings (i.e., the sparse and order encodings) by using the channeling constraint (a term used in Constraint Programming) for SAT; and 5) revealing interesting guidelines on how to choose an appropriate SAT encoding in the way that one can exploit the availability of many efficient SAT solvers to solve CSPs efficiently and effectively. Experiments show that the proposed encodings and guidelines improve the state-of-the-art SAT encodings of CSPs.
Style APA, Harvard, Vancouver, ISO itp.
Więcej źródeł

Książki na temat "SAT"

1

Lazare, D. De. Sat. Čačak: Pčelica, 2018.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Sukhonthā, Suwannī. Rư̄ang san chut sūan sat. [Bangkok]: Samnakphim Dūangtā, 1985.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Shā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ła
Style APA, Harvard, Vancouver, ISO itp.
4

Giunchiglia, 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ła
Style APA, Harvard, Vancouver, ISO itp.
5

Ilić, Dunja. Sat: Roman. Beograd: Draganić, 2010.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Gretchen, VanEsselstyn, i Kaplan Inc, red. SAT 1600. New York: Simon & Schuster, 2003.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

Westwood, Dean. Organic SAT. Bellevue, Wash: Clerestory Books, 2010.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

K, Wolf Ira, red. Barron's SAT. Wyd. 2. Hauppauge, N.Y: Barron's Educational Series, 2010.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Inc, Kaplan, red. SAT II. Wyd. 2. New York, NY: Simon & Schuster, 2004.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Karl, Lee, i Kaplan Inc, red. SAT II. Wyd. 2. New York, NY: Simon & Schuster, 2003.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
Więcej źródeł

Części książek na temat "SAT"

1

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ła
Streszczenie:
AbstractState-of-the-art model-checking algorithms like IC3/PDR are based on uni-directional modular SAT solving for finding and/or blocking counterexamples. Modular SAT-solvers divide a SAT-query into multiple sub-queries, each solved by a separate SAT-solver (called a module), and propagate information (lemmas, proof obligations, blocked clauses, etc.) between modules. While modular solving is key to IC3/PDR, it is obviously not as effective as monolithic solving, especially when individual sub-queries are harder to solve than the combined query. This is partially addressed in SAT modulo SAT (SMS) by propagating unit literals back and forth between the modules and using information from one module to simplify the sub-query in another module as soon as possible (i.e., before the satisfiability of any sub-query is established). However, bi-directionality of SMS is limited because of the strict order between decisions and propagation – only one module is allowed to make decisions, until its sub-query is SAT. In this paper, we propose a generalization of SMS, called specSMS, that speculates decisions between modules. This makes it bi-directional – decisions are made in multiple modules, and learned clauses are exchanged in both directions. We further extend DRUP proofs and interpolation, these are useful in model checking, to specSMS. We have implemented specSMS in Z3 and empirically validate it on a series of benchmarks that are provably hard for SMS.
Style APA, Harvard, Vancouver, ISO itp.
2

Patanella, 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ła
Style APA, Harvard, Vancouver, ISO itp.
3

Dwivedi, 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ła
Style APA, Harvard, Vancouver, ISO itp.
4

Fischer, 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ła
Style APA, Harvard, Vancouver, ISO itp.
5

Bovaird, 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ła
Style APA, Harvard, Vancouver, ISO itp.
6

Dwivedi, 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ła
Style APA, Harvard, Vancouver, ISO itp.
7

Kono, 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ła
Style APA, Harvard, Vancouver, ISO itp.
8

Szeider, 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ła
Style APA, Harvard, Vancouver, ISO itp.
9

Szeider, 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ła
Style APA, Harvard, Vancouver, ISO itp.
10

Posthoff, 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ła
Style APA, Harvard, Vancouver, ISO itp.

Streszczenia konferencji na temat "SAT"

1

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ła
Style APA, Harvard, Vancouver, ISO itp.
2

Sitawarin, 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ła
Style APA, Harvard, Vancouver, ISO itp.
3

Hassan, 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ła
Style APA, Harvard, Vancouver, ISO itp.
4

Shen, 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ła
Streszczenie:
Salt hydrate phase change materials (PCMs) have been intensively used for thermal energy storage (TES) due to their sharp melting points, high energy storage density, small volume change and low cost. However, the problems of phase separation, supercooling and relatively low thermal conductivity of salt hydrate PCMs need to be addressed for high-efficiency TES. In this research, cellulose nanofibrils (CNFs) and CNFs-based composites were used to improve the TES performance of sodium acetate trihydrate (SAT). The effect of CNFs on the phase stability of SAT was investigated and the involved mechanism was explored by the rheological study. CNFs/graphene nanoplatelets (GNPs) composites and CNFs/silver nanoparticles (AgNPs) composites were prepared and used to improve the TES efficiency of SAT. Results indicate that adding 0.8% of CNFs to SAT increased the viscosity, enhanced solid-like rheological behaviors by entangled nanofiber network, and successfully eliminated phase separation of SAT. Owing to the excellent dispersing capability of CNFs, the aggregations of GNPs and AgNPs were avoided in the prepared CNFs/GNPs and CNFs/AgNPs composites. The resulting SAT-based composite PCMs were phase-stable and exhibited improved thermal conductivities over pure SAT due to the thermal conductivity enhancers, GNPs and AgNPs. Besides, with the combined use of sodium phosphate dibasic dodecahydrate and CNFs/AgNPs0.02 composite, the supercooling degree of SAT decreased to 1.2 °C. The prepared composite PCMs exhibited reasonable phase change temperature and enthalpy, and improved thermal stability. In summary, green and versatile CNFs based composites were prepared, and they successfully overcame the drawbacks of salt hydrate PCMs for TES applications.
Style APA, Harvard, Vancouver, ISO itp.
5

Hassan, 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ła
Style APA, Harvard, Vancouver, ISO itp.
6

Py, 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ła
Style APA, Harvard, Vancouver, ISO itp.
7

Ustaoglu, 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ła
Style APA, Harvard, Vancouver, ISO itp.
8

Tits, 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ła
Style APA, Harvard, Vancouver, ISO itp.
9

Feng, 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ła
Style APA, Harvard, Vancouver, ISO itp.
10

Xu, 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ła
Style APA, Harvard, Vancouver, ISO itp.

Raporty organizacyjne na temat "SAT"

1

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ła
Style APA, Harvard, Vancouver, ISO itp.
2

Reed, 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ła
Style APA, Harvard, Vancouver, ISO itp.
3

Clarke, 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ła
Style APA, Harvard, Vancouver, ISO itp.
4

Baader, 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ła
Streszczenie:
The Description Logic EL is an inexpressive knowledge representation language, which nevertheless has recently drawn considerable attention in the knowledge representation and the ontology community since, on the one hand, important inference problems such as the subsumption problem are polynomial. On the other hand, EL is used to define large biomedical ontologies. Unification in Description Logics has been proposed as a novel inference service that can, for example, be used to detect redundancies in ontologies. In a recent paper, we have shown that unification in EL is NP-complete, and thus of a complexity that is considerably lower than in other Description Logics of comparably restricted expressive power. In this paper, we introduce a new NP-algorithm for solving unification problem in EL, which is based on a reduction to satisfiability in propositional logic (SAT). The advantage of this new algorithm is, on the one hand, that it allows us to employ highly optimized state of the art SAT solverswhen implementing an EL-unification algorithm. On the other hand, this reduction provides us with a proof of the fact that EL-unification is in NP that is much simpler than the one given in our previous paper on EL-unification.
Style APA, Harvard, Vancouver, ISO itp.
5

Malik, 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ła
Style APA, Harvard, Vancouver, ISO itp.
6

Goodman, 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ła
Style APA, Harvard, Vancouver, ISO itp.
7

Peñ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ła
Streszczenie:
La presente nota técnica tiene como objetivo presentar el estudio de un Sistema de Alerta Temprana (SAT), usando las ciencias del comportamiento y la metodología “nudge” aplicado en cinco comunidades de la costa ecuatoriana (Tonchigüe, Jama, San Lorenzo-Piñas, Leonidas Plaza y Palmar) para analizar las razones detrás del bajo involucramiento que las personas y las comunidades han tenido con el SAT.
Style APA, Harvard, Vancouver, ISO itp.
8

Chauhan, 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ła
Style APA, Harvard, Vancouver, ISO itp.
9

Briones, 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ła
Streszczenie:
The report focuses on the concept of Smart Agricultural Transformation (SAT), including the application of advanced technologies in agrifood systems to enhance food security, increase productivity, improve rural livelihoods, and ensure sustainability in Asia. It provides an assessment of SAT readiness in the ROC, India, Indonesia, Pakistan, Thailand, and Vietnam. The report also offers customized recommendations for each of the countries on steps to increase their readiness for SAT, including the development of institutional capacity and improvement of mechanisms for reaping the benefits of SAT. It serves as a valuable guide for policymakers, agribusinesses, farmers' associations, researchers, and other stakeholders striving for smarter and more sustainable agrifood systems in Asia.
Style APA, Harvard, Vancouver, ISO itp.
10

Baader, 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
Streszczenie:
Unification in Description Logics has been proposed as an inference service that can, for example, be used to detect redundancies in ontologies. For the Description Logic EL, which is used to define several large biomedical ontologies, unification is NP-complete. An NP unification algorithm for EL based on a translation into propositional satisfiability (SAT) has recently been presented. In this report, we extend this SAT encoding in two directions: on the one hand, we add general concept inclusion axioms, and on the other hand, we add role hierarchies (H) and transitive roles (R+). For the translation to be complete, however, the ontology needs to satisfy a certain cycle restriction. The SAT translation depends on a new rewriting-based characterization of subsumption w.r.t. ELHR+-ontologies.
Style APA, Harvard, Vancouver, ISO itp.
Możesz być także zainteresowany rozszerzonymi bibliografiami na temat „SAT” dla poszczególnych typów źródeł:
Artykuły w czasopismach Rozprawy doktorskie Książki
Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!

Do bibliografii