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:(MAXSAT). Showing records 1 – 7 of 7 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


Colorado State University

1. 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 March 09, 2021. http://hdl.handle.net/10217/189292.

MLA Handbook (7th Edition):

Chen, Wenxiang. “Discovering and harnessing structures in solving application satisfiability instances.” 2018. Web. 09 Mar 2021.

Vancouver:

Chen W. Discovering and harnessing structures in solving application satisfiability instances. [Internet] [Doctoral dissertation]. Colorado State University; 2018. [cited 2021 Mar 09]. 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

2. Sohanghpurwala, Ali Asgar Ali Akbar. Exploits in Concurrency for Boolean Satisfiability.

Degree: PhD, Computer Engineering, 2018, Virginia Tech

 Boolean Satisfiability (SAT) is a problem that holds great theoretical significance along with effective formulations that benefit many real-world applications. While the general problem is… (more)

Subjects/Keywords: Satisfiability; FPGA; SLS; MaxSAT; Parallel Local Search; SAT

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7 Sample image

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sohanghpurwala, A. A. A. A. (2018). Exploits in Concurrency for Boolean Satisfiability. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/86417

Chicago Manual of Style (16th Edition):

Sohanghpurwala, Ali Asgar Ali Akbar. “Exploits in Concurrency for Boolean Satisfiability.” 2018. Doctoral Dissertation, Virginia Tech. Accessed March 09, 2021. http://hdl.handle.net/10919/86417.

MLA Handbook (7th Edition):

Sohanghpurwala, Ali Asgar Ali Akbar. “Exploits in Concurrency for Boolean Satisfiability.” 2018. Web. 09 Mar 2021.

Vancouver:

Sohanghpurwala AAAA. Exploits in Concurrency for Boolean Satisfiability. [Internet] [Doctoral dissertation]. Virginia Tech; 2018. [cited 2021 Mar 09]. Available from: http://hdl.handle.net/10919/86417.

Council of Science Editors:

Sohanghpurwala AAAA. Exploits in Concurrency for Boolean Satisfiability. [Doctoral Dissertation]. Virginia Tech; 2018. Available from: http://hdl.handle.net/10919/86417

3. Gonzalez, Pedro Frazão. Application of substructural local search in the MAXSAT problem.

Degree: 2011, RCAAP

Dissertação de mest., Engenharia Informática, Faculdade de Ciências e Tecnologia, Univ. do Algarve, 2011

Genetic Algorithms (GAs) are stochastic optimizers usually applied to problems where… (more)

Subjects/Keywords: Algoritmos genéticos; Algoritmos da estimação da distribuição; Redes Bayesianas; Pesquisa local sub-estrutural; MAXSAT

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gonzalez, P. F. (2011). Application of substructural local search in the MAXSAT problem. (Thesis). RCAAP. Retrieved from https://www.rcaap.pt/detail.jsp?id=oai:sapientia.ualg.pt:10400.1/2746

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):

Gonzalez, Pedro Frazão. “Application of substructural local search in the MAXSAT problem.” 2011. Thesis, RCAAP. Accessed March 09, 2021. https://www.rcaap.pt/detail.jsp?id=oai:sapientia.ualg.pt:10400.1/2746.

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

MLA Handbook (7th Edition):

Gonzalez, Pedro Frazão. “Application of substructural local search in the MAXSAT problem.” 2011. Web. 09 Mar 2021.

Vancouver:

Gonzalez PF. Application of substructural local search in the MAXSAT problem. [Internet] [Thesis]. RCAAP; 2011. [cited 2021 Mar 09]. Available from: https://www.rcaap.pt/detail.jsp?id=oai:sapientia.ualg.pt:10400.1/2746.

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

Council of Science Editors:

Gonzalez PF. Application of substructural local search in the MAXSAT problem. [Thesis]. RCAAP; 2011. Available from: https://www.rcaap.pt/detail.jsp?id=oai:sapientia.ualg.pt:10400.1/2746

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

4. Gabàs Masip, Joel. SAT-based approaches for constraint optimization.

Degree: Departament d'Informàtica i Enginyeria Industrial, 2016, Universitat de Lleida

 Constraint optimization has been successfully used to solve problems in many real world (industrial) domains. This PhD thesis is focused on logic-based approaches, in particular,… (more)

Subjects/Keywords: MaxSAT; SAT; Optimització; Optimización; Optimization; Ciència de la computació i intel·ligència artificial; 004

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gabàs Masip, J. (2016). SAT-based approaches for constraint optimization. (Thesis). Universitat de Lleida. Retrieved from http://hdl.handle.net/10803/396610

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):

Gabàs Masip, Joel. “SAT-based approaches for constraint optimization.” 2016. Thesis, Universitat de Lleida. Accessed March 09, 2021. http://hdl.handle.net/10803/396610.

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

MLA Handbook (7th Edition):

Gabàs Masip, Joel. “SAT-based approaches for constraint optimization.” 2016. Web. 09 Mar 2021.

Vancouver:

Gabàs Masip J. SAT-based approaches for constraint optimization. [Internet] [Thesis]. Universitat de Lleida; 2016. [cited 2021 Mar 09]. Available from: http://hdl.handle.net/10803/396610.

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

