Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:( SAT). Showing records 1 – 30 of 236 total matches.

[1] [2] [3] [4] [5] [6] [7] [8]

Search Limiters

Last 2 Years | English Only

Degrees

Levels

Languages

Country

▼ Search Limiters

1. Hiramoto, Shinya. A novel hardware SAT solver using non-chronological backtracking and clause recording : Non-chronologicalバックトラッキング及びclauseレコーディングを用いるハードウェアSATソルバ; Non-chronological バック トラッキング オヨビ clause レコーディング オ モチイル ハードウェア SAT ソルバ.

Degree: Nara Institute of Science and Technology / 奈良先端科学技術大学院大学

Subjects/Keywords: SAT

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Hiramoto, S. (n.d.). A novel hardware SAT solver using non-chronological backtracking and clause recording : Non-chronologicalバックトラッキング及びclauseレコーディングを用いるハードウェアSATソルバ; Non-chronological バック トラッキング オヨビ clause レコーディング オ モチイル ハードウェア SAT ソルバ. (Thesis). Nara Institute of Science and Technology / 奈良先端科学技術大学院大学. Retrieved from http://hdl.handle.net/10061/4298

Note: this citation may be lacking information needed for this citation format:
No year of publication.
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Hiramoto, Shinya. “A novel hardware SAT solver using non-chronological backtracking and clause recording : Non-chronologicalバックトラッキング及びclauseレコーディングを用いるハードウェアSATソルバ; Non-chronological バック トラッキング オヨビ clause レコーディング オ モチイル ハードウェア SAT ソルバ.” Thesis, Nara Institute of Science and Technology / 奈良先端科学技術大学院大学. Accessed July 18, 2019. http://hdl.handle.net/10061/4298.

Note: this citation may be lacking information needed for this citation format:
No year of publication.
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Hiramoto, Shinya. “A novel hardware SAT solver using non-chronological backtracking and clause recording : Non-chronologicalバックトラッキング及びclauseレコーディングを用いるハードウェアSATソルバ; Non-chronological バック トラッキング オヨビ clause レコーディング オ モチイル ハードウェア SAT ソルバ.” Web. 18 Jul 2019.

Note: this citation may be lacking information needed for this citation format:
No year of publication.

Vancouver:

Hiramoto S. A novel hardware SAT solver using non-chronological backtracking and clause recording : Non-chronologicalバックトラッキング及びclauseレコーディングを用いるハードウェアSATソルバ; Non-chronological バック トラッキング オヨビ clause レコーディング オ モチイル ハードウェア SAT ソルバ. [Internet] [Thesis]. Nara Institute of Science and Technology / 奈良先端科学技術大学院大学; [cited 2019 Jul 18]. Available from: http://hdl.handle.net/10061/4298.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
No year of publication.

Council of Science Editors:

Hiramoto S. A novel hardware SAT solver using non-chronological backtracking and clause recording : Non-chronologicalバックトラッキング及びclauseレコーディングを用いるハードウェアSATソルバ; Non-chronological バック トラッキング オヨビ clause レコーディング オ モチイル ハードウェア SAT ソルバ. [Thesis]. Nara Institute of Science and Technology / 奈良先端科学技術大学院大学; Available from: http://hdl.handle.net/10061/4298

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
No year of publication.


University of Debrecen

2. Bécsi, Zoltán József. Intervallumokon végzett számítások .

Degree: DE – TEK – Informatikai Kar, 2009, University of Debrecen

Intervallum alapú logika, intervallumokkal végzett műveletek, SAT probléma megoldása intervallumokkal lineáris időben Advisors/Committee Members: Nagy, Benedek (advisor).

Subjects/Keywords: Intervallum; SAT

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Bécsi, Z. J. (2009). Intervallumokon végzett számítások . (Thesis). University of Debrecen. Retrieved from http://hdl.handle.net/2437/86287

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Bécsi, Zoltán József. “Intervallumokon végzett számítások .” 2009. Thesis, University of Debrecen. Accessed July 18, 2019. http://hdl.handle.net/2437/86287.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Bécsi, Zoltán József. “Intervallumokon végzett számítások .” 2009. Web. 18 Jul 2019.

Vancouver:

Bécsi ZJ. Intervallumokon végzett számítások . [Internet] [Thesis]. University of Debrecen; 2009. [cited 2019 Jul 18]. Available from: http://hdl.handle.net/2437/86287.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Bécsi ZJ. Intervallumokon végzett számítások . [Thesis]. University of Debrecen; 2009. Available from: http://hdl.handle.net/2437/86287

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

3. Al Rammahi, Raheem T. Optimizing Vehicle Usage Using CSP, SAT and MAX-SAT.

Degree: MS, Computer Science, 2016, U of Denver

  Most of the companies in Iraq spend significant amounts of time and money when transferring employees between home and work. In this thesis, we… (more)

Subjects/Keywords: CSP; MAX-SAT; Optimization; SAT; Computer Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Al Rammahi, R. T. (2016). Optimizing Vehicle Usage Using CSP, SAT and MAX-SAT. (Thesis). U of Denver. Retrieved from https://digitalcommons.du.edu/etd/1110

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Al Rammahi, Raheem T. “Optimizing Vehicle Usage Using CSP, SAT and MAX-SAT.” 2016. Thesis, U of Denver. Accessed July 18, 2019. https://digitalcommons.du.edu/etd/1110.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Al Rammahi, Raheem T. “Optimizing Vehicle Usage Using CSP, SAT and MAX-SAT.” 2016. Web. 18 Jul 2019.

Vancouver:

Al Rammahi RT. Optimizing Vehicle Usage Using CSP, SAT and MAX-SAT. [Internet] [Thesis]. U of Denver; 2016. [cited 2019 Jul 18]. Available from: https://digitalcommons.du.edu/etd/1110.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Al Rammahi RT. Optimizing Vehicle Usage Using CSP, SAT and MAX-SAT. [Thesis]. U of Denver; 2016. Available from: https://digitalcommons.du.edu/etd/1110

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Wesleyan University

