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

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


Queensland University of Technology

1. Chan, Teck-Wai. Proximity-to-separation based energy function control strategy for power system stability.

Degree: 2003, Queensland University of Technology

 The issue of angle instability has been widely discussed in the power engineering literature. Many control techniques have been proposed to provide the complementary synchronizing… (more)

Subjects/Keywords: Lyapunov; power system; stability; switching; energy function-based control; bang-bang control; saturation function; energy in phase portrait; partly stable region; energy weighting; cutset; energy decomposition; cutest energy; proximity-to-critical cutset energy; proximity-to-partly stable region; cutset energy-based control; quantified transient stability limits and transfer capacity.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chan, T. (2003). Proximity-to-separation based energy function control strategy for power system stability. (Thesis). Queensland University of Technology. Retrieved from http://eprints.qut.edu.au/15840/

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

Chan, Teck-Wai. “Proximity-to-separation based energy function control strategy for power system stability.” 2003. Thesis, Queensland University of Technology. Accessed November 30, 2020. http://eprints.qut.edu.au/15840/.

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

MLA Handbook (7th Edition):

Chan, Teck-Wai. “Proximity-to-separation based energy function control strategy for power system stability.” 2003. Web. 30 Nov 2020.

Vancouver:

Chan T. Proximity-to-separation based energy function control strategy for power system stability. [Internet] [Thesis]. Queensland University of Technology; 2003. [cited 2020 Nov 30]. Available from: http://eprints.qut.edu.au/15840/.

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

Council of Science Editors:

Chan T. Proximity-to-separation based energy function control strategy for power system stability. [Thesis]. Queensland University of Technology; 2003. Available from: http://eprints.qut.edu.au/15840/

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


Wilfrid Laurier University

2. Gorbonos, Elizabeth. Separability and Vertex Ordering of Graphs.

Degree: 2019, Wilfrid Laurier University

 Many graph optimization problems, such as finding an optimal coloring, or a largest clique, can be solved by a divide-and-conquer approach. One such well-known technique… (more)

Subjects/Keywords: graph theory; decomposition; clique cutset; simplicial extreme; even-hole; kite; Theory and Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gorbonos, E. (2019). Separability and Vertex Ordering of Graphs. (Thesis). Wilfrid Laurier University. Retrieved from https://scholars.wlu.ca/etd/2148

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

Gorbonos, Elizabeth. “Separability and Vertex Ordering of Graphs.” 2019. Thesis, Wilfrid Laurier University. Accessed November 30, 2020. https://scholars.wlu.ca/etd/2148.

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

MLA Handbook (7th Edition):

Gorbonos, Elizabeth. “Separability and Vertex Ordering of Graphs.” 2019. Web. 30 Nov 2020.

Vancouver:

Gorbonos E. Separability and Vertex Ordering of Graphs. [Internet] [Thesis]. Wilfrid Laurier University; 2019. [cited 2020 Nov 30]. Available from: https://scholars.wlu.ca/etd/2148.

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

Council of Science Editors:

Gorbonos E. Separability and Vertex Ordering of Graphs. [Thesis]. Wilfrid Laurier University; 2019. Available from: https://scholars.wlu.ca/etd/2148

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


Texas A&M University

3. Luo, Haochen. Valid Inequalities and Facets for Multi-Module (Survivable) Capacitated Network Design Problem.

Degree: PhD, Industrial Engineering, 2019, Texas A&M University

 In this dissertation, we develop new methodologies and algorithms to solve the multi-module (survivable) network design problem. Many real-world decision-making problems can be modeled as… (more)

Subjects/Keywords: mixed-integer programming; network design; cutset inequalities; valid inequalities; n-step MIR

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Luo, H. (2019). Valid Inequalities and Facets for Multi-Module (Survivable) Capacitated Network Design Problem. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/188770

Chicago Manual of Style (16th Edition):

