Advanced search options

Sorted by: relevance · author · university · date | New search

You searched for `subject:(parallel algorithm)`

.
Showing records 1 – 30 of
204 total matches.

◁ [1] [2] [3] [4] [5] [6] [7] ▶

Search Limiters

Dates

- 2015 – 2019 (60)
- 2010 – 2014 (82)
- 2005 – 2009 (43)
- 2000 – 2004 (13)
- 1995 – 1999 (10)

Department

Degrees

- PhD (45)
- MS (18)
- Docteur es (13)

Languages

- English (106)
- Portuguese (12)
- Czech (11)

Country

- US (72)
- Brazil (16)
- Canada (16)
- Czech Republic (14)
- France (13)

▼ Search Limiters

University of Western Australia

1.
Bravo-Rojas, Maria Luisa.
Computation of skyline points using *parallel* scan algorithms on GPU devices.

Degree: MS, 2014, University of Western Australia

URL: http://repository.uwa.edu.au:80/R/?func=dbin-jump-full&object_id=40256&local_base=GEN01-INS01

►

The computation of skyline points has become a particularly interesting topic in recent years because of its application in multi-criteria decision-making systems. Though many e… (more)

Subjects/Keywords: Skyline; Database; GPU; Parallel algorithm

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Bravo-Rojas, M. L. (2014). Computation of skyline points using parallel scan algorithms on GPU devices. (Masters Thesis). University of Western Australia. Retrieved from http://repository.uwa.edu.au:80/R/?func=dbin-jump-full&object_id=40256&local_base=GEN01-INS01

Chicago Manual of Style (16^{th} Edition):

Bravo-Rojas, Maria Luisa. “Computation of skyline points using parallel scan algorithms on GPU devices.” 2014. Masters Thesis, University of Western Australia. Accessed July 17, 2019. http://repository.uwa.edu.au:80/R/?func=dbin-jump-full&object_id=40256&local_base=GEN01-INS01.

MLA Handbook (7^{th} Edition):

Bravo-Rojas, Maria Luisa. “Computation of skyline points using parallel scan algorithms on GPU devices.” 2014. Web. 17 Jul 2019.

Vancouver:

Bravo-Rojas ML. Computation of skyline points using parallel scan algorithms on GPU devices. [Internet] [Masters thesis]. University of Western Australia; 2014. [cited 2019 Jul 17]. Available from: http://repository.uwa.edu.au:80/R/?func=dbin-jump-full&object_id=40256&local_base=GEN01-INS01.

Council of Science Editors:

Bravo-Rojas ML. Computation of skyline points using parallel scan algorithms on GPU devices. [Masters Thesis]. University of Western Australia; 2014. Available from: http://repository.uwa.edu.au:80/R/?func=dbin-jump-full&object_id=40256&local_base=GEN01-INS01

Delft University of Technology

2. Willekens, P.A. Improving the production of high quality anodes at Aluchemie:.

Degree: 2015, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:3ce53ff8-d2fc-41c2-bcad-c96464455423

The production of anodes at Aluchemie is improved using a genetic algorithm. This is a parallel batch scheduling problem, where the batching and handling time constraints are predetermined. The GA has customized crossover and mutation functions. Using this GA, an improvement of 4.4% achieved.
*Advisors/Committee Members: Duinkerken, M.B..*

Subjects/Keywords: Genetic Algorithm; Parallel Batch Scheduling

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Willekens, P. A. (2015). Improving the production of high quality anodes at Aluchemie:. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:3ce53ff8-d2fc-41c2-bcad-c96464455423

Chicago Manual of Style (16^{th} Edition):

Willekens, P A. “Improving the production of high quality anodes at Aluchemie:.” 2015. Masters Thesis, Delft University of Technology. Accessed July 17, 2019. http://resolver.tudelft.nl/uuid:3ce53ff8-d2fc-41c2-bcad-c96464455423.

MLA Handbook (7^{th} Edition):

Willekens, P A. “Improving the production of high quality anodes at Aluchemie:.” 2015. Web. 17 Jul 2019.

Vancouver:

Willekens PA. Improving the production of high quality anodes at Aluchemie:. [Internet] [Masters thesis]. Delft University of Technology; 2015. [cited 2019 Jul 17]. Available from: http://resolver.tudelft.nl/uuid:3ce53ff8-d2fc-41c2-bcad-c96464455423.

Council of Science Editors:

Willekens PA. Improving the production of high quality anodes at Aluchemie:. [Masters Thesis]. Delft University of Technology; 2015. Available from: http://resolver.tudelft.nl/uuid:3ce53ff8-d2fc-41c2-bcad-c96464455423

California State University – Sacramento

3.
Saxena, Ankita.
Acceleration of Bellman-Ford single source shortest path using *parallel* computing.

Degree: MS, Electrical and Electronic Engineering, 2019, California State University – Sacramento

URL: http://hdl.handle.net/10211.3/207661

► With the advancement in technology these days, we need our work to be done in a faster and efficient way, especially in the areas of…
(more)

Subjects/Keywords: Parallel computing; Operating system; Bellman-Ford algorithm

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Saxena, A. (2019). Acceleration of Bellman-Ford single source shortest path using parallel computing. (Masters Thesis). California State University – Sacramento. Retrieved from http://hdl.handle.net/10211.3/207661

Chicago Manual of Style (16^{th} Edition):

Saxena, Ankita. “Acceleration of Bellman-Ford single source shortest path using parallel computing.” 2019. Masters Thesis, California State University – Sacramento. Accessed July 17, 2019. http://hdl.handle.net/10211.3/207661.

MLA Handbook (7^{th} Edition):

Saxena, Ankita. “Acceleration of Bellman-Ford single source shortest path using parallel computing.” 2019. Web. 17 Jul 2019.

Vancouver:

Saxena A. Acceleration of Bellman-Ford single source shortest path using parallel computing. [Internet] [Masters thesis]. California State University – Sacramento; 2019. [cited 2019 Jul 17]. Available from: http://hdl.handle.net/10211.3/207661.

Council of Science Editors:

Saxena A. Acceleration of Bellman-Ford single source shortest path using parallel computing. [Masters Thesis]. California State University – Sacramento; 2019. Available from: http://hdl.handle.net/10211.3/207661

Rice University

4.
Wang, Guohui.
Design Space Exploration of *Parallel* Algorithms and Architectures for Wireless Communication and Mobile Computing Systems.

Degree: PhD, Engineering, 2014, Rice University

URL: http://hdl.handle.net/1911/88381