4. Chavez, Olivia. Diversity, Inequality and Predictive Power: Why Do Colleges Go SAT Optional?.

Degree: Psychology, 2016, Wesleyan University

  Standardized testing is a controversial topic that has gained national attention from the press. Testing is an issue that impacts students from the moment… (more)

Subjects/Keywords: Diversity; College; SAT; SAT Optional; Test Optional

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Chavez, O. (2016). Diversity, Inequality and Predictive Power: Why Do Colleges Go SAT Optional?. (Masters Thesis). Wesleyan University. Retrieved from https://wesscholar.wesleyan.edu/etd_mas_theses/126

Chicago Manual of Style (16th Edition):

Chavez, Olivia. “Diversity, Inequality and Predictive Power: Why Do Colleges Go SAT Optional?.” 2016. Masters Thesis, Wesleyan University. Accessed July 18, 2019. https://wesscholar.wesleyan.edu/etd_mas_theses/126.

MLA Handbook (7th Edition):

Chavez, Olivia. “Diversity, Inequality and Predictive Power: Why Do Colleges Go SAT Optional?.” 2016. Web. 18 Jul 2019.

Vancouver:

Chavez O. Diversity, Inequality and Predictive Power: Why Do Colleges Go SAT Optional?. [Internet] [Masters thesis]. Wesleyan University; 2016. [cited 2019 Jul 18]. Available from: https://wesscholar.wesleyan.edu/etd_mas_theses/126.

Council of Science Editors:

Chavez O. Diversity, Inequality and Predictive Power: Why Do Colleges Go SAT Optional?. [Masters Thesis]. Wesleyan University; 2016. Available from: https://wesscholar.wesleyan.edu/etd_mas_theses/126

5. Reis, Poliana Magalhães. Análise da distribuição do número de operações de resolvedores SAT.

Degree: Mestrado, Ciência da Computação, 2012, University of São Paulo

No estudo da complexidade de problemas computacionais destacam-se duas classes conhecidas como P e NP. A questao P=NP e um dos maiores problemas nao resolvidos… (more)

Subjects/Keywords: Chaff; Chaff; NP-complete; NP-completo; P=NP; P=NP; SAT; SAT; SAT Solvers; SAT Solvers; zChaff.; zChaff.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Reis, P. M. (2012). Análise da distribuição do número de operações de resolvedores SAT. (Masters Thesis). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/45/45134/tde-21012013-220441/ ;

Chicago Manual of Style (16th Edition):

Reis, Poliana Magalhães. “Análise da distribuição do número de operações de resolvedores SAT.” 2012. Masters Thesis, University of São Paulo. Accessed July 18, 2019. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-21012013-220441/ ;.

MLA Handbook (7th Edition):

Reis, Poliana Magalhães. “Análise da distribuição do número de operações de resolvedores SAT.” 2012. Web. 18 Jul 2019.

Vancouver:

Reis PM. Análise da distribuição do número de operações de resolvedores SAT. [Internet] [Masters thesis]. University of São Paulo; 2012. [cited 2019 Jul 18]. Available from: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-21012013-220441/ ;.

Council of Science Editors:

Reis PM. Análise da distribuição do número de operações de resolvedores SAT. [Masters Thesis]. University of São Paulo; 2012. Available from: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-21012013-220441/ ;


Texas A&M University

6. Bian, Kun. Efficient Path Delay Test Generation with Boolean Satisfiability.

Degree: 2013, Texas A&M University

 This dissertation focuses on improving the accuracy and efficiency of path delay test generation using a Boolean satisfiability (SAT) solver. As part of this research,… (more)

Subjects/Keywords: Delay Test; ATPG; SAT

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Bian, K. (2013). Efficient Path Delay Test Generation with Boolean Satisfiability. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/151900

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Bian, Kun. “Efficient Path Delay Test Generation with Boolean Satisfiability.” 2013. Thesis, Texas A&M University. Accessed July 18, 2019. http://hdl.handle.net/1969.1/151900.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Bian, Kun. “Efficient Path Delay Test Generation with Boolean Satisfiability.” 2013. Web. 18 Jul 2019.

Vancouver:

Bian K. Efficient Path Delay Test Generation with Boolean Satisfiability. [Internet] [Thesis]. Texas A&M University; 2013. [cited 2019 Jul 18]. Available from: http://hdl.handle.net/1969.1/151900.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Bian K. Efficient Path Delay Test Generation with Boolean Satisfiability. [Thesis]. Texas A&M University; 2013. Available from: http://hdl.handle.net/1969.1/151900

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Université du Québec à Montréal

7. Monnet, Anthony Jean-Luc. Améliorer l'efficacité de l'algorithme CDCL : décompositions arborescentes de grandes instances, CDCL sans saut arrière et CDCL à ordre partiel.

Degree: 2013, Université du Québec à Montréal

 Cette thèse s'intéresse à l'amélioration des performances pratiques de l'algorithme CDCL (Conftict-Driven Clause Learning) pour la résolution du problème de satisfaisabilité des formules propositionnelles, ou… (more)

Subjects/Keywords: Algorithme CDCL; Problème SAT

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Monnet, A. J. (2013). Améliorer l'efficacité de l'algorithme CDCL : décompositions arborescentes de grandes instances, CDCL sans saut arrière et CDCL à ordre partiel. (Thesis). Université du Québec à Montréal. Retrieved from http://archipel.uqam.ca/5863/1/D2535.pdf

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Monnet, Anthony Jean-Luc. “Améliorer l'efficacité de l'algorithme CDCL : décompositions arborescentes de grandes instances, CDCL sans saut arrière et CDCL à ordre partiel.” 2013. Thesis, Université du Québec à Montréal. Accessed July 18, 2019. http://archipel.uqam.ca/5863/1/D2535.pdf.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Monnet, Anthony Jean-Luc. “Améliorer l'efficacité de l'algorithme CDCL : décompositions arborescentes de grandes instances, CDCL sans saut arrière et CDCL à ordre partiel.” 2013. Web. 18 Jul 2019.

Vancouver:

Monnet AJ. Améliorer l'efficacité de l'algorithme CDCL : décompositions arborescentes de grandes instances, CDCL sans saut arrière et CDCL à ordre partiel. [Internet] [Thesis]. Université du Québec à Montréal; 2013. [cited 2019 Jul 18]. Available from: http://archipel.uqam.ca/5863/1/D2535.pdf.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Monnet AJ. Améliorer l'efficacité de l'algorithme CDCL : décompositions arborescentes de grandes instances, CDCL sans saut arrière et CDCL à ordre partiel. [Thesis]. Université du Québec à Montréal; 2013. Available from: http://archipel.uqam.ca/5863/1/D2535.pdf

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

8. -5591-465X. Using a statistical model to predict student success in Texas Woman's University mathematics program.

Degree: MS, Mathematics, 2018, Texas Woman's University

 Admission applications from high school students are received yearly by colleges but majority of the students that are being admitted eventually do not graduate. Colleges… (more)

Subjects/Keywords: Predict; Mathematics; Graduation; SAT mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

-5591-465X. (2018). Using a statistical model to predict student success in Texas Woman's University mathematics program. (Masters Thesis). Texas Woman's University. Retrieved from http://hdl.handle.net/11274/10741

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Chicago Manual of Style (16th Edition):

-5591-465X. “Using a statistical model to predict student success in Texas Woman's University mathematics program.” 2018. Masters Thesis, Texas Woman's University. Accessed July 18, 2019. http://hdl.handle.net/11274/10741.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

MLA Handbook (7th Edition):

-5591-465X. “Using a statistical model to predict student success in Texas Woman's University mathematics program.” 2018. Web. 18 Jul 2019.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Vancouver:

-5591-465X. Using a statistical model to predict student success in Texas Woman's University mathematics program. [Internet] [Masters thesis]. Texas Woman's University; 2018. [cited 2019 Jul 18]. Available from: http://hdl.handle.net/11274/10741.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Council of Science Editors:

-5591-465X. Using a statistical model to predict student success in Texas Woman's University mathematics program. [Masters Thesis]. Texas Woman's University; 2018. Available from: http://hdl.handle.net/11274/10741

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete


Colorado State University

9. Chen, Wenxiang. Discovering and harnessing structures in solving application satisfiability instances.

Degree: PhD, Computer Science, 2018, Colorado State University

 Boolean satisfiability (SAT) is the first problem proven to be NP-Complete. It has become a fundamental problem for computational complexity theory, and many real-world problems… (more)

Subjects/Keywords: MAXSAT; SAT; Optimization; Local Search

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Chen, W. (2018). Discovering and harnessing structures in solving application satisfiability instances. (Doctoral Dissertation). Colorado State University. Retrieved from http://hdl.handle.net/10217/189292

Chicago Manual of Style (16th Edition):

Chen, Wenxiang. “Discovering and harnessing structures in solving application satisfiability instances.” 2018. Doctoral Dissertation, Colorado State University. Accessed July 18, 2019. http://hdl.handle.net/10217/189292.

MLA Handbook (7th Edition):

Chen, Wenxiang. “Discovering and harnessing structures in solving application satisfiability instances.” 2018. Web. 18 Jul 2019.

Vancouver:

Chen W. Discovering and harnessing structures in solving application satisfiability instances. [Internet] [Doctoral dissertation]. Colorado State University; 2018. [cited 2019 Jul 18]. Available from: http://hdl.handle.net/10217/189292.

Council of Science Editors:

Chen W. Discovering and harnessing structures in solving application satisfiability instances. [Doctoral Dissertation]. Colorado State University; 2018. Available from: http://hdl.handle.net/10217/189292


University of Toronto

10. Liu, Feiyuan. Indenpendent Transcription of a Functional Lucerne Transient Streak Virus Satellite RNA and its Packaging Requirement(s).

Degree: 2014, University of Toronto

The satellite RNA of Lucerne Transient Streak Virus (LTSV) is a 322-nucleotide, single-stranded circular RNA. To investigate whether interactions between genomic and satellite RNA are… (more)

Subjects/Keywords: functional; packaging; sat RNA; 0720

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Liu, F. (2014). Indenpendent Transcription of a Functional Lucerne Transient Streak Virus Satellite RNA and its Packaging Requirement(s). (Masters Thesis). University of Toronto. Retrieved from http://hdl.handle.net/1807/68863

Chicago Manual of Style (16th Edition):

Liu, Feiyuan. “Indenpendent Transcription of a Functional Lucerne Transient Streak Virus Satellite RNA and its Packaging Requirement(s).” 2014. Masters Thesis, University of Toronto. Accessed July 18, 2019. http://hdl.handle.net/1807/68863.

MLA Handbook (7th Edition):

Liu, Feiyuan. “Indenpendent Transcription of a Functional Lucerne Transient Streak Virus Satellite RNA and its Packaging Requirement(s).” 2014. Web. 18 Jul 2019.

Vancouver:

Liu F. Indenpendent Transcription of a Functional Lucerne Transient Streak Virus Satellite RNA and its Packaging Requirement(s). [Internet] [Masters thesis]. University of Toronto; 2014. [cited 2019 Jul 18]. Available from: http://hdl.handle.net/1807/68863.

Council of Science Editors:

Liu F. Indenpendent Transcription of a Functional Lucerne Transient Streak Virus Satellite RNA and its Packaging Requirement(s). [Masters Thesis]. University of Toronto; 2014. Available from: http://hdl.handle.net/1807/68863


Universidade do Rio Grande do Sul

11. Silveira, Jaime Kirch da. Parallel SAT solvers and their application in automatic parallelization.

Degree: 2014, Universidade do Rio Grande do Sul

Since the slowdown in improvement in the frequency of processors, a new tendency has arisen to allow software to take advantage of faster hardware: parallelization.… (more)

