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

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


Universiteit Utrecht

1. 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 28, 2020. http://dspace.library.uu.nl:8080/handle/1874/253746.

MLA Handbook (7th Edition):

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

Vancouver:

Timmer ST. Exact Algorithms for Loop Cutset. [Internet] [Masters thesis]. Universiteit Utrecht; 2012. [cited 2020 Nov 28]. 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


Kyoto University / 京都大学

2. Norhazwani, Md Yunos. Polynomial-Space Exact Algorithms for Traveling Salesman Problem in Degree Bounded Graphs : 次数の制限されたグラフにおけるトラベリングセールスマン問題に対する多項式領域厳密アルゴリズム.

Degree: 博士(情報学), 2017, Kyoto University / 京都大学

新制・課程博士

甲第20516号

情博第644号

Subjects/Keywords: Traveling Salesman Problem; Exact Exponential Algorithm; Branch-and-reduce; Measure-and-conquer

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Norhazwani, M. Y. (2017). Polynomial-Space Exact Algorithms for Traveling Salesman Problem in Degree Bounded Graphs : 次数の制限されたグラフにおけるトラベリングセールスマン問題に対する多項式領域厳密アルゴリズム. (Thesis). Kyoto University / 京都大学. Retrieved from http://hdl.handle.net/2433/225741 ; http://dx.doi.org/10.14989/doctor.k20516

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

Norhazwani, Md Yunos. “Polynomial-Space Exact Algorithms for Traveling Salesman Problem in Degree Bounded Graphs : 次数の制限されたグラフにおけるトラベリングセールスマン問題に対する多項式領域厳密アルゴリズム.” 2017. Thesis, Kyoto University / 京都大学. Accessed November 28, 2020. http://hdl.handle.net/2433/225741 ; http://dx.doi.org/10.14989/doctor.k20516.

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

MLA Handbook (7th Edition):

Norhazwani, Md Yunos. “Polynomial-Space Exact Algorithms for Traveling Salesman Problem in Degree Bounded Graphs : 次数の制限されたグラフにおけるトラベリングセールスマン問題に対する多項式領域厳密アルゴリズム.” 2017. Web. 28 Nov 2020.

Vancouver:

Norhazwani MY. Polynomial-Space Exact Algorithms for Traveling Salesman Problem in Degree Bounded Graphs : 次数の制限されたグラフにおけるトラベリングセールスマン問題に対する多項式領域厳密アルゴリズム. [Internet] [Thesis]. Kyoto University / 京都大学; 2017. [cited 2020 Nov 28]. Available from: http://hdl.handle.net/2433/225741 ; http://dx.doi.org/10.14989/doctor.k20516.

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

Council of Science Editors:

Norhazwani MY. Polynomial-Space Exact Algorithms for Traveling Salesman Problem in Degree Bounded Graphs : 次数の制限されたグラフにおけるトラベリングセールスマン問題に対する多項式領域厳密アルゴリズム. [Thesis]. Kyoto University / 京都大学; 2017. Available from: http://hdl.handle.net/2433/225741 ; http://dx.doi.org/10.14989/doctor.k20516

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


Kyoto University

3. Norhazwani, Md Yunos. Polynomial-Space Exact Algorithms for Traveling Salesman Problem in Degree Bounded Graphs .

Degree: 2017, Kyoto University

Subjects/Keywords: Traveling Salesman Problem; Exact Exponential Algorithm; Branch-and-reduce; Measure-and-conquer

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Norhazwani, M. Y. (2017). Polynomial-Space Exact Algorithms for Traveling Salesman Problem in Degree Bounded Graphs . (Thesis). Kyoto University. Retrieved from http://hdl.handle.net/2433/225741

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

Norhazwani, Md Yunos. “Polynomial-Space Exact Algorithms for Traveling Salesman Problem in Degree Bounded Graphs .” 2017. Thesis, Kyoto University. Accessed November 28, 2020. http://hdl.handle.net/2433/225741.

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

MLA Handbook (7th Edition):

Norhazwani, Md Yunos. “Polynomial-Space Exact Algorithms for Traveling Salesman Problem in Degree Bounded Graphs .” 2017. Web. 28 Nov 2020.

Vancouver:

Norhazwani MY. Polynomial-Space Exact Algorithms for Traveling Salesman Problem in Degree Bounded Graphs . [Internet] [Thesis]. Kyoto University; 2017. [cited 2020 Nov 28]. Available from: http://hdl.handle.net/2433/225741.

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

Council of Science Editors:

Norhazwani MY. Polynomial-Space Exact Algorithms for Traveling Salesman Problem in Degree Bounded Graphs . [Thesis]. Kyoto University; 2017. Available from: http://hdl.handle.net/2433/225741

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


University of Michigan

4. Srinivasan, Vijayalakshmi. Hardware solutions to reduce effective memory access time.

Degree: PhD, Electrical engineering, 2001, University of Michigan

 In this dissertation, we provide hardware solutions to increase the efficiency of the cache hierarchy, thereby reducing the effective memory access time. Specifically, we focus… (more)

Subjects/Keywords: Branch History Guided; Branch History-guided; Effective; Hardware Prefetch; Memory Access Time; Reduce; Solutions; Split Latency Cache

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Srinivasan, V. (2001). Hardware solutions to reduce effective memory access time. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/124069

Chicago Manual of Style (16th Edition):

Srinivasan, Vijayalakshmi. “Hardware solutions to reduce effective memory access time.” 2001. Doctoral Dissertation, University of Michigan. Accessed November 28, 2020. http://hdl.handle.net/2027.42/124069.

MLA Handbook (7th Edition):

Srinivasan, Vijayalakshmi. “Hardware solutions to reduce effective memory access time.” 2001. Web. 28 Nov 2020.

Vancouver:

Srinivasan V. Hardware solutions to reduce effective memory access time. [Internet] [Doctoral dissertation]. University of Michigan; 2001. [cited 2020 Nov 28]. Available from: http://hdl.handle.net/2027.42/124069.

Council of Science Editors:

Srinivasan V. Hardware solutions to reduce effective memory access time. [Doctoral Dissertation]. University of Michigan; 2001. Available from: http://hdl.handle.net/2027.42/124069


Brno University of Technology

5. Kubiš, David. Zvýšení ročního využití parního práškového kotle K5 ve ŽĎAS, a. s: Increasing the annual use of steam boilers K5 powder in ŽĎAS, a. S.

Degree: 2019, Brno University of Technology

 This mastes´s thesis deals with higher usage of boiler K5 in CHP plant ŽĎAS, a.s. in temporary season, when due to reduced consumption is overheating… (more)

Subjects/Keywords: Teplárna ŽĎAS; a.s.; kotel; chlazení horkovodu; kondenzace páry; snížení minimálního výkonu kotle; točivá redukce; CHP plant ŽĎAS; a.s.; boiler; cooling hot water return branch; condensation of steam; reduce minimal power of boiler; micro turbine

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kubiš, D. (2019). Zvýšení ročního využití parního práškového kotle K5 ve ŽĎAS, a. s: Increasing the annual use of steam boilers K5 powder in ŽĎAS, a. S. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/66680

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

Kubiš, David. “Zvýšení ročního využití parního práškového kotle K5 ve ŽĎAS, a. s: Increasing the annual use of steam boilers K5 powder in ŽĎAS, a. S.” 2019. Thesis, Brno University of Technology. Accessed November 28, 2020. http://hdl.handle.net/11012/66680.

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

MLA Handbook (7th Edition):

Kubiš, David. “Zvýšení ročního využití parního práškového kotle K5 ve ŽĎAS, a. s: Increasing the annual use of steam boilers K5 powder in ŽĎAS, a. S.” 2019. Web. 28 Nov 2020.

Vancouver:

Kubiš D. Zvýšení ročního využití parního práškového kotle K5 ve ŽĎAS, a. s: Increasing the annual use of steam boilers K5 powder in ŽĎAS, a. S. [Internet] [Thesis]. Brno University of Technology; 2019. [cited 2020 Nov 28]. Available from: http://hdl.handle.net/11012/66680.

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

Council of Science Editors:

Kubiš D. Zvýšení ročního využití parního práškového kotle K5 ve ŽĎAS, a. s: Increasing the annual use of steam boilers K5 powder in ŽĎAS, a. S. [Thesis]. Brno University of Technology; 2019. Available from: http://hdl.handle.net/11012/66680

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

.