► During past several years, there has been a trend that the modern mobile SoC (system-on-chip) chipsets start to incorporate in one single chip the functionality…
(more)

Subjects/Keywords: Mobile computing; parallel algorithm; parallel architecture; VLSI; GPU

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Wang, G. (2014). Design Space Exploration of Parallel Algorithms and Architectures for Wireless Communication and Mobile Computing Systems. (Doctoral Dissertation). Rice University. Retrieved from http://hdl.handle.net/1911/88381

Chicago Manual of Style (16^{th} Edition):

Wang, Guohui. “Design Space Exploration of Parallel Algorithms and Architectures for Wireless Communication and Mobile Computing Systems.” 2014. Doctoral Dissertation, Rice University. Accessed July 17, 2019. http://hdl.handle.net/1911/88381.

MLA Handbook (7^{th} Edition):

Wang, Guohui. “Design Space Exploration of Parallel Algorithms and Architectures for Wireless Communication and Mobile Computing Systems.” 2014. Web. 17 Jul 2019.

Vancouver:

Wang G. Design Space Exploration of Parallel Algorithms and Architectures for Wireless Communication and Mobile Computing Systems. [Internet] [Doctoral dissertation]. Rice University; 2014. [cited 2019 Jul 17]. Available from: http://hdl.handle.net/1911/88381.

Council of Science Editors:

Wang G. Design Space Exploration of Parallel Algorithms and Architectures for Wireless Communication and Mobile Computing Systems. [Doctoral Dissertation]. Rice University; 2014. Available from: http://hdl.handle.net/1911/88381

University of New South Wales

5. Wang, Xubo. Efficiently Computing Exact Set Similarity Joins.

Degree: Computer Science & Engineering, 2018, University of New South Wales

URL: http://handle.unsw.edu.au/1959.4/60433 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:52219/SOURCE02?view=true

► Set similarity join, which finds all the similar set pairs from two collections of sets, is a fundamental problem with a wide range of applications…
(more)

Subjects/Keywords: Parallel Algorithm; Exact Set Similarity Join; Incremental Algorithm

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Wang, X. (2018). Efficiently Computing Exact Set Similarity Joins. (Doctoral Dissertation). University of New South Wales. Retrieved from http://handle.unsw.edu.au/1959.4/60433 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:52219/SOURCE02?view=true

Chicago Manual of Style (16^{th} Edition):

Wang, Xubo. “Efficiently Computing Exact Set Similarity Joins.” 2018. Doctoral Dissertation, University of New South Wales. Accessed July 17, 2019. http://handle.unsw.edu.au/1959.4/60433 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:52219/SOURCE02?view=true.

MLA Handbook (7^{th} Edition):

Wang, Xubo. “Efficiently Computing Exact Set Similarity Joins.” 2018. Web. 17 Jul 2019.

Vancouver:

Wang X. Efficiently Computing Exact Set Similarity Joins. [Internet] [Doctoral dissertation]. University of New South Wales; 2018. [cited 2019 Jul 17]. Available from: http://handle.unsw.edu.au/1959.4/60433 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:52219/SOURCE02?view=true.

Council of Science Editors:

Wang X. Efficiently Computing Exact Set Similarity Joins. [Doctoral Dissertation]. University of New South Wales; 2018. Available from: http://handle.unsw.edu.au/1959.4/60433 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:52219/SOURCE02?view=true

Iowa State University

6.
Das, Apurba.
Incremental and *parallel* algorithms for dense subgraph mining.

Degree: 2019, Iowa State University

URL: https://lib.dr.iastate.edu/etd/16997

► The task of maintaining densely connected subgraphs from a continuously evolving graph is important because it solves many practical problems that require constant monitoring over…
(more)

Subjects/Keywords: Graph Mining; Incremental Algorithm; Parallel Algorithm; Computer Engineering

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Das, A. (2019). Incremental and parallel algorithms for dense subgraph mining. (Thesis). Iowa State University. Retrieved from https://lib.dr.iastate.edu/etd/16997

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

Das, Apurba. “Incremental and parallel algorithms for dense subgraph mining.” 2019. Thesis, Iowa State University. Accessed July 17, 2019. https://lib.dr.iastate.edu/etd/16997.

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Das, Apurba. “Incremental and parallel algorithms for dense subgraph mining.” 2019. Web. 17 Jul 2019.

Vancouver:

Das A. Incremental and parallel algorithms for dense subgraph mining. [Internet] [Thesis]. Iowa State University; 2019. [cited 2019 Jul 17]. Available from: https://lib.dr.iastate.edu/etd/16997.

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Das A. Incremental and parallel algorithms for dense subgraph mining. [Thesis]. Iowa State University; 2019. Available from: https://lib.dr.iastate.edu/etd/16997

Not specified: Masters Thesis or Doctoral Dissertation

KTH

7. Hedenström, Felix. Trial Division : Improvements and Implementations.

Degree: Computer Science and Communication (CSC), 2017, KTH

URL: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-211090

►

Trial division is possibly the simplest *algorithm* for factoring numbers.The problem with Trial division is that it is slow and wastes computationaltime on unnecessary…
(more)

Subjects/Keywords: Trial Division Prime factorization Parallel sequential algorithm parallel algorithms; Computer Engineering; Datorteknik

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Hedenström, F. (2017). Trial Division : Improvements and Implementations. (Thesis). KTH. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-211090

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Hedenström, Felix. “Trial Division : Improvements and Implementations.” 2017. Thesis, KTH. Accessed July 17, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-211090.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Hedenström, Felix. “Trial Division : Improvements and Implementations.” 2017. Web. 17 Jul 2019.

Vancouver:

Hedenström F. Trial Division : Improvements and Implementations. [Internet] [Thesis]. KTH; 2017. [cited 2019 Jul 17]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-211090.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Hedenström F. Trial Division : Improvements and Implementations. [Thesis]. KTH; 2017. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-211090

Not specified: Masters Thesis or Doctoral Dissertation

University of Southern California

8. Xia, Yinglong. Exploration of parallelism for probabilistic graphical models.

Degree: PhD, Computer Science, 2010, University of Southern California

URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/420474/rec/2645

► Probabilistic graphical models such as Bayesian networks and junction trees are widely used to compactly represent joint probability distributions. They have found applications in a…
(more)

Subjects/Keywords: parallel computing; parallel algorithm; probabilistic graphical model; exact inference; multicore processor; scheduler

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Xia, Y. (2010). Exploration of parallelism for probabilistic graphical models. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/420474/rec/2645