Subjects/Keywords: Microeletrônica; Parallel SAT solver; Processadores; Automatic parallelization; RePaSAT; SAT-PaDdlinG

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Silveira, J. K. d. (2014). Parallel SAT solvers and their application in automatic parallelization. (Thesis). Universidade do Rio Grande do Sul. Retrieved from http://hdl.handle.net/10183/95373

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Silveira, Jaime Kirch da. “Parallel SAT solvers and their application in automatic parallelization.” 2014. Thesis, Universidade do Rio Grande do Sul. Accessed July 18, 2019. http://hdl.handle.net/10183/95373.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Silveira, Jaime Kirch da. “Parallel SAT solvers and their application in automatic parallelization.” 2014. Web. 18 Jul 2019.

Vancouver:

Silveira JKd. Parallel SAT solvers and their application in automatic parallelization. [Internet] [Thesis]. Universidade do Rio Grande do Sul; 2014. [cited 2019 Jul 18]. Available from: http://hdl.handle.net/10183/95373.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Silveira JKd. Parallel SAT solvers and their application in automatic parallelization. [Thesis]. Universidade do Rio Grande do Sul; 2014. Available from: http://hdl.handle.net/10183/95373

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

12. Al-Saedi, Mohammad Saleh Balasim. Extensions of tractable classes for propositional satisfiability : Extensions de classes polynomiales pour le problème de satisfaisabilité.

Degree: Docteur es, Informatique, 2016, Université d'Artois

La représentation des connaissances et les problèmes d’inférence associés restent à l’heure actuelle une problématique riche et centrale en informatique et plus précisément en intelligence… (more)

Subjects/Keywords: Logique propositionnelle; SAT; Classes polynomiales; Propositional logic; SAT; Tractable classes; 006.3

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Al-Saedi, M. S. B. (2016). Extensions of tractable classes for propositional satisfiability : Extensions de classes polynomiales pour le problème de satisfaisabilité. (Doctoral Dissertation). Université d'Artois. Retrieved from http://www.theses.fr/2016ARTO0405

Chicago Manual of Style (16th Edition):

Al-Saedi, Mohammad Saleh Balasim. “Extensions of tractable classes for propositional satisfiability : Extensions de classes polynomiales pour le problème de satisfaisabilité.” 2016. Doctoral Dissertation, Université d'Artois. Accessed July 18, 2019. http://www.theses.fr/2016ARTO0405.

MLA Handbook (7th Edition):

Al-Saedi, Mohammad Saleh Balasim. “Extensions of tractable classes for propositional satisfiability : Extensions de classes polynomiales pour le problème de satisfaisabilité.” 2016. Web. 18 Jul 2019.

Vancouver:

Al-Saedi MSB. Extensions of tractable classes for propositional satisfiability : Extensions de classes polynomiales pour le problème de satisfaisabilité. [Internet] [Doctoral dissertation]. Université d'Artois; 2016. [cited 2019 Jul 18]. Available from: http://www.theses.fr/2016ARTO0405.

Council of Science Editors:

Al-Saedi MSB. Extensions of tractable classes for propositional satisfiability : Extensions de classes polynomiales pour le problème de satisfaisabilité. [Doctoral Dissertation]. Université d'Artois; 2016. Available from: http://www.theses.fr/2016ARTO0405


Rice University

13. Meel, Kuldeep Singh. Constrained Counting and Sampling: Bridging the Gap Between Theory and Practice.

Degree: PhD, Engineering, 2017, Rice University

 Constrained counting and sampling are two fundamental problems in Computer Science with numerous applications, including network reliability, privacy, probabilistic reasoning, and constrained-random verification. In constrained… (more)

Subjects/Keywords: Constrained Counting; Constrained Sampling; SAT; universal hashing; SAT; SMT

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Meel, K. S. (2017). Constrained Counting and Sampling: Bridging the Gap Between Theory and Practice. (Doctoral Dissertation). Rice University. Retrieved from http://hdl.handle.net/1911/105480

Chicago Manual of Style (16th Edition):

Meel, Kuldeep Singh. “Constrained Counting and Sampling: Bridging the Gap Between Theory and Practice.” 2017. Doctoral Dissertation, Rice University. Accessed July 18, 2019. http://hdl.handle.net/1911/105480.

MLA Handbook (7th Edition):

Meel, Kuldeep Singh. “Constrained Counting and Sampling: Bridging the Gap Between Theory and Practice.” 2017. Web. 18 Jul 2019.

Vancouver:

Meel KS. Constrained Counting and Sampling: Bridging the Gap Between Theory and Practice. [Internet] [Doctoral dissertation]. Rice University; 2017. [cited 2019 Jul 18]. Available from: http://hdl.handle.net/1911/105480.

Council of Science Editors:

Meel KS. Constrained Counting and Sampling: Bridging the Gap Between Theory and Practice. [Doctoral Dissertation]. Rice University; 2017. Available from: http://hdl.handle.net/1911/105480


University of Waterloo

14. Salmon, Ricardo. On the relationship between satisfiability and partially observable Markov decision processes.

Degree: 2018, University of Waterloo

 Stochastic satisfiability (SSAT), Quantified Boolean Satisfiability (QBF) and decision-theoretic planning in finite horizon partially observable Markov decision processes (POMDPs) are all PSPACE-Complete problems. Since they… (more)

Subjects/Keywords: POMDP; Stochastic SAT; Satisfiability; Planning; Probabilistic Inference; SAT; QBF

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Salmon, R. (2018). On the relationship between satisfiability and partially observable Markov decision processes. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/13951

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Salmon, Ricardo. “On the relationship between satisfiability and partially observable Markov decision processes.” 2018. Thesis, University of Waterloo. Accessed July 18, 2019. http://hdl.handle.net/10012/13951.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Salmon, Ricardo. “On the relationship between satisfiability and partially observable Markov decision processes.” 2018. Web. 18 Jul 2019.

Vancouver:

Salmon R. On the relationship between satisfiability and partially observable Markov decision processes. [Internet] [Thesis]. University of Waterloo; 2018. [cited 2019 Jul 18]. Available from: http://hdl.handle.net/10012/13951.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Salmon R. On the relationship between satisfiability and partially observable Markov decision processes. [Thesis]. University of Waterloo; 2018. Available from: http://hdl.handle.net/10012/13951

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Brno University of Technology