Council of Science Editors:

Gabàs Masip J. SAT-based approaches for constraint optimization. [Thesis]. Universitat de Lleida; 2016. Available from: http://hdl.handle.net/10803/396610

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

5. Klein, Dominik. Equational Reasoning and Completion.

Degree: Japan Advanced Institute of Science and Technology / 北陸先端科学技術大学院大学

Supervisor: Mizuhito Ogawa

情報科学研究科

博士

Subjects/Keywords: Term Rewriting; Rewriting; Confluence; Completion; Constraint Solving; MaxSAT; Relative Termination

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Klein, D. (n.d.). Equational Reasoning and Completion. (Thesis). Japan Advanced Institute of Science and Technology / 北陸先端科学技術大学院大学. Retrieved from http://hdl.handle.net/10119/10560

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):

Klein, Dominik. “Equational Reasoning and Completion.” Thesis, Japan Advanced Institute of Science and Technology / 北陸先端科学技術大学院大学. Accessed March 09, 2021. http://hdl.handle.net/10119/10560.

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):

Klein, Dominik. “Equational Reasoning and Completion.” Web. 09 Mar 2021.

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

Vancouver:

Klein D. Equational Reasoning and Completion. [Internet] [Thesis]. Japan Advanced Institute of Science and Technology / 北陸先端科学技術大学院大学; [cited 2021 Mar 09]. Available from: http://hdl.handle.net/10119/10560.

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:

Klein D. Equational Reasoning and Completion. [Thesis]. Japan Advanced Institute of Science and Technology / 北陸先端科学技術大学院大学; Available from: http://hdl.handle.net/10119/10560

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

6. Cabiscol i Teixidó, Alba. Encodings and Benchmarks for MaxSAT Solving.

Degree: Departament d'Informàtica i Enginyeria Industrial, 2012, Universitat de Lleida

Subjects/Keywords: SAT; MaxSAT; Codificacions; CSP; Benchmarks; Encodings; Codificaciones; Ciència de la Computació i Inteligència Artificial; 004

…vi CONTENTS 3.2 MaxSAT algorithms… …bound with inference . . . . . . . . . . . . 46 3.4 SAT-based MaxSAT algorithms… …76 5 Encoding MaxCSP into Partial MaxSAT 83 5.1 MaxCSP preliminaries… …84 5.2 Direct encodings from MaxCSP into Partial MaxSAT . . . . . . . . . . 84 5.3… …Minimal support encodings from MaxCSP into Partial MaxSAT . . . . 86 5.4 Support encodings… 

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cabiscol i Teixidó, A. (2012). Encodings and Benchmarks for MaxSAT Solving. (Thesis). Universitat de Lleida. Retrieved from http://hdl.handle.net/10803/84021

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):

Cabiscol i Teixidó, Alba. “Encodings and Benchmarks for MaxSAT Solving.” 2012. Thesis, Universitat de Lleida. Accessed March 09, 2021. http://hdl.handle.net/10803/84021.

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

MLA Handbook (7th Edition):

Cabiscol i Teixidó, Alba. “Encodings and Benchmarks for MaxSAT Solving.” 2012. Web. 09 Mar 2021.

Vancouver:

Cabiscol i Teixidó A. Encodings and Benchmarks for MaxSAT Solving. [Internet] [Thesis]. Universitat de Lleida; 2012. [cited 2021 Mar 09]. Available from: http://hdl.handle.net/10803/84021.

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

Council of Science Editors:

Cabiscol i Teixidó A. Encodings and Benchmarks for MaxSAT Solving. [Thesis]. Universitat de Lleida; 2012. Available from: http://hdl.handle.net/10803/84021

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

7. Zhang, Xin. Combining logical and probabilistic reasoning in program analysis.

Degree: PhD, Computer Science, 2017, Georgia Tech

 Software is becoming increasingly pervasive and complex. These trends expose masses of users to unintended software failures and deliberate cyber-attacks. A widely adopted solution to… (more)

Subjects/Keywords: Program analysis; Logic; Probability; Combined logical and probabilistic reasoning; Markov logic networks; Datalog; MaxSAT; Verification; Bug finding; Programming languages; Software engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhang, X. (2017). Combining logical and probabilistic reasoning in program analysis. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/59200

Chicago Manual of Style (16th Edition):

Zhang, Xin. “Combining logical and probabilistic reasoning in program analysis.” 2017. Doctoral Dissertation, Georgia Tech. Accessed March 09, 2021. http://hdl.handle.net/1853/59200.

MLA Handbook (7th Edition):

Zhang, Xin. “Combining logical and probabilistic reasoning in program analysis.” 2017. Web. 09 Mar 2021.

Vancouver:

Zhang X. Combining logical and probabilistic reasoning in program analysis. [Internet] [Doctoral dissertation]. Georgia Tech; 2017. [cited 2021 Mar 09]. Available from: http://hdl.handle.net/1853/59200.

Council of Science Editors:

Zhang X. Combining logical and probabilistic reasoning in program analysis. [Doctoral Dissertation]. Georgia Tech; 2017. Available from: http://hdl.handle.net/1853/59200

.