Chicago Manual of Style (16^{th} Edition):

Xia, Yinglong. “Exploration of parallelism for probabilistic graphical models.” 2010. Doctoral Dissertation, University of Southern California. Accessed July 17, 2019. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/420474/rec/2645.

MLA Handbook (7^{th} Edition):

Xia, Yinglong. “Exploration of parallelism for probabilistic graphical models.” 2010. Web. 17 Jul 2019.

Vancouver:

Xia Y. Exploration of parallelism for probabilistic graphical models. [Internet] [Doctoral dissertation]. University of Southern California; 2010. [cited 2019 Jul 17]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/420474/rec/2645.

Council of Science Editors:

Xia Y. Exploration of parallelism for probabilistic graphical models. [Doctoral Dissertation]. University of Southern California; 2010. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/420474/rec/2645

Texas State University – San Marcos

9.
Jaiganesh, Jayadharini.
An Efficient Connected Components *Algorithm* for Massively-*Parallel* Devices.

Degree: MS, Computer Science, 2017, Texas State University – San Marcos

URL: https://digital.library.txstate.edu/handle/10877/6570

► Massively-*parallel* devices such as GPUs are best suited for accelerating regular algorithms. Since the memory access patterns and control flow of irregular algorithms are data…
(more)

Subjects/Keywords: GPU; Connected Components; Irregular algorithm; Parallel Processing; Computer science; Parallel processing (Electronic computers)

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Jaiganesh, J. (2017). An Efficient Connected Components Algorithm for Massively-Parallel Devices. (Masters Thesis). Texas State University – San Marcos. Retrieved from https://digital.library.txstate.edu/handle/10877/6570

Chicago Manual of Style (16^{th} Edition):

Jaiganesh, Jayadharini. “An Efficient Connected Components Algorithm for Massively-Parallel Devices.” 2017. Masters Thesis, Texas State University – San Marcos. Accessed July 17, 2019. https://digital.library.txstate.edu/handle/10877/6570.

MLA Handbook (7^{th} Edition):

Jaiganesh, Jayadharini. “An Efficient Connected Components Algorithm for Massively-Parallel Devices.” 2017. Web. 17 Jul 2019.

Vancouver:

Jaiganesh J. An Efficient Connected Components Algorithm for Massively-Parallel Devices. [Internet] [Masters thesis]. Texas State University – San Marcos; 2017. [cited 2019 Jul 17]. Available from: https://digital.library.txstate.edu/handle/10877/6570.

Council of Science Editors:

Jaiganesh J. An Efficient Connected Components Algorithm for Massively-Parallel Devices. [Masters Thesis]. Texas State University – San Marcos; 2017. Available from: https://digital.library.txstate.edu/handle/10877/6570

Georgia Tech

10. Kang, Seunghwa. On the design of architecture-aware algorithms for emerging applications.

Degree: PhD, Electrical and Computer Engineering, 2011, Georgia Tech

URL: http://hdl.handle.net/1853/39503

► This dissertation maps various kernels and applications to a spectrum of programming models and architectures and also presents architecture-aware algorithms for different systems. The kernels…
(more)

Subjects/Keywords: MapReduce; Nested parallelism; Parallel algorithm; Algorithm engineering; Performance tuning; GPU; Transactional memory; Algorithms; Parallel algorithms; Multiprocessors

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kang, S. (2011). On the design of architecture-aware algorithms for emerging applications. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/39503

Chicago Manual of Style (16^{th} Edition):

Kang, Seunghwa. “On the design of architecture-aware algorithms for emerging applications.” 2011. Doctoral Dissertation, Georgia Tech. Accessed July 17, 2019. http://hdl.handle.net/1853/39503.

MLA Handbook (7^{th} Edition):

Kang, Seunghwa. “On the design of architecture-aware algorithms for emerging applications.” 2011. Web. 17 Jul 2019.

Vancouver:

Kang S. On the design of architecture-aware algorithms for emerging applications. [Internet] [Doctoral dissertation]. Georgia Tech; 2011. [cited 2019 Jul 17]. Available from: http://hdl.handle.net/1853/39503.

Council of Science Editors:

Kang S. On the design of architecture-aware algorithms for emerging applications. [Doctoral Dissertation]. Georgia Tech; 2011. Available from: http://hdl.handle.net/1853/39503

University of Iowa

11.
Deng, Junjun.
* Parallel* computing techniques for computed tomography.

Degree: PhD, Applied Mathematical and Computational Sciences, 2011, University of Iowa

URL: https://ir.uiowa.edu/etd/945

► X-ray computed tomography is a widely adopted medical imaging method that uses projections to recover the internal image of a *subject*. Since the invention…
(more)

Subjects/Keywords: Computed Tomography; Katsevich Algorithm; Local Iterative Algorithm; Parallel Computing; SIMD; Applied Mathematics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Deng, J. (2011). Parallel computing techniques for computed tomography. (Doctoral Dissertation). University of Iowa. Retrieved from https://ir.uiowa.edu/etd/945

Chicago Manual of Style (16^{th} Edition):

Deng, Junjun. “Parallel computing techniques for computed tomography.” 2011. Doctoral Dissertation, University of Iowa. Accessed July 17, 2019. https://ir.uiowa.edu/etd/945.

MLA Handbook (7^{th} Edition):

Deng, Junjun. “Parallel computing techniques for computed tomography.” 2011. Web. 17 Jul 2019.

Vancouver:

Deng J. Parallel computing techniques for computed tomography. [Internet] [Doctoral dissertation]. University of Iowa; 2011. [cited 2019 Jul 17]. Available from: https://ir.uiowa.edu/etd/945.

Council of Science Editors:

Deng J. Parallel computing techniques for computed tomography. [Doctoral Dissertation]. University of Iowa; 2011. Available from: https://ir.uiowa.edu/etd/945

Dalhousie University

12. Cosgaya Lozano, Adan Jose. Engineering Algorithms for Solving Geometric and Graph Problems on Large Data Sets.

Degree: PhD, Faculty of Computer Science, 2011, Dalhousie University

URL: http://hdl.handle.net/10222/13324

► This thesis focuses on the engineering of algorithms for massive data sets. In recent years, massive data sets have become ubiquitous and existing computing applications,…
(more)

Subjects/Keywords: Algorithm Engineering; I/O-efficiency; Parallel skyline; Graph algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Cosgaya Lozano, A. J. (2011). Engineering Algorithms for Solving Geometric and Graph Problems on Large Data Sets. (Doctoral Dissertation). Dalhousie University. Retrieved from http://hdl.handle.net/10222/13324