15. Izrael, Petr. SAT Solver akcelerovaný pomocí GPU .

Degree: 2013, Brno University of Technology

 Práce se zabývá návrhem a implementací kompletního SAT solveru akcelerovaného na GPU. V první části práce je popsána architektura grafických karet a možnosti platformy CUDA.… (more)

Subjects/Keywords: SAT; DPLL; CUDA; GPU; GPGPU; SAT; DPLL; CUDA; GPU; GPGPU

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Izrael, P. (2013). SAT Solver akcelerovaný pomocí GPU . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/53479

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Izrael, Petr. “SAT Solver akcelerovaný pomocí GPU .” 2013. Thesis, Brno University of Technology. Accessed July 18, 2019. http://hdl.handle.net/11012/53479.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Izrael, Petr. “SAT Solver akcelerovaný pomocí GPU .” 2013. Web. 18 Jul 2019.

Vancouver:

Izrael P. SAT Solver akcelerovaný pomocí GPU . [Internet] [Thesis]. Brno University of Technology; 2013. [cited 2019 Jul 18]. Available from: http://hdl.handle.net/11012/53479.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Izrael P. SAT Solver akcelerovaný pomocí GPU . [Thesis]. Brno University of Technology; 2013. Available from: http://hdl.handle.net/11012/53479

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Alberta

16. Chowdhury, Md Solimul. SAT with Global Constraints.

Degree: MS, Department of Computing Science, 2011, University of Alberta

 Propositional satisability (SAT) has been a dominant tool in solving some practical NP-complete problems. However, SAT also has a number of weaknesses, including its inability… (more)

Subjects/Keywords: Constraint Programming; Global Constraints; Integration; SAT

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Chowdhury, M. S. (2011). SAT with Global Constraints. (Masters Thesis). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/ws859f77v

Chicago Manual of Style (16th Edition):

Chowdhury, Md Solimul. “SAT with Global Constraints.” 2011. Masters Thesis, University of Alberta. Accessed July 18, 2019. https://era.library.ualberta.ca/files/ws859f77v.

MLA Handbook (7th Edition):

Chowdhury, Md Solimul. “SAT with Global Constraints.” 2011. Web. 18 Jul 2019.

Vancouver:

Chowdhury MS. SAT with Global Constraints. [Internet] [Masters thesis]. University of Alberta; 2011. [cited 2019 Jul 18]. Available from: https://era.library.ualberta.ca/files/ws859f77v.

Council of Science Editors:

Chowdhury MS. SAT with Global Constraints. [Masters Thesis]. University of Alberta; 2011. Available from: https://era.library.ualberta.ca/files/ws859f77v


Texas A&M University

17. Deng, Yue. SAT-based Verification for Analog and Mixed-signal Circuits.

Degree: 2012, Texas A&M University

 The wide application of analog and mixed-signal (AMS) designs makes the verification of AMS circuits an important task. However, verification of AMS circuits remains as… (more)

Subjects/Keywords: Analog; verification; simulation; SAT; modeling; reachability anlysis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Deng, Y. (2012). SAT-based Verification for Analog and Mixed-signal Circuits. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2012-05-11221

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Deng, Yue. “SAT-based Verification for Analog and Mixed-signal Circuits.” 2012. Thesis, Texas A&M University. Accessed July 18, 2019. http://hdl.handle.net/1969.1/ETD-TAMU-2012-05-11221.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Deng, Yue. “SAT-based Verification for Analog and Mixed-signal Circuits.” 2012. Web. 18 Jul 2019.

Vancouver:

Deng Y. SAT-based Verification for Analog and Mixed-signal Circuits. [Internet] [Thesis]. Texas A&M University; 2012. [cited 2019 Jul 18]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2012-05-11221.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Deng Y. SAT-based Verification for Analog and Mixed-signal Circuits. [Thesis]. Texas A&M University; 2012. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2012-05-11221

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Debrecen

18. Czuczor, Gergő. A SAT probléma .

Degree: DE – Informatikai Kar, University of Debrecen

A dolgozat a SAT problémát mutatja be, annak történeti hátterét, illetve az azt megoldó algoritmusokat és a probléma kapcsolatát az egyenletrendszerekkel. Advisors/Committee Members: Várterész, Magda (advisor).

Subjects/Keywords: sat; bonyolultság; egyenletrendszerek

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Czuczor, G. (n.d.). A SAT probléma . (Thesis). University of Debrecen. Retrieved from http://hdl.handle.net/2437/238631

Note: this citation may be lacking information needed for this citation format:
No year of publication.
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Czuczor, Gergő. “A SAT probléma .” Thesis, University of Debrecen. Accessed July 18, 2019. http://hdl.handle.net/2437/238631.

Note: this citation may be lacking information needed for this citation format:
No year of publication.
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Czuczor, Gergő. “A SAT probléma .” Web. 18 Jul 2019.

Note: this citation may be lacking information needed for this citation format:
No year of publication.

Vancouver:

Czuczor G. A SAT probléma . [Internet] [Thesis]. University of Debrecen; [cited 2019 Jul 18]. Available from: http://hdl.handle.net/2437/238631.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
No year of publication.

Council of Science Editors:

Czuczor G. A SAT probléma . [Thesis]. University of Debrecen; Available from: http://hdl.handle.net/2437/238631

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
No year of publication.

19. Szczepanski, Nicolas. SAT en Parallèle : Parallel SAT solving.

Degree: Docteur es, Informatique, 2017, Université d'Artois

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… (more)

Subjects/Keywords: SAT; Colonies d'abeilles; Solveurs SAT; Parallèle; Calcul distribué; Modèles de programmation hybride; SAT; SAT solvers; Parallel; Distributed computing; Hybrid programming models; 006.3

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Szczepanski, N. (2017). SAT en Parallèle : Parallel SAT solving. (Doctoral Dissertation). Université d'Artois. Retrieved from http://www.theses.fr/2017ARTO0403