Luo, Haochen. “Valid Inequalities and Facets for Multi-Module (Survivable) Capacitated Network Design Problem.” 2019. Doctoral Dissertation, Texas A&M University. Accessed November 30, 2020. http://hdl.handle.net/1969.1/188770.

MLA Handbook (7th Edition):

Luo, Haochen. “Valid Inequalities and Facets for Multi-Module (Survivable) Capacitated Network Design Problem.” 2019. Web. 30 Nov 2020.

Vancouver:

Luo H. Valid Inequalities and Facets for Multi-Module (Survivable) Capacitated Network Design Problem. [Internet] [Doctoral dissertation]. Texas A&M University; 2019. [cited 2020 Nov 30]. Available from: http://hdl.handle.net/1969.1/188770.

Council of Science Editors:

Luo H. Valid Inequalities and Facets for Multi-Module (Survivable) Capacitated Network Design Problem. [Doctoral Dissertation]. Texas A&M University; 2019. Available from: http://hdl.handle.net/1969.1/188770

4. Reyes, Matthew G. Cutset Based Processing and Compression of Markov Random Fields.

Degree: PhD, Electrical Engineering: Systems, 2011, University of Michigan

 This thesis presents results related to the compression a Markov random field (MRF) bfX defined on a graph G=(V,E) by first losslessly compressing a cutset(more)

Subjects/Keywords: Markov Random Fields; Source Coding; Belief Propagation; Cutset; Ising Model; Monotonicity; Electrical Engineering; Engineering

…III. Lossy Cutset Coding of Ising Model . . . . . . . . . . . . . . . 40 2.4 2.5 3.1 3.2… …Lossy Cutset Coding . . . . . . . . . . . . . . . . . . . . . . . Analytical Block MAP… …the Grid Cutset and Rate Analysis . . . . . . . . . Proofs… …Out Loop Cutset Nodes . 4.3.3 Complexity of LC . . . . . . . . . . . . . . . . . Example… …Checkerboard Loop Cutset on 4 pt. Grid Graph Proofs… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Reyes, M. G. (2011). Cutset Based Processing and Compression of Markov Random Fields. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/84510

Chicago Manual of Style (16th Edition):

Reyes, Matthew G. “Cutset Based Processing and Compression of Markov Random Fields.” 2011. Doctoral Dissertation, University of Michigan. Accessed November 30, 2020. http://hdl.handle.net/2027.42/84510.

MLA Handbook (7th Edition):

Reyes, Matthew G. “Cutset Based Processing and Compression of Markov Random Fields.” 2011. Web. 30 Nov 2020.

Vancouver:

Reyes MG. Cutset Based Processing and Compression of Markov Random Fields. [Internet] [Doctoral dissertation]. University of Michigan; 2011. [cited 2020 Nov 30]. Available from: http://hdl.handle.net/2027.42/84510.

Council of Science Editors:

Reyes MG. Cutset Based Processing and Compression of Markov Random Fields. [Doctoral Dissertation]. University of Michigan; 2011. Available from: http://hdl.handle.net/2027.42/84510


Universiteit Utrecht

5. Timmer, S.T. Exact Algorithms for Loop Cutset.

Degree: 2012, Universiteit Utrecht

 The LOOP CUTSET problem was historically posed by Pearl as a subroutine in Pearl’s algorithm for computing inference in probabilistic networks. The efficiency of the… (more)

Subjects/Keywords: LOOP CUTSET; MAXIMUM INDUCED FOREST; Exact Algorithms; Treewidth; Cut & Count; Branch & Bound; Branch & Reduce; FEEDBACK VERTEX SET

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Timmer, S. T. (2012). Exact Algorithms for Loop Cutset. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/253746

Chicago Manual of Style (16th Edition):

Timmer, S T. “Exact Algorithms for Loop Cutset.” 2012. Masters Thesis, Universiteit Utrecht. Accessed November 30, 2020. http://dspace.library.uu.nl:8080/handle/1874/253746.

MLA Handbook (7th Edition):

Timmer, S T. “Exact Algorithms for Loop Cutset.” 2012. Web. 30 Nov 2020.