Chicago Manual of Style (16^{th} Edition):

Cosgaya Lozano, Adan Jose. “Engineering Algorithms for Solving Geometric and Graph Problems on Large Data Sets.” 2011. Doctoral Dissertation, Dalhousie University. Accessed July 17, 2019. http://hdl.handle.net/10222/13324.

MLA Handbook (7^{th} Edition):

Cosgaya Lozano, Adan Jose. “Engineering Algorithms for Solving Geometric and Graph Problems on Large Data Sets.” 2011. Web. 17 Jul 2019.

Vancouver:

Cosgaya Lozano AJ. Engineering Algorithms for Solving Geometric and Graph Problems on Large Data Sets. [Internet] [Doctoral dissertation]. Dalhousie University; 2011. [cited 2019 Jul 17]. Available from: http://hdl.handle.net/10222/13324.

Council of Science Editors:

Cosgaya Lozano AJ. Engineering Algorithms for Solving Geometric and Graph Problems on Large Data Sets. [Doctoral Dissertation]. Dalhousie University; 2011. Available from: http://hdl.handle.net/10222/13324

University of Newcastle Upon Tyne

13. Rapanotti, Lucia. On the synthesis of integral and dynamic recurrences.

Degree: PhD, 1996, University of Newcastle Upon Tyne

URL: http://hdl.handle.net/10443/2162

► Synthesis techniques for regular arrays provide a disciplined and well-founded approach to the design of classes of *parallel* algorithms. The design process is guided by…
(more)

Subjects/Keywords: 005; Parallel processing; Algorithm engineering

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Rapanotti, L. (1996). On the synthesis of integral and dynamic recurrences. (Doctoral Dissertation). University of Newcastle Upon Tyne. Retrieved from http://hdl.handle.net/10443/2162

Chicago Manual of Style (16^{th} Edition):

Rapanotti, Lucia. “On the synthesis of integral and dynamic recurrences.” 1996. Doctoral Dissertation, University of Newcastle Upon Tyne. Accessed July 17, 2019. http://hdl.handle.net/10443/2162.

MLA Handbook (7^{th} Edition):

Rapanotti, Lucia. “On the synthesis of integral and dynamic recurrences.” 1996. Web. 17 Jul 2019.

Vancouver:

Rapanotti L. On the synthesis of integral and dynamic recurrences. [Internet] [Doctoral dissertation]. University of Newcastle Upon Tyne; 1996. [cited 2019 Jul 17]. Available from: http://hdl.handle.net/10443/2162.

Council of Science Editors:

Rapanotti L. On the synthesis of integral and dynamic recurrences. [Doctoral Dissertation]. University of Newcastle Upon Tyne; 1996. Available from: http://hdl.handle.net/10443/2162

Texas A&M University

14. Marsy, Vincent S. Dynamic Load Balancing in a Geophysics Application Using STAPL.

Degree: 2015, Texas A&M University

URL: http://hdl.handle.net/1969.1/155740

► Seismic wavefront simulation is a common method to understand the composition of earth below the surface, especially for hydrocarbon exploration. One of these simulation methods…
(more)

Subjects/Keywords: parallel programming; seismic simulation; wavefront construction algorithm; load balancing; data redistribution

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Marsy, V. S. (2015). Dynamic Load Balancing in a Geophysics Application Using STAPL. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/155740

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Marsy, Vincent S. “Dynamic Load Balancing in a Geophysics Application Using STAPL.” 2015. Thesis, Texas A&M University. Accessed July 17, 2019. http://hdl.handle.net/1969.1/155740.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Marsy, Vincent S. “Dynamic Load Balancing in a Geophysics Application Using STAPL.” 2015. Web. 17 Jul 2019.

Vancouver:

Marsy VS. Dynamic Load Balancing in a Geophysics Application Using STAPL. [Internet] [Thesis]. Texas A&M University; 2015. [cited 2019 Jul 17]. Available from: http://hdl.handle.net/1969.1/155740.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Marsy VS. Dynamic Load Balancing in a Geophysics Application Using STAPL. [Thesis]. Texas A&M University; 2015. Available from: http://hdl.handle.net/1969.1/155740

Not specified: Masters Thesis or Doctoral Dissertation

Texas A&M University

15. Liu, Yifang. Algorithms for VLSI Circuit Optimization and GPU-Based Parallelization.

Degree: 2010, Texas A&M University

URL: http://hdl.handle.net/1969.1/ETD-TAMU-2010-05-7770

► This research addresses some critical challenges in various problems of VLSI design automation, including sophisticated solution search on DAG topology, simultaneous multi-stage design optimization, optimization…
(more)

Subjects/Keywords: Optimization; Algorithm; Parallel Computing; VLSI Circuit Design; Design Automation

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Liu, Y. (2010). Algorithms for VLSI Circuit Optimization and GPU-Based Parallelization. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2010-05-7770

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Liu, Yifang. “Algorithms for VLSI Circuit Optimization and GPU-Based Parallelization.” 2010. Thesis, Texas A&M University. Accessed July 17, 2019. http://hdl.handle.net/1969.1/ETD-TAMU-2010-05-7770.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Liu, Yifang. “Algorithms for VLSI Circuit Optimization and GPU-Based Parallelization.” 2010. Web. 17 Jul 2019.

Vancouver:

Liu Y. Algorithms for VLSI Circuit Optimization and GPU-Based Parallelization. [Internet] [Thesis]. Texas A&M University; 2010. [cited 2019 Jul 17]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2010-05-7770.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Liu Y. Algorithms for VLSI Circuit Optimization and GPU-Based Parallelization. [Thesis]. Texas A&M University; 2010. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2010-05-7770

Not specified: Masters Thesis or Doctoral Dissertation

Anna University

16. Thamilselvan R. Integration of metaheuristic algorithms for job shop scheduling;.

Degree: Metaheuristic algorithms for job shop scheduling, 2014, Anna University

URL: http://shodhganga.inflibnet.ac.in/handle/10603/24563

►

Scheduling is generally considered to be one of the most significant issues in the planning and operation of a manufacturing system Better scheduling systems have… (more)

Subjects/Keywords: Genetic Algorithm; Metaheuristic algorithms; Parallel Simulated Annealing; Simulated Annealing

Record Details Similar Records

❌

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

APA (6^{th} Edition):