Chicago Manual of Style (16th Edition):

Szczepanski, Nicolas. “SAT en Parallèle : Parallel SAT solving.” 2017. Doctoral Dissertation, Université d'Artois. Accessed July 18, 2019. http://www.theses.fr/2017ARTO0403.

MLA Handbook (7th Edition):

Szczepanski, Nicolas. “SAT en Parallèle : Parallel SAT solving.” 2017. Web. 18 Jul 2019.

Vancouver:

Szczepanski N. SAT en Parallèle : Parallel SAT solving. [Internet] [Doctoral dissertation]. Université d'Artois; 2017. [cited 2019 Jul 18]. Available from: http://www.theses.fr/2017ARTO0403.

Council of Science Editors:

Szczepanski N. SAT en Parallèle : Parallel SAT solving. [Doctoral Dissertation]. Université d'Artois; 2017. Available from: http://www.theses.fr/2017ARTO0403


University of Houston

20. -0075-9784. ADMINISTRATIVE LEADERSHIP EFFECT ON COLLEGE ENTRANCE EXAMINATION PARTICIPATION AND PERFORMANCE.

Degree: Educational Leadership and Cultural Studies, Department of, 2015, University of Houston

 College entrance exam scores, namely the SAT and ACT, are an important criteria for students applying for admission to their college of choice. Clinedinst, Hurley,… (more)

Subjects/Keywords: Leadership; SAT; ACT; Participation; Performance; Achievement; Gap

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

-0075-9784. (2015). ADMINISTRATIVE LEADERSHIP EFFECT ON COLLEGE ENTRANCE EXAMINATION PARTICIPATION AND PERFORMANCE. (Thesis). University of Houston. Retrieved from http://hdl.handle.net/10657/1777

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

-0075-9784. “ADMINISTRATIVE LEADERSHIP EFFECT ON COLLEGE ENTRANCE EXAMINATION PARTICIPATION AND PERFORMANCE.” 2015. Thesis, University of Houston. Accessed July 18, 2019. http://hdl.handle.net/10657/1777.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

-0075-9784. “ADMINISTRATIVE LEADERSHIP EFFECT ON COLLEGE ENTRANCE EXAMINATION PARTICIPATION AND PERFORMANCE.” 2015. Web. 18 Jul 2019.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Vancouver:

-0075-9784. ADMINISTRATIVE LEADERSHIP EFFECT ON COLLEGE ENTRANCE EXAMINATION PARTICIPATION AND PERFORMANCE. [Internet] [Thesis]. University of Houston; 2015. [cited 2019 Jul 18]. Available from: http://hdl.handle.net/10657/1777.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

-0075-9784. ADMINISTRATIVE LEADERSHIP EFFECT ON COLLEGE ENTRANCE EXAMINATION PARTICIPATION AND PERFORMANCE. [Thesis]. University of Houston; 2015. Available from: http://hdl.handle.net/10657/1777

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Not specified: Masters Thesis or Doctoral Dissertation


University of Waterloo

21. Zulkoski, Edward. Understanding and Enhancing CDCL-based SAT Solvers.

Degree: 2018, University of Waterloo

 Modern conflict-driven clause-learning (CDCL) Boolean satisfiability (SAT) solvers routinely solve formulas from industrial domains with millions of variables and clauses, despite the Boolean satisfiability problem… (more)

Subjects/Keywords: SAT Solvers; Backdoors; Computer Algebra Systems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Zulkoski, E. (2018). Understanding and Enhancing CDCL-based SAT Solvers. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/13525

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Zulkoski, Edward. “Understanding and Enhancing CDCL-based SAT Solvers.” 2018. Thesis, University of Waterloo. Accessed July 18, 2019. http://hdl.handle.net/10012/13525.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Zulkoski, Edward. “Understanding and Enhancing CDCL-based SAT Solvers.” 2018. Web. 18 Jul 2019.

Vancouver:

Zulkoski E. Understanding and Enhancing CDCL-based SAT Solvers. [Internet] [Thesis]. University of Waterloo; 2018. [cited 2019 Jul 18]. Available from: http://hdl.handle.net/10012/13525.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Zulkoski E. Understanding and Enhancing CDCL-based SAT Solvers. [Thesis]. University of Waterloo; 2018. Available from: http://hdl.handle.net/10012/13525

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Waterloo

22. Pisanov, Vladimir. Novel Value Ordering Heuristics Using Non-Linear Optimization In Boolean Satisfiability.

Degree: 2012, University of Waterloo

 Boolean Satisfiability (SAT) is a fundamental NP-complete problem of determining whether there exists an assignment of variables which makes a Boolean formula evaluate to True.… (more)

Subjects/Keywords: Boolean satisfiability; SAT; Backtracking search; Value ordering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Pisanov, V. (2012). Novel Value Ordering Heuristics Using Non-Linear Optimization In Boolean Satisfiability. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/6941

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Pisanov, Vladimir. “Novel Value Ordering Heuristics Using Non-Linear Optimization In Boolean Satisfiability.” 2012. Thesis, University of Waterloo. Accessed July 18, 2019. http://hdl.handle.net/10012/6941.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Pisanov, Vladimir. “Novel Value Ordering Heuristics Using Non-Linear Optimization In Boolean Satisfiability.” 2012. Web. 18 Jul 2019.

Vancouver:

Pisanov V. Novel Value Ordering Heuristics Using Non-Linear Optimization In Boolean Satisfiability. [Internet] [Thesis]. University of Waterloo; 2012. [cited 2019 Jul 18]. Available from: http://hdl.handle.net/10012/6941.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Pisanov V. Novel Value Ordering Heuristics Using Non-Linear Optimization In Boolean Satisfiability. [Thesis]. University of Waterloo; 2012. Available from: http://hdl.handle.net/10012/6941

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Waterloo

23. Li, Zijie. Backdoors in Satisfiability Problems.

Degree: 2009, University of Waterloo

 Although satisfiability problems (SAT) are NP-complete, state-of-the-art SAT solvers are able to solve large practical instances. The notion of backdoors has been introduced to capture… (more)