Vancouver:

Timmer ST. Exact Algorithms for Loop Cutset. [Internet] [Masters thesis]. Universiteit Utrecht; 2012. [cited 2020 Nov 30]. Available from: http://dspace.library.uu.nl:8080/handle/1874/253746.

Council of Science Editors:

Timmer ST. Exact Algorithms for Loop Cutset. [Masters Thesis]. Universiteit Utrecht; 2012. Available from: http://dspace.library.uu.nl:8080/handle/1874/253746


Queens University

6. Wu, Szu Kuan Steven. Lossless Coding of Markov Random Fields with Complex Cliques .

Degree: Mathematics and Statistics, 2013, Queens University

 The topic of Markov Random Fields (MRFs) has been well studied in the past, and has found practical use in various image processing, and machine… (more)

Subjects/Keywords: Markov Random Fields ; Applied Probability ; Belief Propagation ; Reduced Cutset Coding ; Information Theory ; Complex Cliques ; Computer Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wu, S. K. S. (2013). Lossless Coding of Markov Random Fields with Complex Cliques . (Thesis). Queens University. Retrieved from http://hdl.handle.net/1974/8166

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

Wu, Szu Kuan Steven. “Lossless Coding of Markov Random Fields with Complex Cliques .” 2013. Thesis, Queens University. Accessed November 30, 2020. http://hdl.handle.net/1974/8166.

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

MLA Handbook (7th Edition):

Wu, Szu Kuan Steven. “Lossless Coding of Markov Random Fields with Complex Cliques .” 2013. Web. 30 Nov 2020.

Vancouver:

Wu SKS. Lossless Coding of Markov Random Fields with Complex Cliques . [Internet] [Thesis]. Queens University; 2013. [cited 2020 Nov 30]. Available from: http://hdl.handle.net/1974/8166.

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

Council of Science Editors:

Wu SKS. Lossless Coding of Markov Random Fields with Complex Cliques . [Thesis]. Queens University; 2013. Available from: http://hdl.handle.net/1974/8166

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

7. Xiong, Xin. Efficient Jacobian Determination by Structure-Revealing Automatic Differentiation.

Degree: 2014, University of Waterloo

 This thesis is concerned with the efficient computation of Jacobian matrices of nonlinear vector maps using automatic differentiation (AD). Specifically, we propose the use of… (more)

Subjects/Keywords: Automatic differentiation; Forward mode; Reverse mode; Directed acyclic graph; Computational graph; Directed edge separator; Jacobian matrix; Newton step; Minimum cutset; Ford-Fulkerson algorithm; Sparsity technique; Hidden structure

…is in G − S − T , assign 1 to it as its weight, otherwise assign infinity to it. The cutset… …cutset by algorihtm described in Algorithm 3.2.3. We use the AD-tool, ADMAT [31], to… …see improvements. If cutset method is used, JE defined by equation (2.12) will be… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Xiong, X. (2014). Efficient Jacobian Determination by Structure-Revealing Automatic Differentiation. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/8197

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

Xiong, Xin. “Efficient Jacobian Determination by Structure-Revealing Automatic Differentiation.” 2014. Thesis, University of Waterloo. Accessed November 30, 2020. http://hdl.handle.net/10012/8197.

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

MLA Handbook (7th Edition):

Xiong, Xin. “Efficient Jacobian Determination by Structure-Revealing Automatic Differentiation.” 2014. Web. 30 Nov 2020.

Vancouver:

Xiong X. Efficient Jacobian Determination by Structure-Revealing Automatic Differentiation. [Internet] [Thesis]. University of Waterloo; 2014. [cited 2020 Nov 30]. Available from: http://hdl.handle.net/10012/8197.

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

Council of Science Editors:

Xiong X. Efficient Jacobian Determination by Structure-Revealing Automatic Differentiation. [Thesis]. University of Waterloo; 2014. Available from: http://hdl.handle.net/10012/8197

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

.