R, T. (2014). Integration of metaheuristic algorithms for job shop scheduling;. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/24563

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

R, Thamilselvan. “Integration of metaheuristic algorithms for job shop scheduling;.” 2014. Thesis, Anna University. Accessed July 17, 2019. http://shodhganga.inflibnet.ac.in/handle/10603/24563.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

R, Thamilselvan. “Integration of metaheuristic algorithms for job shop scheduling;.” 2014. Web. 17 Jul 2019.

Vancouver:

R T. Integration of metaheuristic algorithms for job shop scheduling;. [Internet] [Thesis]. Anna University; 2014. [cited 2019 Jul 17]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/24563.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

R T. Integration of metaheuristic algorithms for job shop scheduling;. [Thesis]. Anna University; 2014. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/24563

Not specified: Masters Thesis or Doctoral Dissertation

University of Guelph

17.
Armstrong, Edward.
An Investigation Of *Parallel* Methods For VLSI Circuit Partitioning
.

Degree: 2013, University of Guelph

URL: https://atrium.lib.uoguelph.ca/xmlui/handle/10214/7722

► Today, VLSI design involves millions of components, the performance of which is sensitive to design time decisions. CAD software – which must be both computationally…
(more)

Subjects/Keywords: VLSI Circuit Partitioning Metaheuristic Parallel Scatter Search Memetic Algorithm

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Armstrong, E. (2013). An Investigation Of Parallel Methods For VLSI Circuit Partitioning . (Thesis). University of Guelph. Retrieved from https://atrium.lib.uoguelph.ca/xmlui/handle/10214/7722

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Armstrong, Edward. “An Investigation Of Parallel Methods For VLSI Circuit Partitioning .” 2013. Thesis, University of Guelph. Accessed July 17, 2019. https://atrium.lib.uoguelph.ca/xmlui/handle/10214/7722.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Armstrong, Edward. “An Investigation Of Parallel Methods For VLSI Circuit Partitioning .” 2013. Web. 17 Jul 2019.

Vancouver:

Armstrong E. An Investigation Of Parallel Methods For VLSI Circuit Partitioning . [Internet] [Thesis]. University of Guelph; 2013. [cited 2019 Jul 17]. Available from: https://atrium.lib.uoguelph.ca/xmlui/handle/10214/7722.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Armstrong E. An Investigation Of Parallel Methods For VLSI Circuit Partitioning . [Thesis]. University of Guelph; 2013. Available from: https://atrium.lib.uoguelph.ca/xmlui/handle/10214/7722

Not specified: Masters Thesis or Doctoral Dissertation

18. Liang, Yuchen. OpenMPBench : An Open-Source Benchmark for Multiprocessor Based Embedded Systems.

Degree: 2010, , School of Computing

URL: http://urn.kb.se/resolve?urn=urn:nbn:se:bth-4556

►

It is a new and open-source benchmark for multiprocessor based embedded system. It comprises a set of *parallel* implementations for seven classical algorithms that…
(more)

Subjects/Keywords: Benchmark; Multiprocessor; Linux Multithread; Parallel Algorithm; Computer Sciences; Datavetenskap (datalogi)

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Liang, Y. (2010). OpenMPBench : An Open-Source Benchmark for Multiprocessor Based Embedded Systems. (Thesis). , School of Computing. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:bth-4556

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Liang, Yuchen. “OpenMPBench : An Open-Source Benchmark for Multiprocessor Based Embedded Systems.” 2010. Thesis, , School of Computing. Accessed July 17, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-4556.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Liang, Yuchen. “OpenMPBench : An Open-Source Benchmark for Multiprocessor Based Embedded Systems.” 2010. Web. 17 Jul 2019.

Vancouver:

Liang Y. OpenMPBench : An Open-Source Benchmark for Multiprocessor Based Embedded Systems. [Internet] [Thesis]. , School of Computing; 2010. [cited 2019 Jul 17]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:bth-4556.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Liang Y. OpenMPBench : An Open-Source Benchmark for Multiprocessor Based Embedded Systems. [Thesis]. , School of Computing; 2010. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:bth-4556

Not specified: Masters Thesis or Doctoral Dissertation

19.
Skrzypczak, Piotr.
* Parallel* parsing of context-free grammars.

Degree: 2012, , School of Computing

URL: http://urn.kb.se/resolve?urn=urn:nbn:se:bth-2958

► During the last decade increasing interest in *parallel* programming can be observed. It is caused by a tendency of developing microprocessors as a multicore…
(more)

Subjects/Keywords: parallel parsing; CYK algorithm; CUDA; Computer Sciences; Datavetenskap (datalogi)

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Skrzypczak, P. (2012). Parallel parsing of context-free grammars. (Thesis). , School of Computing. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:bth-2958

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Skrzypczak, Piotr. “Parallel parsing of context-free grammars.” 2012. Thesis, , School of Computing. Accessed July 17, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-2958.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Skrzypczak, Piotr. “Parallel parsing of context-free grammars.” 2012. Web. 17 Jul 2019.

Vancouver:

Skrzypczak P. Parallel parsing of context-free grammars. [Internet] [Thesis]. , School of Computing; 2012. [cited 2019 Jul 17]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:bth-2958.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Skrzypczak P. Parallel parsing of context-free grammars. [Thesis]. , School of Computing; 2012. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:bth-2958

Not specified: Masters Thesis or Doctoral Dissertation

NSYSU

20.
Chiou, Yu-Shu.
Application of Particle Swarm Optimization based *Parallel* *Algorithm* and its implementation on MapReduce.

Degree: Master, Electrical Engineering, 2014, NSYSU

URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-1131114-095139

► In this study, we apply a Particle Swarm Optimization based *Parallel* *Algorithm* ( PSOPA ) to deal with the problem of lighting control management for…
(more)

Subjects/Keywords: Lighting control; Hadoop; MapReduce; Cloud Computing; Particle Swarm Optimization; Parallel Algorithm

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Chiou, Y. (2014). Application of Particle Swarm Optimization based Parallel Algorithm and its implementation on MapReduce. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-1131114-095139

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Chiou, Yu-Shu. “Application of Particle Swarm Optimization based Parallel Algorithm and its implementation on MapReduce.” 2014. Thesis, NSYSU. Accessed July 17, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-1131114-095139.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Chiou, Yu-Shu. “Application of Particle Swarm Optimization based Parallel Algorithm and its implementation on MapReduce.” 2014. Web. 17 Jul 2019.

Vancouver:

Chiou Y. Application of Particle Swarm Optimization based Parallel Algorithm and its implementation on MapReduce. [Internet] [Thesis]. NSYSU; 2014. [cited 2019 Jul 17]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-1131114-095139.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Chiou Y. Application of Particle Swarm Optimization based Parallel Algorithm and its implementation on MapReduce. [Thesis]. NSYSU; 2014. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-1131114-095139

Not specified: Masters Thesis or Doctoral Dissertation

Georgia State University

21.
Puri, Satish.
Efficient *Parallel* and Distributed Algorithms for GIS Polygon Overlay Processing.

Degree: PhD, Computer Science, 2015, Georgia State University

URL: https://scholarworks.gsu.edu/cs_diss/98

► Polygon clipping is one of the complex operations in computational geometry. It is used in Geographic Information Systems (GIS), Computer Graphics, and VLSI CAD.…
(more)

Subjects/Keywords: Polygon Clipping; Polygon Overlay; Computational Geometry; Parallel Algorithm; MPI; MapReduce

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Puri, S. (2015). Efficient Parallel and Distributed Algorithms for GIS Polygon Overlay Processing. (Doctoral Dissertation). Georgia State University. Retrieved from https://scholarworks.gsu.edu/cs_diss/98

Chicago Manual of Style (16^{th} Edition):

Puri, Satish. “Efficient Parallel and Distributed Algorithms for GIS Polygon Overlay Processing.” 2015. Doctoral Dissertation, Georgia State University. Accessed July 17, 2019. https://scholarworks.gsu.edu/cs_diss/98.

MLA Handbook (7^{th} Edition):

Puri, Satish. “Efficient Parallel and Distributed Algorithms for GIS Polygon Overlay Processing.” 2015. Web. 17 Jul 2019.

Vancouver:

Puri S. Efficient Parallel and Distributed Algorithms for GIS Polygon Overlay Processing. [Internet] [Doctoral dissertation]. Georgia State University; 2015. [cited 2019 Jul 17]. Available from: https://scholarworks.gsu.edu/cs_diss/98.

Council of Science Editors:

Puri S. Efficient Parallel and Distributed Algorithms for GIS Polygon Overlay Processing. [Doctoral Dissertation]. Georgia State University; 2015. Available from: https://scholarworks.gsu.edu/cs_diss/98

Michigan Technological University

22.
Hu, Linjia.
MASSIVELY *PARALLEL* ALGORITHMS FOR POINT CLOUD BASED OBJECT RECOGNITION ON HETEROGENEOUS ARCHITECTURE.

Degree: PhD, Department of Computer Science, 2017, Michigan Technological University

URL: http://digitalcommons.mtu.edu/etdr/508

► With the advent of new commodity depth sensors, point cloud data processing plays an increasingly important role in object recognition and perception. However, the…
(more)

Subjects/Keywords: Massively parallel algorithm; object recognition; heterogeneous architecture; Computer Sciences

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Hu, L. (2017). MASSIVELY PARALLEL ALGORITHMS FOR POINT CLOUD BASED OBJECT RECOGNITION ON HETEROGENEOUS ARCHITECTURE. (Doctoral Dissertation). Michigan Technological University. Retrieved from http://digitalcommons.mtu.edu/etdr/508

Chicago Manual of Style (16^{th} Edition):

Hu, Linjia. “MASSIVELY PARALLEL ALGORITHMS FOR POINT CLOUD BASED OBJECT RECOGNITION ON HETEROGENEOUS ARCHITECTURE.” 2017. Doctoral Dissertation, Michigan Technological University. Accessed July 17, 2019. http://digitalcommons.mtu.edu/etdr/508.

MLA Handbook (7^{th} Edition):

Hu, Linjia. “MASSIVELY PARALLEL ALGORITHMS FOR POINT CLOUD BASED OBJECT RECOGNITION ON HETEROGENEOUS ARCHITECTURE.” 2017. Web. 17 Jul 2019.

Vancouver:

Hu L. MASSIVELY PARALLEL ALGORITHMS FOR POINT CLOUD BASED OBJECT RECOGNITION ON HETEROGENEOUS ARCHITECTURE. [Internet] [Doctoral dissertation]. Michigan Technological University; 2017. [cited 2019 Jul 17]. Available from: http://digitalcommons.mtu.edu/etdr/508.

Council of Science Editors:

Hu L. MASSIVELY PARALLEL ALGORITHMS FOR POINT CLOUD BASED OBJECT RECOGNITION ON HETEROGENEOUS ARCHITECTURE. [Doctoral Dissertation]. Michigan Technological University; 2017. Available from: http://digitalcommons.mtu.edu/etdr/508

Clemson University

23.
Nemati, Behzad.
A NEW METAHEURISTIC *ALGORITHM* MOTIVATED BY THE ROOTING PHENOMENA IN PLANTS.

Degree: MS, Industrial Engineering, 2012, Clemson University

URL: https://tigerprints.clemson.edu/all_theses/1206

► In this thesis, we present a new metaheuristic *algorithm* for analyzing challenging optimization problems. Initial testing reveals the potential for the *algorithm*, which is…
(more)

Subjects/Keywords: Algorithm; High throughput computing; Metaheuristic; Optimization; Parallel computing; Scheduling; Industrial Engineering

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Nemati, B. (2012). A NEW METAHEURISTIC ALGORITHM MOTIVATED BY THE ROOTING PHENOMENA IN PLANTS. (Masters Thesis). Clemson University. Retrieved from https://tigerprints.clemson.edu/all_theses/1206

Chicago Manual of Style (16^{th} Edition):

Nemati, Behzad. “A NEW METAHEURISTIC ALGORITHM MOTIVATED BY THE ROOTING PHENOMENA IN PLANTS.” 2012. Masters Thesis, Clemson University. Accessed July 17, 2019. https://tigerprints.clemson.edu/all_theses/1206.

MLA Handbook (7^{th} Edition):

Nemati, Behzad. “A NEW METAHEURISTIC ALGORITHM MOTIVATED BY THE ROOTING PHENOMENA IN PLANTS.” 2012. Web. 17 Jul 2019.

Vancouver:

Nemati B. A NEW METAHEURISTIC ALGORITHM MOTIVATED BY THE ROOTING PHENOMENA IN PLANTS. [Internet] [Masters thesis]. Clemson University; 2012. [cited 2019 Jul 17]. Available from: https://tigerprints.clemson.edu/all_theses/1206.

Council of Science Editors:

Nemati B. A NEW METAHEURISTIC ALGORITHM MOTIVATED BY THE ROOTING PHENOMENA IN PLANTS. [Masters Thesis]. Clemson University; 2012. Available from: https://tigerprints.clemson.edu/all_theses/1206

Clemson University

24.
Chahal, Dheeraj.
Automated, *Parallel* Optimization Algorithms for Stochastic Functions.

Degree: PhD, Computer Science, 2011, Clemson University

URL: https://tigerprints.clemson.edu/all_dissertations/706

► The optimization algorithms for stochastic functions are desired specifically for real-world and simulation applications where results are obtained from sampling, and contain experimental error or…
(more)

Subjects/Keywords: Algorithm; Automated; Optimization; Parallel; Simplex; Stochastic; Computer Sciences

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Chahal, D. (2011). Automated, Parallel Optimization Algorithms for Stochastic Functions. (Doctoral Dissertation). Clemson University. Retrieved from https://tigerprints.clemson.edu/all_dissertations/706

Chicago Manual of Style (16^{th} Edition):

Chahal, Dheeraj. “Automated, Parallel Optimization Algorithms for Stochastic Functions.” 2011. Doctoral Dissertation, Clemson University. Accessed July 17, 2019. https://tigerprints.clemson.edu/all_dissertations/706.

MLA Handbook (7^{th} Edition):

Chahal, Dheeraj. “Automated, Parallel Optimization Algorithms for Stochastic Functions.” 2011. Web. 17 Jul 2019.

Vancouver:

Chahal D. Automated, Parallel Optimization Algorithms for Stochastic Functions. [Internet] [Doctoral dissertation]. Clemson University; 2011. [cited 2019 Jul 17]. Available from: https://tigerprints.clemson.edu/all_dissertations/706.

Council of Science Editors:

Chahal D. Automated, Parallel Optimization Algorithms for Stochastic Functions. [Doctoral Dissertation]. Clemson University; 2011. Available from: https://tigerprints.clemson.edu/all_dissertations/706

Virginia Tech

25. Qu, Shaohong. High Performance Algorithms for Structural Analysis of Grid Stiffened Panels.

Degree: MS, Computer Science, 1997, Virginia Tech

URL: http://hdl.handle.net/10919/36990

► In this research, we apply modern high performance computing techniques to solve an engineering problem, structural analysis of grid stiffened panels. An existing engineering code,…
(more)

Subjects/Keywords: algorithm; parallel; ARPACK; ScaLAPACK

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Qu, S. (1997). High Performance Algorithms for Structural Analysis of Grid Stiffened Panels. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/36990

Chicago Manual of Style (16^{th} Edition):

Qu, Shaohong. “High Performance Algorithms for Structural Analysis of Grid Stiffened Panels.” 1997. Masters Thesis, Virginia Tech. Accessed July 17, 2019. http://hdl.handle.net/10919/36990.

MLA Handbook (7^{th} Edition):

Qu, Shaohong. “High Performance Algorithms for Structural Analysis of Grid Stiffened Panels.” 1997. Web. 17 Jul 2019.

Vancouver:

Qu S. High Performance Algorithms for Structural Analysis of Grid Stiffened Panels. [Internet] [Masters thesis]. Virginia Tech; 1997. [cited 2019 Jul 17]. Available from: http://hdl.handle.net/10919/36990.

Council of Science Editors:

Qu S. High Performance Algorithms for Structural Analysis of Grid Stiffened Panels. [Masters Thesis]. Virginia Tech; 1997. Available from: http://hdl.handle.net/10919/36990

Virginia Tech

26.
Arifuzzaman, S M.
* Parallel* Mining and Analysis of Triangles and Communities in Big Networks.

Degree: PhD, Computer Science, 2016, Virginia Tech

URL: http://hdl.handle.net/10919/72281

► A network (graph) is a powerful abstraction for interactions among entities in a system. Examples include various social, biological, collaboration, citation, and co-purchase networks. Real-world…
(more)

Subjects/Keywords: Network Mining; Parallel Algorithm; Triangle Counting; Community Detection; Big Data

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Arifuzzaman, S. M. (2016). Parallel Mining and Analysis of Triangles and Communities in Big Networks. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/72281

Chicago Manual of Style (16^{th} Edition):

Arifuzzaman, S M. “Parallel Mining and Analysis of Triangles and Communities in Big Networks.” 2016. Doctoral Dissertation, Virginia Tech. Accessed July 17, 2019. http://hdl.handle.net/10919/72281.

MLA Handbook (7^{th} Edition):

Arifuzzaman, S M. “Parallel Mining and Analysis of Triangles and Communities in Big Networks.” 2016. Web. 17 Jul 2019.

Vancouver:

Arifuzzaman SM. Parallel Mining and Analysis of Triangles and Communities in Big Networks. [Internet] [Doctoral dissertation]. Virginia Tech; 2016. [cited 2019 Jul 17]. Available from: http://hdl.handle.net/10919/72281.

Council of Science Editors:

Arifuzzaman SM. Parallel Mining and Analysis of Triangles and Communities in Big Networks. [Doctoral Dissertation]. Virginia Tech; 2016. Available from: http://hdl.handle.net/10919/72281

Kaunas University of Technology

27. Neverauskas, Aurimas. Lygčių ir nelygybių simbolinio sprendimo lygiagretusis metodas.

Degree: Master, Informatics Engineering, 2011, Kaunas University of Technology

URL: http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2011~D_20110831_140404-69461 ;

►

Pateiktas lygčių ir nelygybių simbolinio sprendimo lygiagretus algoritmas ir jo analizė, palyginimas su neefektyvia algoritmo realizacija. Atliktas įgyvendinto algoritmo tyrimas, nustatant jo spartos priklausomybes nuo… (more)

Subjects/Keywords: Lygiagretumas; Algoritmas; Lygtys; Nelygybės; Algebra; Parallel; Algorithm; Equation; Inequality; Algebra

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Neverauskas, Aurimas. (2011). Lygčių ir nelygybių simbolinio sprendimo lygiagretusis metodas. (Masters Thesis). Kaunas University of Technology. Retrieved from http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2011~D_20110831_140404-69461 ;

Note: this citation may be lacking information needed for this citation format:

Author name may be incomplete

Chicago Manual of Style (16^{th} Edition):

Neverauskas, Aurimas. “Lygčių ir nelygybių simbolinio sprendimo lygiagretusis metodas.” 2011. Masters Thesis, Kaunas University of Technology. Accessed July 17, 2019. http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2011~D_20110831_140404-69461 ;.