Subjects/Keywords: CSP; SAT; Backdoors

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Li, Z. (2009). Backdoors in Satisfiability Problems. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/4810

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Li, Zijie. “Backdoors in Satisfiability Problems.” 2009. Thesis, University of Waterloo. Accessed July 18, 2019. http://hdl.handle.net/10012/4810.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Li, Zijie. “Backdoors in Satisfiability Problems.” 2009. Web. 18 Jul 2019.

Vancouver:

Li Z. Backdoors in Satisfiability Problems. [Internet] [Thesis]. University of Waterloo; 2009. [cited 2019 Jul 18]. Available from: http://hdl.handle.net/10012/4810.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Li Z. Backdoors in Satisfiability Problems. [Thesis]. University of Waterloo; 2009. Available from: http://hdl.handle.net/10012/4810

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Brno University of Technology

24. Serédi, Silvester. Evoluční algoritmy v úloze booleovské splnitelnosti .

Degree: 2013, Brno University of Technology

 Cílem této diplomové práce je najít heuristiku řešící SAT problém pomocí evolučního algoritmu. Jsou zde uvedeny přístupy k řešení SAT problému a různé varianty k… (more)

Subjects/Keywords: Genetické programovanie; evolučné algoritmy; zložitosť; SAT problém; NP-úplný problém; SAT solver.; Genetic programming; evolutionary algorithms; complexity; SAT problem; NP-complete problem; SAT solver.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Serédi, S. (2013). Evoluční algoritmy v úloze booleovské splnitelnosti . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/53467

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Serédi, Silvester. “Evoluční algoritmy v úloze booleovské splnitelnosti .” 2013. Thesis, Brno University of Technology. Accessed July 18, 2019. http://hdl.handle.net/11012/53467.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Serédi, Silvester. “Evoluční algoritmy v úloze booleovské splnitelnosti .” 2013. Web. 18 Jul 2019.

Vancouver:

Serédi S. Evoluční algoritmy v úloze booleovské splnitelnosti . [Internet] [Thesis]. Brno University of Technology; 2013. [cited 2019 Jul 18]. Available from: http://hdl.handle.net/11012/53467.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Serédi S. Evoluční algoritmy v úloze booleovské splnitelnosti . [Thesis]. Brno University of Technology; 2013. Available from: http://hdl.handle.net/11012/53467

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Universidad de Chile

25. Carmi Jara, Víctor Andrés. Consultas eficientes sobre bases de datos de grafo incompletas .

Degree: 2013, Universidad de Chile

 El principal objetivo de esta tesis es encontrar casos tratables y buenas técnicas para computar Certain Answers sobre bases de datos de grafos incompletas, en… (more)

Subjects/Keywords: Bases de datos; Certain Answers; 3-SAT

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Carmi Jara, V. A. (2013). Consultas eficientes sobre bases de datos de grafo incompletas . (Thesis). Universidad de Chile. Retrieved from http://www.repositorio.uchile.cl/handle/2250/115697

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Carmi Jara, Víctor Andrés. “Consultas eficientes sobre bases de datos de grafo incompletas .” 2013. Thesis, Universidad de Chile. Accessed July 18, 2019. http://www.repositorio.uchile.cl/handle/2250/115697.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Carmi Jara, Víctor Andrés. “Consultas eficientes sobre bases de datos de grafo incompletas .” 2013. Web. 18 Jul 2019.

Vancouver:

Carmi Jara VA. Consultas eficientes sobre bases de datos de grafo incompletas . [Internet] [Thesis]. Universidad de Chile; 2013. [cited 2019 Jul 18]. Available from: http://www.repositorio.uchile.cl/handle/2250/115697.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Carmi Jara VA. Consultas eficientes sobre bases de datos de grafo incompletas . [Thesis]. Universidad de Chile; 2013. Available from: http://www.repositorio.uchile.cl/handle/2250/115697

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Université de Montréal

26. Ivan, Teodor. Parallelization of SAT on Reconfigurable Hardware .

Degree: 2013, Université de Montréal

 Quoique très difficile à résoudre, le problème de satisfiabilité Booléenne (SAT) est fréquemment utilisé lors de la modélisation d’applications industrielles. À cet effet, les deux… (more)

Subjects/Keywords: SAT; Solveur matériel; Solveur matériel parallèle sur FPGA; Hardware Solver; FPGA parallel SAT solver

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Ivan, T. (2013). Parallelization of SAT on Reconfigurable Hardware . (Thesis). Université de Montréal. Retrieved from http://hdl.handle.net/1866/9991

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Ivan, Teodor. “Parallelization of SAT on Reconfigurable Hardware .” 2013. Thesis, Université de Montréal. Accessed July 18, 2019. http://hdl.handle.net/1866/9991.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Ivan, Teodor. “Parallelization of SAT on Reconfigurable Hardware .” 2013. Web. 18 Jul 2019.

Vancouver:

Ivan T. Parallelization of SAT on Reconfigurable Hardware . [Internet] [Thesis]. Université de Montréal; 2013. [cited 2019 Jul 18]. Available from: http://hdl.handle.net/1866/9991.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ivan T. Parallelization of SAT on Reconfigurable Hardware . [Thesis]. Université de Montréal; 2013. Available from: http://hdl.handle.net/1866/9991

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

27. Appelrouth, Jed. Predicting Success In Preparing For High-Stakes Admissions Tests: A Moderated Mediation Analysis.

Degree: PhD, Educational Psychology and Special Education, 2015, Georgia State University

  Research on preparing for standardized college admissions tests such as the SAT has largely been limited to studies exploring the relative effect size of… (more)

Subjects/Keywords: College Admissions; SAT; SAT Coaching; High-Stakes Tests; College Entrance Examinations; Test Preparation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Appelrouth, J. (2015). Predicting Success In Preparing For High-Stakes Admissions Tests: A Moderated Mediation Analysis. (Doctoral Dissertation). Georgia State University. Retrieved from https://scholarworks.gsu.edu/epse_diss/102

Chicago Manual of Style (16th Edition):

