subject:(Branch Reduce)

Brno University of Technology

1. 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

URL: http://hdl.handle.net/11012/66680

► 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 Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th 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 January 22, 2021. 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 (7^th 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. 22 Jan 2021.

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 2021 Jan 22]. 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

Kyoto University / 京都大学

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

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

URL: http://hdl.handle.net/2433/225741 ; http://dx.doi.org/10.14989/doctor.k20516

新制・課程博士

甲第20516号

情博第644号

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

Record Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th Edition):

Norhazwani, Md Yunos. “Polynomial-Space Exact Algorithms for Traveling Salesman Problem in Degree Bounded Graphs : 次数の制限されたグラフにおけるトラベリングセールスマン問題に対する多項式領域厳密アルゴリズム.” 2017. Thesis, Kyoto University / 京都大学. Accessed January 22, 2021. 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 (7^th Edition):

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

Vancouver:

Norhazwani MY. Polynomial-Space Exact Algorithms for Traveling Salesman Problem in Degree Bounded Graphs : 次数の制限されたグラフにおけるトラベリングセールスマン問題に対する多項式領域厳密アルゴリズム. [Internet] [Thesis]. Kyoto University / 京都大学; 2017. [cited 2021 Jan 22]. 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

URL: http://hdl.handle.net/2433/225741

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

Record Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th Edition):

Norhazwani, Md Yunos. “Polynomial-Space Exact Algorithms for Traveling Salesman Problem in Degree Bounded Graphs .” 2017. Thesis, Kyoto University. Accessed January 22, 2021. 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 (7^th Edition):

Norhazwani, Md Yunos. “Polynomial-Space Exact Algorithms for Traveling Salesman Problem in Degree Bounded Graphs .” 2017. Web. 22 Jan 2021.

Vancouver:

Norhazwani MY. Polynomial-Space Exact Algorithms for Traveling Salesman Problem in Degree Bounded Graphs . [Internet] [Thesis]. Kyoto University; 2017. [cited 2021 Jan 22]. 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

URL: http://hdl.handle.net/2027.42/124069

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

▼ 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 on two approaches to reduce the effective memory access time, namely prefetching and novel cache designs. In the first part of this dissertation we show that traditional metrics like coverage and accuracy may be inadequate for evaluating the effectiveness of a prefetch algorithm. Our main contribution is the development of a prefetch traffic and miss taxonomy (PTMT) that provides a complete classification of all the prefetches; in particular, the PTMT classification precisely quantifies the direct and indirect effect of each prefetch on traffic and misses. We show that while most instruction prefetch algorithms do achieve a substantial reduction in misses, they fail to issue the prefetches in a timely fashion. Our branch history guided hardware prefetch algorithm (BHGP) improves the timeliness of instruction prefetches. Our results show that BHGP on average eliminates 66% of the I-cache misses for some important commercial and Windows-NT applications and some applications from the CPU2000 suite that have high I-cache misses. In addition, BHGP improves IPC by 14 to 18% for the CPU2000 applications studied. In the second part of this dissertation, we explore novel cache designs to reduce the effective L1 cache access time in the light of current technology trends. We show that the straightforward approach of adding one more level of memory hierarchy, an L0 cache between the processor and the L1 cache, does not always reduce the effective cache access time because of the high miss rate of the L0 cache and the small difference in access latency between L0 and L1. We develop a split latency cache system (SpliCS), which is an enhanced version of the traditional (L0 + L1) system and uses 2 primary caches: a small fast cache (A) and a larger, slower cache (B). Our experiments show that, relative to a similarly configured L1 cache alone, SpliCS achieves an 8% or 18% reduction in CPI with a cache B latency of 3 or 5 cycles, respectively. Moreover, SpliCS achieves an average 15% improvement in CPI relative to a traditional (L0 + L1) hierarchy. Abstract shortened by UMI.) Advisors/Committee Members: Davidson, Edward S. (advisor), Tyson, Gary S. (advisor).

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

Record Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th Edition):

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

MLA Handbook (7^th Edition):

Srinivasan, Vijayalakshmi. “Hardware solutions to reduce effective memory access time.” 2001. Web. 22 Jan 2021.

Vancouver:

Srinivasan V. Hardware solutions to reduce effective memory access time. [Internet] [Doctoral dissertation]. University of Michigan; 2001. [cited 2021 Jan 22]. 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

Universiteit Utrecht

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

Degree: 2012, Universiteit Utrecht

URL: http://dspace.library.uu.nl:8080/handle/1874/253746

► 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 Details Similar Records Cite « Share

❌

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

APA (6^th 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 (16^th Edition):

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

MLA Handbook (7^th Edition):

Timmer, S T. “Exact Algorithms for Loop Cutset.” 2012. Web. 22 Jan 2021.

Vancouver:

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

		in
And / Or
		in
And / Or
		in
And / Or
		in

Open Access Theses and Dissertations