Note: this citation may be lacking information needed for this citation format:

Author name may be incomplete

MLA Handbook (7^{th} Edition):

Neverauskas, Aurimas. “Lygčių ir nelygybių simbolinio sprendimo lygiagretusis metodas.” 2011. Web. 17 Jul 2019.

Note: this citation may be lacking information needed for this citation format:

Author name may be incomplete

Vancouver:

Neverauskas, Aurimas. Lygčių ir nelygybių simbolinio sprendimo lygiagretusis metodas. [Internet] [Masters thesis]. Kaunas University of Technology; 2011. [cited 2019 Jul 17]. Available from: http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2011~D_20110831_140404-69461 ;.

Author name may be incomplete

Council of Science Editors:

Neverauskas, Aurimas. Lygčių ir nelygybių simbolinio sprendimo lygiagretusis metodas. [Masters Thesis]. Kaunas University of Technology; 2011. Available from: http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2011~D_20110831_140404-69461 ;

Author name may be incomplete

28.
Aldasoro Marcellan, Unai.
On *parallel* computing for stochastic optimization models and algorithms
.

Degree: 2015, Euskal Herriko Unibertsitatea / Universidad del País Vasco

URL: http://hdl.handle.net/10810/14315

► Esta tesis tiene como objetivo principal la resolución de problemas de optimización bajo incertidumbre a gran escala, mediante la interconexión entre las disciplinas de Optimización…
(more)

Subjects/Keywords: applied mathematics; operations research; stochastic optimization; parallel computing; decomposition algorithm

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Aldasoro Marcellan, U. (2015). On parallel computing for stochastic optimization models and algorithms . (Doctoral Dissertation). Euskal Herriko Unibertsitatea / Universidad del País Vasco. Retrieved from http://hdl.handle.net/10810/14315

Chicago Manual of Style (16^{th} Edition):

Aldasoro Marcellan, Unai. “On parallel computing for stochastic optimization models and algorithms .” 2015. Doctoral Dissertation, Euskal Herriko Unibertsitatea / Universidad del País Vasco. Accessed July 17, 2019. http://hdl.handle.net/10810/14315.

MLA Handbook (7^{th} Edition):

Aldasoro Marcellan, Unai. “On parallel computing for stochastic optimization models and algorithms .” 2015. Web. 17 Jul 2019.

Vancouver:

Aldasoro Marcellan U. On parallel computing for stochastic optimization models and algorithms . [Internet] [Doctoral dissertation]. Euskal Herriko Unibertsitatea / Universidad del País Vasco; 2015. [cited 2019 Jul 17]. Available from: http://hdl.handle.net/10810/14315.

Council of Science Editors:

Aldasoro Marcellan U. On parallel computing for stochastic optimization models and algorithms . [Doctoral Dissertation]. Euskal Herriko Unibertsitatea / Universidad del País Vasco; 2015. Available from: http://hdl.handle.net/10810/14315

Delft University of Technology

29. Van Wijnen, P.A. Feasibilty Analysis for Hardware Acceleration of Pattern Recognition Algorithms:.

Degree: 2009, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:e8756f82-ebde-4e0f-aa09-ab2445b962ad

► This thesis presents a feasibility analysis for hardware acceleration of the pattern recognition algorithms used by the Media Knowledge Engineering department at the Delft University…
(more)

Subjects/Keywords: Hardware Accelerator; Pattern Recognition Algorithm; FPGA; Parallel Computing

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Van Wijnen, P. A. (2009). Feasibilty Analysis for Hardware Acceleration of Pattern Recognition Algorithms:. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:e8756f82-ebde-4e0f-aa09-ab2445b962ad

Chicago Manual of Style (16^{th} Edition):

Van Wijnen, P A. “Feasibilty Analysis for Hardware Acceleration of Pattern Recognition Algorithms:.” 2009. Masters Thesis, Delft University of Technology. Accessed July 17, 2019. http://resolver.tudelft.nl/uuid:e8756f82-ebde-4e0f-aa09-ab2445b962ad.

MLA Handbook (7^{th} Edition):

Van Wijnen, P A. “Feasibilty Analysis for Hardware Acceleration of Pattern Recognition Algorithms:.” 2009. Web. 17 Jul 2019.

Vancouver:

Van Wijnen PA. Feasibilty Analysis for Hardware Acceleration of Pattern Recognition Algorithms:. [Internet] [Masters thesis]. Delft University of Technology; 2009. [cited 2019 Jul 17]. Available from: http://resolver.tudelft.nl/uuid:e8756f82-ebde-4e0f-aa09-ab2445b962ad.

Council of Science Editors:

Van Wijnen PA. Feasibilty Analysis for Hardware Acceleration of Pattern Recognition Algorithms:. [Masters Thesis]. Delft University of Technology; 2009. Available from: http://resolver.tudelft.nl/uuid:e8756f82-ebde-4e0f-aa09-ab2445b962ad

Queens University

30. Roth, Jonathan. Performance Optimization and Parallelization of Turbo Decoding for Software-Defined Radio .

Degree: Electrical & Computer Engineering, 2009, Queens University

URL: http://hdl.handle.net/1974/5226

► Research indicates that multiprocessor-based architectures will provide a flexible alternative to hard-wired application-specific integrated circuits (ASICs) suitable to implement the multitude of wireless standards required…
(more)

Subjects/Keywords: parallel algorithm; turbo decoder; software-defined radio; hardware simulation

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Roth, J. (2009). Performance Optimization and Parallelization of Turbo Decoding for Software-Defined Radio . (Thesis). Queens University. Retrieved from http://hdl.handle.net/1974/5226

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Roth, Jonathan. “Performance Optimization and Parallelization of Turbo Decoding for Software-Defined Radio .” 2009. Thesis, Queens University. Accessed July 17, 2019. http://hdl.handle.net/1974/5226.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Roth, Jonathan. “Performance Optimization and Parallelization of Turbo Decoding for Software-Defined Radio .” 2009. Web. 17 Jul 2019.

Vancouver:

Roth J. Performance Optimization and Parallelization of Turbo Decoding for Software-Defined Radio . [Internet] [Thesis]. Queens University; 2009. [cited 2019 Jul 17]. Available from: http://hdl.handle.net/1974/5226.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Roth J. Performance Optimization and Parallelization of Turbo Decoding for Software-Defined Radio . [Thesis]. Queens University; 2009. Available from: http://hdl.handle.net/1974/5226

Not specified: Masters Thesis or Doctoral Dissertation