Appelrouth, Jed. “Predicting Success In Preparing For High-Stakes Admissions Tests: A Moderated Mediation Analysis.” 2015. Doctoral Dissertation, Georgia State University. Accessed July 18, 2019. https://scholarworks.gsu.edu/epse_diss/102.

MLA Handbook (7th Edition):

Appelrouth, Jed. “Predicting Success In Preparing For High-Stakes Admissions Tests: A Moderated Mediation Analysis.” 2015. Web. 18 Jul 2019.

Vancouver:

Appelrouth J. Predicting Success In Preparing For High-Stakes Admissions Tests: A Moderated Mediation Analysis. [Internet] [Doctoral dissertation]. Georgia State University; 2015. [cited 2019 Jul 18]. Available from: https://scholarworks.gsu.edu/epse_diss/102.

Council of Science Editors:

Appelrouth J. Predicting Success In Preparing For High-Stakes Admissions Tests: A Moderated Mediation Analysis. [Doctoral Dissertation]. Georgia State University; 2015. Available from: https://scholarworks.gsu.edu/epse_diss/102

28. Lonca, Emmanuel. Optimisation booléenne multiobjectif : complexité sous contraintes compilées et résolution via SAT : Multiobjective boolean optimization.

Degree: Docteur es, Informatique, 2015, Université d'Artois

L’aide à la décision a pour but d’assister un opérateur humain dans ses choix. La nécessité d’employer de telles techniques s’est imposée avec la volonté… (more)

Subjects/Keywords: Aide à la décision; Optimisation multicritère; SAT; Decision aid; MCDA; SAT; 006.3

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Lonca, E. (2015). Optimisation booléenne multiobjectif : complexité sous contraintes compilées et résolution via SAT : Multiobjective boolean optimization. (Doctoral Dissertation). Université d'Artois. Retrieved from http://www.theses.fr/2015ARTO0405

Chicago Manual of Style (16th Edition):

Lonca, Emmanuel. “Optimisation booléenne multiobjectif : complexité sous contraintes compilées et résolution via SAT : Multiobjective boolean optimization.” 2015. Doctoral Dissertation, Université d'Artois. Accessed July 18, 2019. http://www.theses.fr/2015ARTO0405.

MLA Handbook (7th Edition):

Lonca, Emmanuel. “Optimisation booléenne multiobjectif : complexité sous contraintes compilées et résolution via SAT : Multiobjective boolean optimization.” 2015. Web. 18 Jul 2019.

Vancouver:

Lonca E. Optimisation booléenne multiobjectif : complexité sous contraintes compilées et résolution via SAT : Multiobjective boolean optimization. [Internet] [Doctoral dissertation]. Université d'Artois; 2015. [cited 2019 Jul 18]. Available from: http://www.theses.fr/2015ARTO0405.

Council of Science Editors:

Lonca E. Optimisation booléenne multiobjectif : complexité sous contraintes compilées et résolution via SAT : Multiobjective boolean optimization. [Doctoral Dissertation]. Université d'Artois; 2015. Available from: http://www.theses.fr/2015ARTO0405


University of Texas – Austin

29. Lierler, Yuliya. SAT-based answer set programming.

Degree: Computer Sciences, 2010, University of Texas – Austin

 Answer set programming (ASP) is a declarative programming paradigm oriented towards difficult combinatorial search problems. Syntactically, ASP programs look like Prolog programs, but solutions are… (more)

Subjects/Keywords: Answer set programming; Logic programming; Propositional satisfiability; Answer set solvers; SAT; SAT solvers; Smodels; Cmodels

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Lierler, Y. (2010). SAT-based answer set programming. (Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/ETD-UT-2010-05-888

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Lierler, Yuliya. “SAT-based answer set programming.” 2010. Thesis, University of Texas – Austin. Accessed July 18, 2019. http://hdl.handle.net/2152/ETD-UT-2010-05-888.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Lierler, Yuliya. “SAT-based answer set programming.” 2010. Web. 18 Jul 2019.

Vancouver:

Lierler Y. SAT-based answer set programming. [Internet] [Thesis]. University of Texas – Austin; 2010. [cited 2019 Jul 18]. Available from: http://hdl.handle.net/2152/ETD-UT-2010-05-888.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lierler Y. SAT-based answer set programming. [Thesis]. University of Texas – Austin; 2010. Available from: http://hdl.handle.net/2152/ETD-UT-2010-05-888

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Brno University of Technology

30. Lžičař, David. Posouzení ekonomiky konvenčního svařování MAG a technologie ESAB-SAT .

Degree: 2012, Brno University of Technology

 Projekt vypracovaný v rámci inženýrského studia oboru 2303T005 předkládá analýzu porovnání metody konvenčního svařování MAG a technologie svařování ESAB SAT^TM. ESAB SAT^TM je nová inovovaná… (more)

Subjects/Keywords: Svařování; MAG; ESAB SAT^TM; produktivita; Welding; MAG; ESAB SAT^TM; productivity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Lžičař, D. (2012). Posouzení ekonomiky konvenčního svařování MAG a technologie ESAB-SAT . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/5015

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Lžičař, David. “Posouzení ekonomiky konvenčního svařování MAG a technologie ESAB-SAT .” 2012. Thesis, Brno University of Technology. Accessed July 18, 2019. http://hdl.handle.net/11012/5015.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Lžičař, David. “Posouzení ekonomiky konvenčního svařování MAG a technologie ESAB-SAT .” 2012. Web. 18 Jul 2019.

Vancouver:

Lžičař D. Posouzení ekonomiky konvenčního svařování MAG a technologie ESAB-SAT . [Internet] [Thesis]. Brno University of Technology; 2012. [cited 2019 Jul 18]. Available from: http://hdl.handle.net/11012/5015.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lžičař D. Posouzení ekonomiky konvenčního svařování MAG a technologie ESAB-SAT . [Thesis]. Brno University of Technology; 2012. Available from: http://hdl.handle.net/11012/5015

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

[1] [2] [3] [4] [5] [6] [7] [8]

.