Advanced search options
You searched for subject:(SAT)
.
Showing records 1 – 30 of
299 total matches.
◁ [1] [2] [3] [4] [5] [6] [7] [8] [9] [10] ▶
Search Limiters
Dates
Universities
Department
Degrees
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 / 奈良先端科学技術大学院大学
URL: http://hdl.handle.net/10061/4298
Subjects/Keywords: SAT
Record Details
Similar Records
❌
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 March 07, 2021. 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. 07 Mar 2021.
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 2021 Mar 07]. 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.
Wesleyan University
2. Chavez, Olivia. Diversity, Inequality and Predictive Power: Why Do Colleges Go SAT Optional?.
Degree: Psychology, 2016, Wesleyan University
URL: https://wesscholar.wesleyan.edu/etd_mas_theses/126
Subjects/Keywords: Diversity; College; SAT; SAT Optional; Test Optional
Record Details
Similar Records
❌
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 March 07, 2021. 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. 07 Mar 2021.
Vancouver:
Chavez O. Diversity, Inequality and Predictive Power: Why Do Colleges Go SAT Optional?. [Internet] [Masters thesis]. Wesleyan University; 2016. [cited 2021 Mar 07]. 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
3. 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
URL: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-21012013-220441/
;
Subjects/Keywords: Chaff; Chaff; NP-complete; NP-completo; P=NP; P=NP; SAT; SAT; SAT Solvers; SAT Solvers; zChaff.; zChaff.
Record Details
Similar Records
❌
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 March 07, 2021. 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. 07 Mar 2021.
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 2021 Mar 07]. 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/ ;
Université du Québec à Montréal
4. 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
URL: http://archipel.uqam.ca/5863/1/D2535.pdf
Subjects/Keywords: Algorithme CDCL; Problème SAT
Record Details
Similar Records
❌
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 March 07, 2021. 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. 07 Mar 2021.
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 2021 Mar 07]. 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
Texas A&M University
5. Bian, Kun. Efficient Path Delay Test Generation with Boolean Satisfiability.
Degree: PhD, Computer Engineering, 2013, Texas A&M University
URL: http://hdl.handle.net/1969.1/151900
Subjects/Keywords: Delay Test; ATPG; SAT
Record Details
Similar Records
❌
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. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/151900
Chicago Manual of Style (16th Edition):
Bian, Kun. “Efficient Path Delay Test Generation with Boolean Satisfiability.” 2013. Doctoral Dissertation, Texas A&M University. Accessed March 07, 2021. http://hdl.handle.net/1969.1/151900.
MLA Handbook (7th Edition):
Bian, Kun. “Efficient Path Delay Test Generation with Boolean Satisfiability.” 2013. Web. 07 Mar 2021.
Vancouver:
Bian K. Efficient Path Delay Test Generation with Boolean Satisfiability. [Internet] [Doctoral dissertation]. Texas A&M University; 2013. [cited 2021 Mar 07]. Available from: http://hdl.handle.net/1969.1/151900.
Council of Science Editors:
Bian K. Efficient Path Delay Test Generation with Boolean Satisfiability. [Doctoral Dissertation]. Texas A&M University; 2013. Available from: http://hdl.handle.net/1969.1/151900
University of Waterloo
6. Nejati, Saeed. CDCL(Crypto) and Machine Learning based SAT Solvers for Cryptanalysis.
Degree: 2020, University of Waterloo
URL: http://hdl.handle.net/10012/15868
Subjects/Keywords: SAT Solvers; Cryptography; machine learning
Record Details
Similar Records
❌
APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager
APA (6th Edition):
Nejati, S. (2020). CDCL(Crypto) and Machine Learning based SAT Solvers for Cryptanalysis. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/15868
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):
Nejati, Saeed. “CDCL(Crypto) and Machine Learning based SAT Solvers for Cryptanalysis.” 2020. Thesis, University of Waterloo. Accessed March 07, 2021. http://hdl.handle.net/10012/15868.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Nejati, Saeed. “CDCL(Crypto) and Machine Learning based SAT Solvers for Cryptanalysis.” 2020. Web. 07 Mar 2021.
Vancouver:
Nejati S. CDCL(Crypto) and Machine Learning based SAT Solvers for Cryptanalysis. [Internet] [Thesis]. University of Waterloo; 2020. [cited 2021 Mar 07]. Available from: http://hdl.handle.net/10012/15868.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Nejati S. CDCL(Crypto) and Machine Learning based SAT Solvers for Cryptanalysis. [Thesis]. University of Waterloo; 2020. Available from: http://hdl.handle.net/10012/15868
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
University of Toronto
7. Liu, Feiyuan. Indenpendent Transcription of a Functional Lucerne Transient Streak Virus Satellite RNA and its Packaging Requirement(s).
Degree: 2014, University of Toronto
URL: http://hdl.handle.net/1807/68863
Subjects/Keywords: functional; packaging; sat RNA; 0720
Record Details
Similar Records
❌
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 March 07, 2021. 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. 07 Mar 2021.
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 2021 Mar 07]. 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
Colorado State University
8. Chen, Wenxiang. Discovering and harnessing structures in solving application satisfiability instances.
Degree: PhD, Computer Science, 2018, Colorado State University
URL: http://hdl.handle.net/10217/189292
Subjects/Keywords: MAXSAT; SAT; optimization; local search
Record Details
Similar Records
❌
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 March 07, 2021. http://hdl.handle.net/10217/189292.
MLA Handbook (7th Edition):
Chen, Wenxiang. “Discovering and harnessing structures in solving application satisfiability instances.” 2018. Web. 07 Mar 2021.
Vancouver:
Chen W. Discovering and harnessing structures in solving application satisfiability instances. [Internet] [Doctoral dissertation]. Colorado State University; 2018. [cited 2021 Mar 07]. 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 Debrecen
9. Bécsi, Zoltán József. Intervallumokon végzett számítások .
Degree: DE – TEK – Informatikai Kar, 2009, University of Debrecen
URL: http://hdl.handle.net/2437/86287
Subjects/Keywords: Intervallum; SAT
Record Details
Similar Records
❌
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 March 07, 2021. 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. 07 Mar 2021.
Vancouver:
Bécsi ZJ. Intervallumokon végzett számítások . [Internet] [Thesis]. University of Debrecen; 2009. [cited 2021 Mar 07]. 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
University of Florida
10. Hasbini, Leena. The Impact of Standardized Testing on High-Achieving Students Postsecondary Acceptance Outcomes.
Degree: EdD, Educational Leadership - Human Development and Organizational Studies in Education, 2018, University of Florida
URL: https://ufdc.ufl.edu/UFE0052157
Subjects/Keywords: act – admissions – college – sat – testing
Record Details
Similar Records
❌
APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager
APA (6th Edition):
Hasbini, L. (2018). The Impact of Standardized Testing on High-Achieving Students Postsecondary Acceptance Outcomes. (Doctoral Dissertation). University of Florida. Retrieved from https://ufdc.ufl.edu/UFE0052157
Chicago Manual of Style (16th Edition):
Hasbini, Leena. “The Impact of Standardized Testing on High-Achieving Students Postsecondary Acceptance Outcomes.” 2018. Doctoral Dissertation, University of Florida. Accessed March 07, 2021. https://ufdc.ufl.edu/UFE0052157.
MLA Handbook (7th Edition):
Hasbini, Leena. “The Impact of Standardized Testing on High-Achieving Students Postsecondary Acceptance Outcomes.” 2018. Web. 07 Mar 2021.
Vancouver:
Hasbini L. The Impact of Standardized Testing on High-Achieving Students Postsecondary Acceptance Outcomes. [Internet] [Doctoral dissertation]. University of Florida; 2018. [cited 2021 Mar 07]. Available from: https://ufdc.ufl.edu/UFE0052157.
Council of Science Editors:
Hasbini L. The Impact of Standardized Testing on High-Achieving Students Postsecondary Acceptance Outcomes. [Doctoral Dissertation]. University of Florida; 2018. Available from: https://ufdc.ufl.edu/UFE0052157
11. -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
URL: http://hdl.handle.net/11274/10741
Subjects/Keywords: Predict; Mathematics; Graduation; SAT mathematics
Record Details
Similar Records
❌
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 March 07, 2021. 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. 07 Mar 2021.
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 2021 Mar 07]. 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
Universidade do Rio Grande do Sul
12. Silveira, Jaime Kirch da. Parallel SAT solvers and their application in automatic parallelization.
Degree: 2014, Universidade do Rio Grande do Sul
URL: http://hdl.handle.net/10183/95373
Subjects/Keywords: Microeletrônica; Parallel SAT solver; Processadores; Automatic parallelization; RePaSAT; SAT-PaDdlinG
Record Details
Similar Records
❌
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 March 07, 2021. 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. 07 Mar 2021.
Vancouver:
Silveira JKd. Parallel SAT solvers and their application in automatic parallelization. [Internet] [Thesis]. Universidade do Rio Grande do Sul; 2014. [cited 2021 Mar 07]. 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
13. 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
URL: http://www.theses.fr/2016ARTO0405
Subjects/Keywords: Logique propositionnelle; SAT; Classes polynomiales; Propositional logic; SAT; Tractable classes; 006.3
Record Details
Similar Records
❌
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 March 07, 2021. 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. 07 Mar 2021.
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 2021 Mar 07]. 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
Brno University of Technology
14. Izrael, Petr. SAT Solver akcelerovaný pomocí GPU: GPU Accelerated SAT Solver.
Degree: 2019, Brno University of Technology
URL: http://hdl.handle.net/11012/53479
Subjects/Keywords: SAT; DPLL; CUDA; GPU; GPGPU; SAT; DPLL; CUDA; GPU; GPGPU
Record Details
Similar Records
❌
APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager
APA (6th Edition):
Izrael, P. (2019). SAT Solver akcelerovaný pomocí GPU: GPU Accelerated SAT Solver. (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: GPU Accelerated SAT Solver.” 2019. Thesis, Brno University of Technology. Accessed March 07, 2021. 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: GPU Accelerated SAT Solver.” 2019. Web. 07 Mar 2021.
Vancouver:
Izrael P. SAT Solver akcelerovaný pomocí GPU: GPU Accelerated SAT Solver. [Internet] [Thesis]. Brno University of Technology; 2019. [cited 2021 Mar 07]. 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: GPU Accelerated SAT Solver. [Thesis]. Brno University of Technology; 2019. 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
Rice University
15. Meel, Kuldeep Singh. Constrained Counting and Sampling: Bridging the Gap Between Theory and Practice.
Degree: PhD, Engineering, 2017, Rice University
URL: http://hdl.handle.net/1911/105480
Subjects/Keywords: Constrained Counting; Constrained Sampling; SAT; universal hashing; SAT; SMT
Record Details
Similar Records
❌
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 March 07, 2021. 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. 07 Mar 2021.
Vancouver:
Meel KS. Constrained Counting and Sampling: Bridging the Gap Between Theory and Practice. [Internet] [Doctoral dissertation]. Rice University; 2017. [cited 2021 Mar 07]. 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
16. Salmon, Ricardo. On the relationship between satisfiability and partially observable Markov decision processes.
Degree: 2018, University of Waterloo
URL: http://hdl.handle.net/10012/13951
Subjects/Keywords: POMDP; Stochastic SAT; Satisfiability; Planning; Probabilistic Inference; SAT; QBF
Record Details
Similar Records
❌
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 March 07, 2021. 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. 07 Mar 2021.
Vancouver:
Salmon R. On the relationship between satisfiability and partially observable Markov decision processes. [Internet] [Thesis]. University of Waterloo; 2018. [cited 2021 Mar 07]. 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
University of Alberta
17. Chowdhury, Md Solimul. SAT with Global Constraints.
Degree: MS, Department of Computing Science, 2011, University of Alberta
URL: https://era.library.ualberta.ca/files/ws859f77v
Subjects/Keywords: Constraint Programming; Global Constraints; Integration; SAT
Record Details
Similar Records
❌
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 March 07, 2021. https://era.library.ualberta.ca/files/ws859f77v.
MLA Handbook (7th Edition):
Chowdhury, Md Solimul. “SAT with Global Constraints.” 2011. Web. 07 Mar 2021.
Vancouver:
Chowdhury MS. SAT with Global Constraints. [Internet] [Masters thesis]. University of Alberta; 2011. [cited 2021 Mar 07]. 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
18. Deng, Yue. SAT-based Verification for Analog and Mixed-signal Circuits.
Degree: MS, Computer Engineering, 2012, Texas A&M University
URL: http://hdl.handle.net/1969.1/ETD-TAMU-2012-05-11221
Subjects/Keywords: Analog; verification; simulation; SAT; modeling; reachability anlysis
Record Details
Similar Records
❌
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. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2012-05-11221
Chicago Manual of Style (16th Edition):
Deng, Yue. “SAT-based Verification for Analog and Mixed-signal Circuits.” 2012. Masters Thesis, Texas A&M University. Accessed March 07, 2021. http://hdl.handle.net/1969.1/ETD-TAMU-2012-05-11221.
MLA Handbook (7th Edition):
Deng, Yue. “SAT-based Verification for Analog and Mixed-signal Circuits.” 2012. Web. 07 Mar 2021.
Vancouver:
Deng Y. SAT-based Verification for Analog and Mixed-signal Circuits. [Internet] [Masters thesis]. Texas A&M University; 2012. [cited 2021 Mar 07]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2012-05-11221.
Council of Science Editors:
Deng Y. SAT-based Verification for Analog and Mixed-signal Circuits. [Masters Thesis]. Texas A&M University; 2012. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2012-05-11221
Universidad de Chile
19. Carmi Jara, Víctor Andrés. Consultas eficientes sobre bases de datos de grafo incompletas.
Degree: 2013, Universidad de Chile
URL: http://repositorio.uchile.cl/handle/2250/115697
Subjects/Keywords: Bases de datos; Certain Answers; 3-SAT
Record Details
Similar Records
❌
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://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 March 07, 2021. http://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. 07 Mar 2021.
Vancouver:
Carmi Jara VA. Consultas eficientes sobre bases de datos de grafo incompletas. [Internet] [Thesis]. Universidad de Chile; 2013. [cited 2021 Mar 07]. Available from: http://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://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
Brno University of Technology
20. Serédi, Silvester. Evoluční algoritmy v úloze booleovské splnitelnosti: Evolutionary Algorithms in the Task of Boolean Satisfiability.
Degree: 2018, Brno University of Technology
URL: http://hdl.handle.net/11012/53467
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 Details
Similar Records
❌
APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager
APA (6th Edition):
Serédi, S. (2018). Evoluční algoritmy v úloze booleovské splnitelnosti: Evolutionary Algorithms in the Task of Boolean Satisfiability. (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: Evolutionary Algorithms in the Task of Boolean Satisfiability.” 2018. Thesis, Brno University of Technology. Accessed March 07, 2021. 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: Evolutionary Algorithms in the Task of Boolean Satisfiability.” 2018. Web. 07 Mar 2021.
Vancouver:
Serédi S. Evoluční algoritmy v úloze booleovské splnitelnosti: Evolutionary Algorithms in the Task of Boolean Satisfiability. [Internet] [Thesis]. Brno University of Technology; 2018. [cited 2021 Mar 07]. 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: Evolutionary Algorithms in the Task of Boolean Satisfiability. [Thesis]. Brno University of Technology; 2018. 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
Université de Lorraine
21. Bousmar, Khadija. Conception d'un solveur matériel spécifique pour la résolution rapide du problème SAT appliqué à l'évaluation du risque en génie industriel : Design of a specific hardware solver for a speed resolution of the SAT problem applied to risk assessment in industrial engineering.
Degree: Docteur es, Automatique, Traitement du Signal et des Images, Génie Informatique, 2018, Université de Lorraine
URL: http://www.theses.fr/2018LORR0341
Subjects/Keywords: SAT; Solveur SAT; Gestion du risque industriel; Problème combinatoire; Architecture matérielle de calcul; SAT; SAT Solver; Industrial risk management; Combinatorial problem; Hardware computing architecture; 620.004 2; 005.12
Record Details
Similar Records
❌
APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager
APA (6th Edition):
Bousmar, K. (2018). Conception d'un solveur matériel spécifique pour la résolution rapide du problème SAT appliqué à l'évaluation du risque en génie industriel : Design of a specific hardware solver for a speed resolution of the SAT problem applied to risk assessment in industrial engineering. (Doctoral Dissertation). Université de Lorraine. Retrieved from http://www.theses.fr/2018LORR0341
Chicago Manual of Style (16th Edition):
Bousmar, Khadija. “Conception d'un solveur matériel spécifique pour la résolution rapide du problème SAT appliqué à l'évaluation du risque en génie industriel : Design of a specific hardware solver for a speed resolution of the SAT problem applied to risk assessment in industrial engineering.” 2018. Doctoral Dissertation, Université de Lorraine. Accessed March 07, 2021. http://www.theses.fr/2018LORR0341.
MLA Handbook (7th Edition):
Bousmar, Khadija. “Conception d'un solveur matériel spécifique pour la résolution rapide du problème SAT appliqué à l'évaluation du risque en génie industriel : Design of a specific hardware solver for a speed resolution of the SAT problem applied to risk assessment in industrial engineering.” 2018. Web. 07 Mar 2021.
Vancouver:
Bousmar K. Conception d'un solveur matériel spécifique pour la résolution rapide du problème SAT appliqué à l'évaluation du risque en génie industriel : Design of a specific hardware solver for a speed resolution of the SAT problem applied to risk assessment in industrial engineering. [Internet] [Doctoral dissertation]. Université de Lorraine; 2018. [cited 2021 Mar 07]. Available from: http://www.theses.fr/2018LORR0341.
Council of Science Editors:
Bousmar K. Conception d'un solveur matériel spécifique pour la résolution rapide du problème SAT appliqué à l'évaluation du risque en génie industriel : Design of a specific hardware solver for a speed resolution of the SAT problem applied to risk assessment in industrial engineering. [Doctoral Dissertation]. Université de Lorraine; 2018. Available from: http://www.theses.fr/2018LORR0341
22. Szczepanski, Nicolas. SAT en Parallèle : Parallel SAT solving.
Degree: Docteur es, Informatique, 2017, Université d'Artois
URL: http://www.theses.fr/2017ARTO0403
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 Details
Similar Records
❌
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 March 07, 2021. http://www.theses.fr/2017ARTO0403.
MLA Handbook (7th Edition):
Szczepanski, Nicolas. “SAT en Parallèle : Parallel SAT solving.” 2017. Web. 07 Mar 2021.
Vancouver:
Szczepanski N. SAT en Parallèle : Parallel SAT solving. [Internet] [Doctoral dissertation]. Université d'Artois; 2017. [cited 2021 Mar 07]. 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
23. -0075-9784. ADMINISTRATIVE LEADERSHIP EFFECT ON COLLEGE ENTRANCE EXAMINATION PARTICIPATION AND PERFORMANCE.
Degree: EdD, Professional Leadership, 2015, University of Houston
URL: http://hdl.handle.net/10657/1777
Subjects/Keywords: Leadership; SAT; ACT; Participation; Performance; Achievement; Gap
Record Details
Similar Records
❌
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. (Doctoral Dissertation). 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
Chicago Manual of Style (16th Edition):
-0075-9784. “ADMINISTRATIVE LEADERSHIP EFFECT ON COLLEGE ENTRANCE EXAMINATION PARTICIPATION AND PERFORMANCE.” 2015. Doctoral Dissertation, University of Houston. Accessed March 07, 2021. http://hdl.handle.net/10657/1777.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
MLA Handbook (7th Edition):
-0075-9784. “ADMINISTRATIVE LEADERSHIP EFFECT ON COLLEGE ENTRANCE EXAMINATION PARTICIPATION AND PERFORMANCE.” 2015. Web. 07 Mar 2021.
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] [Doctoral dissertation]. University of Houston; 2015. [cited 2021 Mar 07]. 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
Council of Science Editors:
-0075-9784. ADMINISTRATIVE LEADERSHIP EFFECT ON COLLEGE ENTRANCE EXAMINATION PARTICIPATION AND PERFORMANCE. [Doctoral Dissertation]. 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
University of Debrecen
24. Czuczor, Gergő. A SAT probléma .
Degree: DE – Informatikai Kar, University of Debrecen
URL: http://hdl.handle.net/2437/238631
Subjects/Keywords: sat; bonyolultság; egyenletrendszerek
Record Details
Similar Records
❌
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 March 07, 2021. 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. 07 Mar 2021.
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 2021 Mar 07]. 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.
Delft University of Technology
25. Zwart, Joost (author). Sparsity based hybrid system identification using a SAT solver.
Degree: 2019, Delft University of Technology
URL: http://resolver.tudelft.nl/uuid:725afc81-eefb-47b2-ac78-b6119a86eae8
Subjects/Keywords: SAT solver; Hybrid Systems; Identification; Sparsity
Record Details
Similar Records
❌
APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager
APA (6th Edition):
Zwart, J. (. (2019). Sparsity based hybrid system identification using a SAT solver. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:725afc81-eefb-47b2-ac78-b6119a86eae8
Chicago Manual of Style (16th Edition):
Zwart, Joost (author). “Sparsity based hybrid system identification using a SAT solver.” 2019. Masters Thesis, Delft University of Technology. Accessed March 07, 2021. http://resolver.tudelft.nl/uuid:725afc81-eefb-47b2-ac78-b6119a86eae8.
MLA Handbook (7th Edition):
Zwart, Joost (author). “Sparsity based hybrid system identification using a SAT solver.” 2019. Web. 07 Mar 2021.
Vancouver:
Zwart J(. Sparsity based hybrid system identification using a SAT solver. [Internet] [Masters thesis]. Delft University of Technology; 2019. [cited 2021 Mar 07]. Available from: http://resolver.tudelft.nl/uuid:725afc81-eefb-47b2-ac78-b6119a86eae8.
Council of Science Editors:
Zwart J(. Sparsity based hybrid system identification using a SAT solver. [Masters Thesis]. Delft University of Technology; 2019. Available from: http://resolver.tudelft.nl/uuid:725afc81-eefb-47b2-ac78-b6119a86eae8
University of Waterloo
26. Pisanov, Vladimir. Novel Value Ordering Heuristics Using Non-Linear Optimization In Boolean Satisfiability.
Degree: 2012, University of Waterloo
URL: http://hdl.handle.net/10012/6941
Subjects/Keywords: Boolean satisfiability; SAT; Backtracking search; Value ordering
Record Details
Similar Records
❌
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 March 07, 2021. 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. 07 Mar 2021.
Vancouver:
Pisanov V. Novel Value Ordering Heuristics Using Non-Linear Optimization In Boolean Satisfiability. [Internet] [Thesis]. University of Waterloo; 2012. [cited 2021 Mar 07]. 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
27. Zulkoski, Edward. Understanding and Enhancing CDCL-based SAT Solvers.
Degree: 2018, University of Waterloo
URL: http://hdl.handle.net/10012/13525
Subjects/Keywords: SAT Solvers; Backdoors; Computer Algebra Systems
Record Details
Similar Records
❌
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 March 07, 2021. 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. 07 Mar 2021.
Vancouver:
Zulkoski E. Understanding and Enhancing CDCL-based SAT Solvers. [Internet] [Thesis]. University of Waterloo; 2018. [cited 2021 Mar 07]. 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
28. Li, Zijie. Backdoors in Satisfiability Problems.
Degree: 2009, University of Waterloo
URL: http://hdl.handle.net/10012/4810
Subjects/Keywords: CSP; SAT; Backdoors
Record Details
Similar Records
❌
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 March 07, 2021. 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. 07 Mar 2021.
Vancouver:
Li Z. Backdoors in Satisfiability Problems. [Internet] [Thesis]. University of Waterloo; 2009. [cited 2021 Mar 07]. 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
Delft University of Technology
29. Vollebergh, M.A.J. (author). Incorporating flexible track use in the SAT model of the Dutch railway timetabling problem.
Degree: 2020, Delft University of Technology
URL: http://resolver.tudelft.nl/uuid:37aaf584-8775-44d6-b3cb-e914f8a54b48
Subjects/Keywords: Flexible track use; SAT; PESP; Railways; Timetabling
Record Details
Similar Records
❌
APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager
APA (6th Edition):
Vollebergh, M. A. J. (. (2020). Incorporating flexible track use in the SAT model of the Dutch railway timetabling problem. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:37aaf584-8775-44d6-b3cb-e914f8a54b48
Chicago Manual of Style (16th Edition):
Vollebergh, M A J (author). “Incorporating flexible track use in the SAT model of the Dutch railway timetabling problem.” 2020. Masters Thesis, Delft University of Technology. Accessed March 07, 2021. http://resolver.tudelft.nl/uuid:37aaf584-8775-44d6-b3cb-e914f8a54b48.
MLA Handbook (7th Edition):
Vollebergh, M A J (author). “Incorporating flexible track use in the SAT model of the Dutch railway timetabling problem.” 2020. Web. 07 Mar 2021.
Vancouver:
Vollebergh MAJ(. Incorporating flexible track use in the SAT model of the Dutch railway timetabling problem. [Internet] [Masters thesis]. Delft University of Technology; 2020. [cited 2021 Mar 07]. Available from: http://resolver.tudelft.nl/uuid:37aaf584-8775-44d6-b3cb-e914f8a54b48.
Council of Science Editors:
Vollebergh MAJ(. Incorporating flexible track use in the SAT model of the Dutch railway timetabling problem. [Masters Thesis]. Delft University of Technology; 2020. Available from: http://resolver.tudelft.nl/uuid:37aaf584-8775-44d6-b3cb-e914f8a54b48
30. 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
URL: http://www.theses.fr/2015ARTO0405
Subjects/Keywords: Aide à la décision; Optimisation multicritère; SAT; Decision aid; MCDA; SAT; 006.3
Record Details
Similar Records
❌
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 March 07, 2021. 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. 07 Mar 2021.
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 2021 Mar 07]. 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