Advanced search options

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

You searched for `subject:(Partitioning algorithms)`

.
Showing records 1 – 30 of
53 total matches.

▼ Search Limiters

University of Cincinnati

1.
MUPPIDI, SRINIVAS REDDY.
GENETIC *ALGORITHMS* FOR MULTI-OBJECTIVE * PARTITIONING*.

Degree: MS, Engineering : Computer Engineering, 2004, University of Cincinnati

URL: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1080827924

► Circuit *partitioning* is the process of dividing up a large circuit netlist into a set of smaller net lists while maintaining the design integrity. With…
(more)

Subjects/Keywords: Genetic Algorithms; Partitioning

Record Details Similar Records

❌

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

APA (6^{th} Edition):

MUPPIDI, S. R. (2004). GENETIC ALGORITHMS FOR MULTI-OBJECTIVE PARTITIONING. (Masters Thesis). University of Cincinnati. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=ucin1080827924

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

MUPPIDI, SRINIVAS REDDY. “GENETIC ALGORITHMS FOR MULTI-OBJECTIVE PARTITIONING.” 2004. Masters Thesis, University of Cincinnati. Accessed October 23, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1080827924.

MLA Handbook (7^{th} Edition):

MUPPIDI, SRINIVAS REDDY. “GENETIC ALGORITHMS FOR MULTI-OBJECTIVE PARTITIONING.” 2004. Web. 23 Oct 2020.

Vancouver:

MUPPIDI SR. GENETIC ALGORITHMS FOR MULTI-OBJECTIVE PARTITIONING. [Internet] [Masters thesis]. University of Cincinnati; 2004. [cited 2020 Oct 23]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1080827924.

Council of Science Editors:

MUPPIDI SR. GENETIC ALGORITHMS FOR MULTI-OBJECTIVE PARTITIONING. [Masters Thesis]. University of Cincinnati; 2004. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1080827924

2.
Sachdeva, Sushant.
New Results in the Theory of Approximation: Fast Graph *Algorithms* and Inapproximability
.

Degree: PhD, 2013, Princeton University

URL: http://arks.princeton.edu/ark:/88435/dsp01rn301150n

► For several basic optimization problems, it is NP-hard to find an exact solution. As a result, understanding the best possible trade-off between the running time…
(more)

Subjects/Keywords: Algorithms; Approximation; Exponential; Graph Partitioning; Hardness

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Sachdeva, S. (2013). New Results in the Theory of Approximation: Fast Graph Algorithms and Inapproximability . (Doctoral Dissertation). Princeton University. Retrieved from http://arks.princeton.edu/ark:/88435/dsp01rn301150n

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

Sachdeva, Sushant. “New Results in the Theory of Approximation: Fast Graph Algorithms and Inapproximability .” 2013. Doctoral Dissertation, Princeton University. Accessed October 23, 2020. http://arks.princeton.edu/ark:/88435/dsp01rn301150n.

MLA Handbook (7^{th} Edition):

Sachdeva, Sushant. “New Results in the Theory of Approximation: Fast Graph Algorithms and Inapproximability .” 2013. Web. 23 Oct 2020.

Vancouver:

Sachdeva S. New Results in the Theory of Approximation: Fast Graph Algorithms and Inapproximability . [Internet] [Doctoral dissertation]. Princeton University; 2013. [cited 2020 Oct 23]. Available from: http://arks.princeton.edu/ark:/88435/dsp01rn301150n.

Council of Science Editors:

Sachdeva S. New Results in the Theory of Approximation: Fast Graph Algorithms and Inapproximability . [Doctoral Dissertation]. Princeton University; 2013. Available from: http://arks.princeton.edu/ark:/88435/dsp01rn301150n

Texas A&M University

3.
Pearce, Roger Allan.
Scalable Parallel *Algorithms* for Massive Scale-free Graphs.

Degree: PhD, Computer Science, 2013, Texas A&M University

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

► Efficiently storing and processing massive graph data sets is a challenging problem as researchers seek to leverage “Big Data” to answer next-generation scientific questions. New…
(more)

Subjects/Keywords: parallel algorithms; graph algorithms; scale-free graphs; graph partitioning

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Pearce, R. A. (2013). Scalable Parallel Algorithms for Massive Scale-free Graphs. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/151937

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

Pearce, Roger Allan. “Scalable Parallel Algorithms for Massive Scale-free Graphs.” 2013. Doctoral Dissertation, Texas A&M University. Accessed October 23, 2020. http://hdl.handle.net/1969.1/151937.

MLA Handbook (7^{th} Edition):

Pearce, Roger Allan. “Scalable Parallel Algorithms for Massive Scale-free Graphs.” 2013. Web. 23 Oct 2020.

Vancouver:

Pearce RA. Scalable Parallel Algorithms for Massive Scale-free Graphs. [Internet] [Doctoral dissertation]. Texas A&M University; 2013. [cited 2020 Oct 23]. Available from: http://hdl.handle.net/1969.1/151937.

Council of Science Editors:

Pearce RA. Scalable Parallel Algorithms for Massive Scale-free Graphs. [Doctoral Dissertation]. Texas A&M University; 2013. Available from: http://hdl.handle.net/1969.1/151937

University of Illinois – Urbana-Champaign

4. Bhatti, Shahzad Fazal. Scalable centralized and distributed spectral clustering.

Degree: PhD, Industrial Engineering, 2018, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/101769

► Spectral clustering approaches have led to well-accepted *algorithms* for finding accurate clusters in a given dataset. However, their application to large-scale datasets has been hindered…
(more)

Subjects/Keywords: Clustering algorithms; community detection; graph partitioning; random walk; distributed algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Bhatti, S. F. (2018). Scalable centralized and distributed spectral clustering. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/101769

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

Bhatti, Shahzad Fazal. “Scalable centralized and distributed spectral clustering.” 2018. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed October 23, 2020. http://hdl.handle.net/2142/101769.

MLA Handbook (7^{th} Edition):

Bhatti, Shahzad Fazal. “Scalable centralized and distributed spectral clustering.” 2018. Web. 23 Oct 2020.

Vancouver:

Bhatti SF. Scalable centralized and distributed spectral clustering. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2018. [cited 2020 Oct 23]. Available from: http://hdl.handle.net/2142/101769.

Council of Science Editors:

Bhatti SF. Scalable centralized and distributed spectral clustering. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2018. Available from: http://hdl.handle.net/2142/101769

Universidade do Rio Grande do Sul

5.
Menegola, Bruno.
A study of the k-way graph *partitioning* problem.

Degree: 2012, Universidade do Rio Grande do Sul

URL: http://hdl.handle.net/10183/67181

►

O problema de particionamento balanceado de grafos consiste em encontrar uma partição de tamanho k dos vértices de um grafo, minimizando o número de arestas… (more)

Subjects/Keywords: Grafos; Graph partitioning; Teoria : Grafos; Heuristics; Metaheuristics; Algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Menegola, B. (2012). A study of the k-way graph partitioning problem. (Thesis). Universidade do Rio Grande do Sul. Retrieved from http://hdl.handle.net/10183/67181

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

Menegola, Bruno. “A study of the k-way graph partitioning problem.” 2012. Thesis, Universidade do Rio Grande do Sul. Accessed October 23, 2020. http://hdl.handle.net/10183/67181.

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Menegola, Bruno. “A study of the k-way graph partitioning problem.” 2012. Web. 23 Oct 2020.

Vancouver:

Menegola B. A study of the k-way graph partitioning problem. [Internet] [Thesis]. Universidade do Rio Grande do Sul; 2012. [cited 2020 Oct 23]. Available from: http://hdl.handle.net/10183/67181.

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

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Menegola B. A study of the k-way graph partitioning problem. [Thesis]. Universidade do Rio Grande do Sul; 2012. Available from: http://hdl.handle.net/10183/67181

Not specified: Masters Thesis or Doctoral Dissertation

University of Georgia

6. Nisar, Muhammad Usman. A comparison of techniques for graph analytics on Big Data.

Degree: 2014, University of Georgia

URL: http://hdl.handle.net/10724/28844

► Graphs enjoy profound importance because of their versatility and expressivity. They can be effectively used to represent social networks, search engines and genome sequencing. The…
(more)

Subjects/Keywords: pattern matching; simulation; graph partitioning; parallel and distributed algorithms; vertex-centric

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Nisar, M. U. (2014). A comparison of techniques for graph analytics on Big Data. (Thesis). University of Georgia. Retrieved from http://hdl.handle.net/10724/28844

Not specified: Masters Thesis or Doctoral Dissertation

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

Nisar, Muhammad Usman. “A comparison of techniques for graph analytics on Big Data.” 2014. Thesis, University of Georgia. Accessed October 23, 2020. http://hdl.handle.net/10724/28844.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Nisar, Muhammad Usman. “A comparison of techniques for graph analytics on Big Data.” 2014. Web. 23 Oct 2020.

Vancouver:

Nisar MU. A comparison of techniques for graph analytics on Big Data. [Internet] [Thesis]. University of Georgia; 2014. [cited 2020 Oct 23]. Available from: http://hdl.handle.net/10724/28844.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Nisar MU. A comparison of techniques for graph analytics on Big Data. [Thesis]. University of Georgia; 2014. Available from: http://hdl.handle.net/10724/28844

Not specified: Masters Thesis or Doctoral Dissertation

University of Houston

7.
Sanati, Behnaz 1973-.
An Efficient Online Benefit-aware Multiprocessor Scheduling Technique for Soft Real-Time Tasks Using Online Choice of Approximation * Algorithms*.

Degree: PhD, Computer Science, 2016, University of Houston

URL: http://hdl.handle.net/10657/5406

► Maximizing the benefit gained by soft real-time tasks in many applications and embedded systems is highly needed to provide an acceptable QoS (Quality of Service).…
(more)

Subjects/Keywords: Real-time systems; Multiprocessor systems; Task Partitioning; Benefit-aware; Approximation algorithms; Quality of service; Online Scheduling; Semi-partitioning

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Sanati, B. 1. (2016). An Efficient Online Benefit-aware Multiprocessor Scheduling Technique for Soft Real-Time Tasks Using Online Choice of Approximation Algorithms. (Doctoral Dissertation). University of Houston. Retrieved from http://hdl.handle.net/10657/5406

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

Sanati, Behnaz 1973-. “An Efficient Online Benefit-aware Multiprocessor Scheduling Technique for Soft Real-Time Tasks Using Online Choice of Approximation Algorithms.” 2016. Doctoral Dissertation, University of Houston. Accessed October 23, 2020. http://hdl.handle.net/10657/5406.

MLA Handbook (7^{th} Edition):

Sanati, Behnaz 1973-. “An Efficient Online Benefit-aware Multiprocessor Scheduling Technique for Soft Real-Time Tasks Using Online Choice of Approximation Algorithms.” 2016. Web. 23 Oct 2020.

Vancouver:

Sanati B1. An Efficient Online Benefit-aware Multiprocessor Scheduling Technique for Soft Real-Time Tasks Using Online Choice of Approximation Algorithms. [Internet] [Doctoral dissertation]. University of Houston; 2016. [cited 2020 Oct 23]. Available from: http://hdl.handle.net/10657/5406.

Council of Science Editors:

Sanati B1. An Efficient Online Benefit-aware Multiprocessor Scheduling Technique for Soft Real-Time Tasks Using Online Choice of Approximation Algorithms. [Doctoral Dissertation]. University of Houston; 2016. Available from: http://hdl.handle.net/10657/5406

Indian Institute of Science

8.
Ghoshdastidar, Debarghya.
Consistency of Spectral *Algorithms* for Hypergraphs under Planted Partition Model.

Degree: PhD, Faculty of Engineering, 2018, Indian Institute of Science

URL: http://etd.iisc.ac.in/handle/2005/2947

► Hypergraph *partitioning* lies at the heart of a number of problems in machine learning as well as other engineering disciplines. While *partitioning* uniform hypergraphs is…
(more)

Subjects/Keywords: Spectral Theory; Uniform Hypergraphs; Tensor Spectral Method; Hypergraph Coloring; Uniform Hypergraph Partitioning; Non-uniform Hypergraphs; Spectral Hypergraph Partitioning; Bipartite Hypergraphs; Planted Partition Model; Hypergraph Partitioning; Hypergraphs; Spectral Algorithms; Computer Science

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Ghoshdastidar, D. (2018). Consistency of Spectral Algorithms for Hypergraphs under Planted Partition Model. (Doctoral Dissertation). Indian Institute of Science. Retrieved from http://etd.iisc.ac.in/handle/2005/2947

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

Ghoshdastidar, Debarghya. “Consistency of Spectral Algorithms for Hypergraphs under Planted Partition Model.” 2018. Doctoral Dissertation, Indian Institute of Science. Accessed October 23, 2020. http://etd.iisc.ac.in/handle/2005/2947.

MLA Handbook (7^{th} Edition):

Ghoshdastidar, Debarghya. “Consistency of Spectral Algorithms for Hypergraphs under Planted Partition Model.” 2018. Web. 23 Oct 2020.

Vancouver:

Ghoshdastidar D. Consistency of Spectral Algorithms for Hypergraphs under Planted Partition Model. [Internet] [Doctoral dissertation]. Indian Institute of Science; 2018. [cited 2020 Oct 23]. Available from: http://etd.iisc.ac.in/handle/2005/2947.

Council of Science Editors:

Ghoshdastidar D. Consistency of Spectral Algorithms for Hypergraphs under Planted Partition Model. [Doctoral Dissertation]. Indian Institute of Science; 2018. Available from: http://etd.iisc.ac.in/handle/2005/2947

University of California – Berkeley

9.
Orecchia, Lorenzo.
Fast Approximation *Algorithms* for Graph *Partitioning* Using Spectral and Semidefinite-Programming Techniques.

Degree: Electrical Engineering & Computer Sciences, 2011, University of California – Berkeley

URL: http://www.escholarship.org/uc/item/2z90d0qn

► Graph *partitioning* problems are a central topic of research in the study of approximation *algorithms*. They are of interest to theoretical computer scientists for their…
(more)

Subjects/Keywords: Computer science; Applied mathematics; Approximation algorithms; Combinatorial optimization; Graph partitioning; Spectral methods

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Orecchia, L. (2011). Fast Approximation Algorithms for Graph Partitioning Using Spectral and Semidefinite-Programming Techniques. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/2z90d0qn

Not specified: Masters Thesis or Doctoral Dissertation

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

Orecchia, Lorenzo. “Fast Approximation Algorithms for Graph Partitioning Using Spectral and Semidefinite-Programming Techniques.” 2011. Thesis, University of California – Berkeley. Accessed October 23, 2020. http://www.escholarship.org/uc/item/2z90d0qn.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Orecchia, Lorenzo. “Fast Approximation Algorithms for Graph Partitioning Using Spectral and Semidefinite-Programming Techniques.” 2011. Web. 23 Oct 2020.

Vancouver:

Orecchia L. Fast Approximation Algorithms for Graph Partitioning Using Spectral and Semidefinite-Programming Techniques. [Internet] [Thesis]. University of California – Berkeley; 2011. [cited 2020 Oct 23]. Available from: http://www.escholarship.org/uc/item/2z90d0qn.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Orecchia L. Fast Approximation Algorithms for Graph Partitioning Using Spectral and Semidefinite-Programming Techniques. [Thesis]. University of California – Berkeley; 2011. Available from: http://www.escholarship.org/uc/item/2z90d0qn

Not specified: Masters Thesis or Doctoral Dissertation

10.
Yuan, Mindi.
Dynamic *partitioning* of social networks.

Degree: MS, 1200, 2013, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/42231

► In this thesis, I study the problem of dynamic *partitioning* of online social networks (OSN). The problem is practically important since it lays the foundation…
(more)

Subjects/Keywords: Social networks; Partitioning; Online algorithms

…With the timedependent *partitioning* *algorithms*, the same message node can reside in
different… …*partitioning* *algorithms*. These are the *algorithms* used in commercial online social networks.
The… …*algorithms* significantly improved data
locality than hash-based *partitioning*.
24
CHAPTER 3… …offline graph *partitioning* *algorithms*, such as [17, 18, 23, 24], are generally
too… …3.2 Related Work
Most of the graph *partitioning* *algorithms* are offline [17, 18, 23, 24…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Yuan, M. (2013). Dynamic partitioning of social networks. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/42231

Not specified: Masters Thesis or Doctoral Dissertation

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

Yuan, Mindi. “Dynamic partitioning of social networks.” 2013. Thesis, University of Illinois – Urbana-Champaign. Accessed October 23, 2020. http://hdl.handle.net/2142/42231.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Yuan, Mindi. “Dynamic partitioning of social networks.” 2013. Web. 23 Oct 2020.

Vancouver:

Yuan M. Dynamic partitioning of social networks. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2013. [cited 2020 Oct 23]. Available from: http://hdl.handle.net/2142/42231.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Yuan M. Dynamic partitioning of social networks. [Thesis]. University of Illinois – Urbana-Champaign; 2013. Available from: http://hdl.handle.net/2142/42231

Not specified: Masters Thesis or Doctoral Dissertation

University of Canterbury

11. Li, Bo. Real-time Simulation and Rendering of Large-scale Crowd Motion.

Degree: MS, Computer Science, 2013, University of Canterbury

URL: http://dx.doi.org/10.26021/8180

► Crowd simulations are attracting increasing attention from both academia and the industry field and are implemented across a vast range of applications, from scientific demonstrations…
(more)

Subjects/Keywords: Crowd simulation; crowd animation; partitioning algorithms; collision detection; subdivision data structures; bounding volumes

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Li, B. (2013). Real-time Simulation and Rendering of Large-scale Crowd Motion. (Masters Thesis). University of Canterbury. Retrieved from http://dx.doi.org/10.26021/8180

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

Li, Bo. “Real-time Simulation and Rendering of Large-scale Crowd Motion.” 2013. Masters Thesis, University of Canterbury. Accessed October 23, 2020. http://dx.doi.org/10.26021/8180.

MLA Handbook (7^{th} Edition):

Li, Bo. “Real-time Simulation and Rendering of Large-scale Crowd Motion.” 2013. Web. 23 Oct 2020.

Vancouver:

Li B. Real-time Simulation and Rendering of Large-scale Crowd Motion. [Internet] [Masters thesis]. University of Canterbury; 2013. [cited 2020 Oct 23]. Available from: http://dx.doi.org/10.26021/8180.

Council of Science Editors:

Li B. Real-time Simulation and Rendering of Large-scale Crowd Motion. [Masters Thesis]. University of Canterbury; 2013. Available from: http://dx.doi.org/10.26021/8180

Virginia Tech

12. Kamal, Tariq. Computational Cost Analysis of Large-Scale Agent-Based Epidemic Simulations.

Degree: PhD, Computer Science and Applications, 2016, Virginia Tech

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

► Agent-based epidemic simulation (ABES) is a powerful and realistic approach for studying the impacts of disease dynamics and complex interventions on the spread of an…
(more)

Subjects/Keywords: Cost Analysis and Estimation; Parallel Algorithms; Graph Partitioning; Computational Epidemiology; Disease Dynamics; Statistical Analysis

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kamal, T. (2016). Computational Cost Analysis of Large-Scale Agent-Based Epidemic Simulations. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/82507

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

Kamal, Tariq. “Computational Cost Analysis of Large-Scale Agent-Based Epidemic Simulations.” 2016. Doctoral Dissertation, Virginia Tech. Accessed October 23, 2020. http://hdl.handle.net/10919/82507.

MLA Handbook (7^{th} Edition):

Kamal, Tariq. “Computational Cost Analysis of Large-Scale Agent-Based Epidemic Simulations.” 2016. Web. 23 Oct 2020.

Vancouver:

Kamal T. Computational Cost Analysis of Large-Scale Agent-Based Epidemic Simulations. [Internet] [Doctoral dissertation]. Virginia Tech; 2016. [cited 2020 Oct 23]. Available from: http://hdl.handle.net/10919/82507.

Council of Science Editors:

Kamal T. Computational Cost Analysis of Large-Scale Agent-Based Epidemic Simulations. [Doctoral Dissertation]. Virginia Tech; 2016. Available from: http://hdl.handle.net/10919/82507

University of Texas – Austin

13. -5112-1839. Lightweight offload engines for worklist management and worklist-directed prefetching.

Degree: PhD, Electrical and Computer Engineering, 2018, University of Texas – Austin

URL: http://hdl.handle.net/2152/68554

► The importance of irregular applications such as graph analytics is rapidly growing with the rise of Big Data. However, parallel graph workloads tend to perform…
(more)

Subjects/Keywords: Computer architecture; Graph algorithms; Parallel processors; Parallel programming; Prefetching; Accelerators; Scheduling; Task partitioning

Record Details Similar Records

❌

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

APA (6^{th} Edition):

-5112-1839. (2018). Lightweight offload engines for worklist management and worklist-directed prefetching. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/68554

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

Author name may be incomplete

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

-5112-1839. “Lightweight offload engines for worklist management and worklist-directed prefetching.” 2018. Doctoral Dissertation, University of Texas – Austin. Accessed October 23, 2020. http://hdl.handle.net/2152/68554.

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

Author name may be incomplete

MLA Handbook (7^{th} Edition):

-5112-1839. “Lightweight offload engines for worklist management and worklist-directed prefetching.” 2018. Web. 23 Oct 2020.

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

Author name may be incomplete

Vancouver:

-5112-1839. Lightweight offload engines for worklist management and worklist-directed prefetching. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2018. [cited 2020 Oct 23]. Available from: http://hdl.handle.net/2152/68554.

Author name may be incomplete

Council of Science Editors:

-5112-1839. Lightweight offload engines for worklist management and worklist-directed prefetching. [Doctoral Dissertation]. University of Texas – Austin; 2018. Available from: http://hdl.handle.net/2152/68554

Author name may be incomplete

IUPUI

14. Seger, Mandi J. Medical Imaging Centers in Central Indiana: Optimal Location Allocation Analyses.

Degree: 2016, IUPUI

URL: http://hdl.handle.net/1805/10860

►

Indiana University-Purdue University Indianapolis (IUPUI)

While optimization techniques have been studied since 300 B.C. when Euclid first considered the minimal distance between a point and… (more)

Subjects/Keywords: Location Allocation; Location Optimization; Medical Imaging; P-Median Model; Maximal Covering Model; Clustering; Partitioning; Geographic Information Science; Healthcare; Optimization Algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Seger, M. J. (2016). Medical Imaging Centers in Central Indiana: Optimal Location Allocation Analyses. (Thesis). IUPUI. Retrieved from http://hdl.handle.net/1805/10860

Not specified: Masters Thesis or Doctoral Dissertation

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

Seger, Mandi J. “Medical Imaging Centers in Central Indiana: Optimal Location Allocation Analyses.” 2016. Thesis, IUPUI. Accessed October 23, 2020. http://hdl.handle.net/1805/10860.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Seger, Mandi J. “Medical Imaging Centers in Central Indiana: Optimal Location Allocation Analyses.” 2016. Web. 23 Oct 2020.

Vancouver:

Seger MJ. Medical Imaging Centers in Central Indiana: Optimal Location Allocation Analyses. [Internet] [Thesis]. IUPUI; 2016. [cited 2020 Oct 23]. Available from: http://hdl.handle.net/1805/10860.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Seger MJ. Medical Imaging Centers in Central Indiana: Optimal Location Allocation Analyses. [Thesis]. IUPUI; 2016. Available from: http://hdl.handle.net/1805/10860

Not specified: Masters Thesis or Doctoral Dissertation

University of Illinois – Urbana-Champaign

15. Liu, Yan. High-performance evolutionary computation for scalable spatial optimization.

Degree: PhD, Informatics, 2017, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/99346

► Spatial optimization (SO) is an important and prolific field of interdisciplinary research. Spatial optimization methods seek optimal allocation or arrangement of spatial units under spatial…
(more)

Subjects/Keywords: Evolutionary algorithms; Spatial optimization; Partitioning; Combinatorial optimization; Heuristics; High-performance computing; Parallel and distributed computing; Redistricting; Election law

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Liu, Y. (2017). High-performance evolutionary computation for scalable spatial optimization. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/99346

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

Liu, Yan. “High-performance evolutionary computation for scalable spatial optimization.” 2017. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed October 23, 2020. http://hdl.handle.net/2142/99346.

MLA Handbook (7^{th} Edition):

Liu, Yan. “High-performance evolutionary computation for scalable spatial optimization.” 2017. Web. 23 Oct 2020.

Vancouver:

Liu Y. High-performance evolutionary computation for scalable spatial optimization. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2017. [cited 2020 Oct 23]. Available from: http://hdl.handle.net/2142/99346.

Council of Science Editors:

Liu Y. High-performance evolutionary computation for scalable spatial optimization. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2017. Available from: http://hdl.handle.net/2142/99346

Texas State University – San Marcos

16. Lindquist, Robert Stephenson. Defragmenting Social Networks.

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

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

► The scale of Online Social Networks, like Facebook, requires splitting users across many servers; unfortunately, this can spread one user's friends across hundreds of servers,…
(more)

Subjects/Keywords: Graph Partitioning; Social Networks; High performance computing; Computer algorithms; Social networks; Big data; Graph theory – Data processing

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Lindquist, R. S. (2017). Defragmenting Social Networks. (Masters Thesis). Texas State University – San Marcos. Retrieved from https://digital.library.txstate.edu/handle/10877/6928

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

Lindquist, Robert Stephenson. “Defragmenting Social Networks.” 2017. Masters Thesis, Texas State University – San Marcos. Accessed October 23, 2020. https://digital.library.txstate.edu/handle/10877/6928.

MLA Handbook (7^{th} Edition):

Lindquist, Robert Stephenson. “Defragmenting Social Networks.” 2017. Web. 23 Oct 2020.

Vancouver:

Lindquist RS. Defragmenting Social Networks. [Internet] [Masters thesis]. Texas State University – San Marcos; 2017. [cited 2020 Oct 23]. Available from: https://digital.library.txstate.edu/handle/10877/6928.

Council of Science Editors:

Lindquist RS. Defragmenting Social Networks. [Masters Thesis]. Texas State University – San Marcos; 2017. Available from: https://digital.library.txstate.edu/handle/10877/6928

17. Mohamed Sidi, Mohamed Ahmed. K-Separator problem : Problème de k-Séparateur.

Degree: Docteur es, Informatique, 2014, Evry, Institut national des télécommunications

URL: http://www.theses.fr/2014TELE0032

►

Considérons un graphe G = (V,E,w) non orienté dont les sommets sont pondérés et un entier k. Le problème à étudier consiste à la construction… (more)

Subjects/Keywords: Couverture par des sommets; Méthode de coupe; Problème de séparateur; Approches polyèdrales; Algorithmes d’approximation; Graph partitioning; Complexity theory; Optimization; Approximation algorithms; Vertex separators; Polyhedral approach; Polynomial-time algorithms; Integer programming

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Mohamed Sidi, M. A. (2014). K-Separator problem : Problème de k-Séparateur. (Doctoral Dissertation). Evry, Institut national des télécommunications. Retrieved from http://www.theses.fr/2014TELE0032

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

Mohamed Sidi, Mohamed Ahmed. “K-Separator problem : Problème de k-Séparateur.” 2014. Doctoral Dissertation, Evry, Institut national des télécommunications. Accessed October 23, 2020. http://www.theses.fr/2014TELE0032.

MLA Handbook (7^{th} Edition):

Mohamed Sidi, Mohamed Ahmed. “K-Separator problem : Problème de k-Séparateur.” 2014. Web. 23 Oct 2020.

Vancouver:

Mohamed Sidi MA. K-Separator problem : Problème de k-Séparateur. [Internet] [Doctoral dissertation]. Evry, Institut national des télécommunications; 2014. [cited 2020 Oct 23]. Available from: http://www.theses.fr/2014TELE0032.

Council of Science Editors:

Mohamed Sidi MA. K-Separator problem : Problème de k-Séparateur. [Doctoral Dissertation]. Evry, Institut national des télécommunications; 2014. Available from: http://www.theses.fr/2014TELE0032

Carnegie Mellon University

18.
Sinop, Ali Kemal.
Graph *Partitioning* and Semi-definite Programming Hierarchies.

Degree: 2012, Carnegie Mellon University

URL: http://repository.cmu.edu/dissertations/145

► Graph *partitioning* is a fundamental optimization problem that has been intensively studied. Many graph *partitioning* formulations are important as building blocks for divide-and-conquer *algorithms* on…
(more)

Subjects/Keywords: approximation algorithms; certificate of infeasibility; column selection; graph partitioning; graph spectrum; Lasserre hierarchy; local rounding; semi-definite programming; strong duality; Computer Sciences

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Sinop, A. K. (2012). Graph Partitioning and Semi-definite Programming Hierarchies. (Thesis). Carnegie Mellon University. Retrieved from http://repository.cmu.edu/dissertations/145

Not specified: Masters Thesis or Doctoral Dissertation

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

Sinop, Ali Kemal. “Graph Partitioning and Semi-definite Programming Hierarchies.” 2012. Thesis, Carnegie Mellon University. Accessed October 23, 2020. http://repository.cmu.edu/dissertations/145.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Sinop, Ali Kemal. “Graph Partitioning and Semi-definite Programming Hierarchies.” 2012. Web. 23 Oct 2020.

Vancouver:

Sinop AK. Graph Partitioning and Semi-definite Programming Hierarchies. [Internet] [Thesis]. Carnegie Mellon University; 2012. [cited 2020 Oct 23]. Available from: http://repository.cmu.edu/dissertations/145.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Sinop AK. Graph Partitioning and Semi-definite Programming Hierarchies. [Thesis]. Carnegie Mellon University; 2012. Available from: http://repository.cmu.edu/dissertations/145

Not specified: Masters Thesis or Doctoral Dissertation

University of North Texas

19. Indrakanti, Saratchandra. Computational Methods for Vulnerability Analysis and Resource Allocation in Public Health Emergencies.

Degree: 2015, University of North Texas

URL: https://digital.library.unt.edu/ark:/67531/metadc804902/

► POD (Point of Dispensing)-based emergency response plans involving mass prophylaxis may seem feasible when considering the choice of dispensing points within a region, overall population…
(more)

Subjects/Keywords: spatial and temporal partitioning; metaheuristics; optimization algorithms; Emergency management – United States – Planning.; Emergency management – United States – Data processing.; Disaster medicine – United States – Planning.; Disaster medicine – United States – Data processing.

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Indrakanti, S. (2015). Computational Methods for Vulnerability Analysis and Resource Allocation in Public Health Emergencies. (Thesis). University of North Texas. Retrieved from https://digital.library.unt.edu/ark:/67531/metadc804902/

Not specified: Masters Thesis or Doctoral Dissertation

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

Indrakanti, Saratchandra. “Computational Methods for Vulnerability Analysis and Resource Allocation in Public Health Emergencies.” 2015. Thesis, University of North Texas. Accessed October 23, 2020. https://digital.library.unt.edu/ark:/67531/metadc804902/.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Indrakanti, Saratchandra. “Computational Methods for Vulnerability Analysis and Resource Allocation in Public Health Emergencies.” 2015. Web. 23 Oct 2020.

Vancouver:

Indrakanti S. Computational Methods for Vulnerability Analysis and Resource Allocation in Public Health Emergencies. [Internet] [Thesis]. University of North Texas; 2015. [cited 2020 Oct 23]. Available from: https://digital.library.unt.edu/ark:/67531/metadc804902/.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Indrakanti S. Computational Methods for Vulnerability Analysis and Resource Allocation in Public Health Emergencies. [Thesis]. University of North Texas; 2015. Available from: https://digital.library.unt.edu/ark:/67531/metadc804902/

Not specified: Masters Thesis or Doctoral Dissertation

20.
Kaya, Oguz.
High Performance Parallel *Algorithms* for Tensor Decompositions : Algorithmes Parallèles pour les Décompositions des Tenseurs.

Degree: Docteur es, Informatique, 2017, Lyon

URL: http://www.theses.fr/2017LYSEN051

► La factorisation des tenseurs est au coeur des méthodes d'analyse des données massives multidimensionnelles dans de nombreux domaines, dont les systèmes de recommandation, les graphes,…
(more)

Subjects/Keywords: Décompositions des tenseurs; Algorithmes parallèles; Partitionnement des hypergraphes; Factorisation des matrices; Arbres de dimension; Tensor decompositions; Parallel algorithms; Hypergraph partitioning; Matrix factorization; Dimension trees

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kaya, O. (2017). High Performance Parallel Algorithms for Tensor Decompositions : Algorithmes Parallèles pour les Décompositions des Tenseurs. (Doctoral Dissertation). Lyon. Retrieved from http://www.theses.fr/2017LYSEN051

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

Kaya, Oguz. “High Performance Parallel Algorithms for Tensor Decompositions : Algorithmes Parallèles pour les Décompositions des Tenseurs.” 2017. Doctoral Dissertation, Lyon. Accessed October 23, 2020. http://www.theses.fr/2017LYSEN051.

MLA Handbook (7^{th} Edition):

Kaya, Oguz. “High Performance Parallel Algorithms for Tensor Decompositions : Algorithmes Parallèles pour les Décompositions des Tenseurs.” 2017. Web. 23 Oct 2020.

Vancouver:

Kaya O. High Performance Parallel Algorithms for Tensor Decompositions : Algorithmes Parallèles pour les Décompositions des Tenseurs. [Internet] [Doctoral dissertation]. Lyon; 2017. [cited 2020 Oct 23]. Available from: http://www.theses.fr/2017LYSEN051.

Council of Science Editors:

Kaya O. High Performance Parallel Algorithms for Tensor Decompositions : Algorithmes Parallèles pour les Décompositions des Tenseurs. [Doctoral Dissertation]. Lyon; 2017. Available from: http://www.theses.fr/2017LYSEN051

University of Florida

21. Wang, Zhe. Thermal-aware Task Scheduling on Multicore Processors.

Degree: PhD, Computer Engineering - Computer and Information Science and Engineering, 2012, University of Florida

URL: https://ufdc.ufl.edu/UFE0044648

► Power and heat density of multicore processor are increasing exponentially with Moore's Law. High temperature negatively affects reliability and the cost of cooling and packaging.…
(more)

Subjects/Keywords: Accident prone locations; Algorithms; Ambient temperature; Deadlines; Electric potential; Energy consumption; Heuristics; Matrices; Scheduling; Workloads; dvfs – management – multicore – partitioning – processor – scheduling – task – thermal

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Wang, Z. (2012). Thermal-aware Task Scheduling on Multicore Processors. (Doctoral Dissertation). University of Florida. Retrieved from https://ufdc.ufl.edu/UFE0044648

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

Wang, Zhe. “Thermal-aware Task Scheduling on Multicore Processors.” 2012. Doctoral Dissertation, University of Florida. Accessed October 23, 2020. https://ufdc.ufl.edu/UFE0044648.

MLA Handbook (7^{th} Edition):

Wang, Zhe. “Thermal-aware Task Scheduling on Multicore Processors.” 2012. Web. 23 Oct 2020.

Vancouver:

Wang Z. Thermal-aware Task Scheduling on Multicore Processors. [Internet] [Doctoral dissertation]. University of Florida; 2012. [cited 2020 Oct 23]. Available from: https://ufdc.ufl.edu/UFE0044648.

Council of Science Editors:

Wang Z. Thermal-aware Task Scheduling on Multicore Processors. [Doctoral Dissertation]. University of Florida; 2012. Available from: https://ufdc.ufl.edu/UFE0044648

22. Vitanza, Alessandra. Methodologies and Tools for the Emergence of Cooperation in Biorobotics.

Degree: 2013, Università degli Studi di Catania

URL: http://hdl.handle.net/10761/1310

► One of the main purposes of the Ph.D. activities was the investigation of the swarm aspects in order to formulate new strategies for the emergence…
(more)

Subjects/Keywords: Area 09 - Ingegneria industriale e dell'informazione; Swarm Intelligence,collaborative algorithms,labor division,swarm robotic applications,task partitioning,bio-robotics,spike-frequency adaptation,STDP learning,robotic framework,dynamic simulator

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Vitanza, A. (2013). Methodologies and Tools for the Emergence of Cooperation in Biorobotics. (Thesis). Università degli Studi di Catania. Retrieved from http://hdl.handle.net/10761/1310

Not specified: Masters Thesis or Doctoral Dissertation

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

Vitanza, Alessandra. “Methodologies and Tools for the Emergence of Cooperation in Biorobotics.” 2013. Thesis, Università degli Studi di Catania. Accessed October 23, 2020. http://hdl.handle.net/10761/1310.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Vitanza, Alessandra. “Methodologies and Tools for the Emergence of Cooperation in Biorobotics.” 2013. Web. 23 Oct 2020.

Vancouver:

Vitanza A. Methodologies and Tools for the Emergence of Cooperation in Biorobotics. [Internet] [Thesis]. Università degli Studi di Catania; 2013. [cited 2020 Oct 23]. Available from: http://hdl.handle.net/10761/1310.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Vitanza A. Methodologies and Tools for the Emergence of Cooperation in Biorobotics. [Thesis]. Università degli Studi di Catania; 2013. Available from: http://hdl.handle.net/10761/1310

Not specified: Masters Thesis or Doctoral Dissertation

Indian Institute of Science

23. Pai, Nithish. A GPU Accelerated Tensor Spectral Method for Subspace Clustering.

Degree: MSc Engg, Faculty of Engineering, 2017, Indian Institute of Science

URL: http://etd.iisc.ac.in/handle/2005/2837

► In this thesis we consider the problem of clustering the data lying in a union of subspaces using spectral methods. Though the data generated may…
(more)

Subjects/Keywords: Subspace Clustering; Tensors Spectral Method; Hypergraphs and Tensors; Uniform Hypergraph Partitioning Algorithm; Tensor Factorization; Spectral Clustering based Algorithms; GPU Accelerated Algorithm; GPU Computing; Computer Science

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Pai, N. (2017). A GPU Accelerated Tensor Spectral Method for Subspace Clustering. (Masters Thesis). Indian Institute of Science. Retrieved from http://etd.iisc.ac.in/handle/2005/2837

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

Pai, Nithish. “A GPU Accelerated Tensor Spectral Method for Subspace Clustering.” 2017. Masters Thesis, Indian Institute of Science. Accessed October 23, 2020. http://etd.iisc.ac.in/handle/2005/2837.

MLA Handbook (7^{th} Edition):

Pai, Nithish. “A GPU Accelerated Tensor Spectral Method for Subspace Clustering.” 2017. Web. 23 Oct 2020.

Vancouver:

Pai N. A GPU Accelerated Tensor Spectral Method for Subspace Clustering. [Internet] [Masters thesis]. Indian Institute of Science; 2017. [cited 2020 Oct 23]. Available from: http://etd.iisc.ac.in/handle/2005/2837.

Council of Science Editors:

Pai N. A GPU Accelerated Tensor Spectral Method for Subspace Clustering. [Masters Thesis]. Indian Institute of Science; 2017. Available from: http://etd.iisc.ac.in/handle/2005/2837

University of New South Wales

24.
Helal, Manal.
Indexing and *partitioning* schemes for distributed tensor computing with application to multiple sequence alignment.

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

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

► This thesis investigates indexing and *partitioning* schemes for high dimensional scientific computational problems. Building on the foundation offered by Mathematics of Arrays (MoA) for tensor-based…
(more)

Subjects/Keywords: Partitioning; Tensor Computing; High Performance Computing; Dynamic Programming; Algorithms; Parallel Processing; Bioinformatics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Helal, M. (2009). Indexing and partitioning schemes for distributed tensor computing with application to multiple sequence alignment. (Doctoral Dissertation). University of New South Wales. Retrieved from http://handle.unsw.edu.au/1959.4/44781 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:8078/SOURCE02?view=true

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

Helal, Manal. “Indexing and partitioning schemes for distributed tensor computing with application to multiple sequence alignment.” 2009. Doctoral Dissertation, University of New South Wales. Accessed October 23, 2020. http://handle.unsw.edu.au/1959.4/44781 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:8078/SOURCE02?view=true.

MLA Handbook (7^{th} Edition):

Helal, Manal. “Indexing and partitioning schemes for distributed tensor computing with application to multiple sequence alignment.” 2009. Web. 23 Oct 2020.

Vancouver:

Helal M. Indexing and partitioning schemes for distributed tensor computing with application to multiple sequence alignment. [Internet] [Doctoral dissertation]. University of New South Wales; 2009. [cited 2020 Oct 23]. Available from: http://handle.unsw.edu.au/1959.4/44781 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:8078/SOURCE02?view=true.

Council of Science Editors:

Helal M. Indexing and partitioning schemes for distributed tensor computing with application to multiple sequence alignment. [Doctoral Dissertation]. University of New South Wales; 2009. Available from: http://handle.unsw.edu.au/1959.4/44781 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:8078/SOURCE02?view=true

University of New South Wales

25. Tang, Jiangjun. Large Scale Multi-Objective Optimization for Dynamic Airspace Sectorization.

Degree: Engineering & Information Technology, 2012, University of New South Wales

URL: http://handle.unsw.edu.au/1959.4/52053 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:10723/SOURCE01?view=true

► A key limitation in accommodating continuing air traffic growth is the fixed airspace structure (sector boundaries), which is largely determined by historical flight profiles that…
(more)

Subjects/Keywords: Air Traffic Management; Dynamic Airspace Sectorization; Dynamic Airspace Configuration; Task Load; Multi-agent systems; 3D Partitioning Methods; Multi-objective Optimization; Genetic Algorithms; Australian Airspace

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Tang, J. (2012). Large Scale Multi-Objective Optimization for Dynamic Airspace Sectorization. (Doctoral Dissertation). University of New South Wales. Retrieved from http://handle.unsw.edu.au/1959.4/52053 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:10723/SOURCE01?view=true

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

Tang, Jiangjun. “Large Scale Multi-Objective Optimization for Dynamic Airspace Sectorization.” 2012. Doctoral Dissertation, University of New South Wales. Accessed October 23, 2020. http://handle.unsw.edu.au/1959.4/52053 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:10723/SOURCE01?view=true.

MLA Handbook (7^{th} Edition):

Tang, Jiangjun. “Large Scale Multi-Objective Optimization for Dynamic Airspace Sectorization.” 2012. Web. 23 Oct 2020.

Vancouver:

Tang J. Large Scale Multi-Objective Optimization for Dynamic Airspace Sectorization. [Internet] [Doctoral dissertation]. University of New South Wales; 2012. [cited 2020 Oct 23]. Available from: http://handle.unsw.edu.au/1959.4/52053 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:10723/SOURCE01?view=true.

Council of Science Editors:

Tang J. Large Scale Multi-Objective Optimization for Dynamic Airspace Sectorization. [Doctoral Dissertation]. University of New South Wales; 2012. Available from: http://handle.unsw.edu.au/1959.4/52053 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:10723/SOURCE01?view=true

University of Cincinnati

26.
Fitton, N V.
Why and How to Report Distributions of Optima in Experiments
on Heuristic * Algorithms*.

Degree: MS, Engineering : Computer Science, 2001, University of Cincinnati

URL: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1006054556

► The goal of this thesis is to make good science easier to do by promoting and facilitating the comparison of *algorithms*. *Algorithms* for solving difficult…
(more)

Subjects/Keywords: design of experiments; experimental methodology; heuristic algorithms; probabilistic algorithms; optimization; sample size; statistics; VLSI circuit partitioning

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Fitton, N. V. (2001). Why and How to Report Distributions of Optima in Experiments on Heuristic Algorithms. (Masters Thesis). University of Cincinnati. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=ucin1006054556

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

Fitton, N V. “Why and How to Report Distributions of Optima in Experiments on Heuristic Algorithms.” 2001. Masters Thesis, University of Cincinnati. Accessed October 23, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1006054556.

MLA Handbook (7^{th} Edition):

Fitton, N V. “Why and How to Report Distributions of Optima in Experiments on Heuristic Algorithms.” 2001. Web. 23 Oct 2020.

Vancouver:

Fitton NV. Why and How to Report Distributions of Optima in Experiments on Heuristic Algorithms. [Internet] [Masters thesis]. University of Cincinnati; 2001. [cited 2020 Oct 23]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1006054556.

Council of Science Editors:

Fitton NV. Why and How to Report Distributions of Optima in Experiments on Heuristic Algorithms. [Masters Thesis]. University of Cincinnati; 2001. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1006054556

Indian Institute of Science

27.
Anand, Sunil Kumar.
Genetic Algorithm Based Automatic Data *Partitioning* Scheme For HPF On A Linux Cluster.

Degree: MSc Engg, Faculty of Engineering, 2011, Indian Institute of Science

URL: http://etd.iisc.ac.in/handle/2005/1443

Subjects/Keywords: Data Partitioning (Computer Science); High Performance Fortran; Fortran (Computer Program Language); Linux Computing Clusters; Genetic Algorithms; Automatic Data Partitioning; Cluster (Computing); Linux Cluster; Computer Science

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Anand, S. K. (2011). Genetic Algorithm Based Automatic Data Partitioning Scheme For HPF On A Linux Cluster. (Masters Thesis). Indian Institute of Science. Retrieved from http://etd.iisc.ac.in/handle/2005/1443

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

Anand, Sunil Kumar. “Genetic Algorithm Based Automatic Data Partitioning Scheme For HPF On A Linux Cluster.” 2011. Masters Thesis, Indian Institute of Science. Accessed October 23, 2020. http://etd.iisc.ac.in/handle/2005/1443.

MLA Handbook (7^{th} Edition):

Anand, Sunil Kumar. “Genetic Algorithm Based Automatic Data Partitioning Scheme For HPF On A Linux Cluster.” 2011. Web. 23 Oct 2020.

Vancouver:

Anand SK. Genetic Algorithm Based Automatic Data Partitioning Scheme For HPF On A Linux Cluster. [Internet] [Masters thesis]. Indian Institute of Science; 2011. [cited 2020 Oct 23]. Available from: http://etd.iisc.ac.in/handle/2005/1443.

Council of Science Editors:

Anand SK. Genetic Algorithm Based Automatic Data Partitioning Scheme For HPF On A Linux Cluster. [Masters Thesis]. Indian Institute of Science; 2011. Available from: http://etd.iisc.ac.in/handle/2005/1443

28.
Kolodziej, Scott Parker.
Computational Optimization Techniques for Graph * Partitioning*.

Degree: PhD, Computer Science, 2019, Texas A&M University

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

► *Partitioning* graphs into two or more subgraphs is a fundamental operation in computer science, with applications in large-scale graph analytics, distributed and parallel data processing,…
(more)

Subjects/Keywords: Graph partitioning; Graph algorithms; Numerical optimization; Computational optimization; Mathematical programming; Quadratic programming; Vertex separators; Edge cuts; Hypergraph Partitioning; Sparse matrix algorithms

…xiii
1. INTRODUCTION TO GRAPH *PARTITIONING*… …1.1
1.2
1.3
1.4
1.5
Graph *Partitioning*… …Graph *Partitioning* Problems… …1.4.1 Graph Analytics and Data *Partitioning*… …Established Methods for Graph *Partitioning*…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kolodziej, S. P. (2019). Computational Optimization Techniques for Graph Partitioning. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/186247

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

Kolodziej, Scott Parker. “Computational Optimization Techniques for Graph Partitioning.” 2019. Doctoral Dissertation, Texas A&M University. Accessed October 23, 2020. http://hdl.handle.net/1969.1/186247.

MLA Handbook (7^{th} Edition):

Kolodziej, Scott Parker. “Computational Optimization Techniques for Graph Partitioning.” 2019. Web. 23 Oct 2020.

Vancouver:

Kolodziej SP. Computational Optimization Techniques for Graph Partitioning. [Internet] [Doctoral dissertation]. Texas A&M University; 2019. [cited 2020 Oct 23]. Available from: http://hdl.handle.net/1969.1/186247.

Council of Science Editors:

Kolodziej SP. Computational Optimization Techniques for Graph Partitioning. [Doctoral Dissertation]. Texas A&M University; 2019. Available from: http://hdl.handle.net/1969.1/186247

29.
Kolodziej, Scott Parker.
Computational Optimization Techniques for Graph * Partitioning*.

Degree: PhD, Computer Science, 2019, Texas A&M University

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

► *Partitioning* graphs into two or more subgraphs is a fundamental operation in computer science, with applications in large-scale graph analytics, distributed and parallel data processing,…
(more)

Subjects/Keywords: Graph partitioning; Graph algorithms; Numerical optimization; Computational optimization; Mathematical programming; Quadratic programming; Vertex separators; Edge cuts; Hypergraph Partitioning; Sparse matrix algorithms

…xiii
1. INTRODUCTION TO GRAPH *PARTITIONING*… …1.1
1.2
1.3
1.4
1.5
Graph *Partitioning*… …Graph *Partitioning* Problems… …1.4.1 Graph Analytics and Data *Partitioning*… …Established Methods for Graph *Partitioning*…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kolodziej, S. P. (2019). Computational Optimization Techniques for Graph Partitioning. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/186207

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

Kolodziej, Scott Parker. “Computational Optimization Techniques for Graph Partitioning.” 2019. Doctoral Dissertation, Texas A&M University. Accessed October 23, 2020. http://hdl.handle.net/1969.1/186207.

MLA Handbook (7^{th} Edition):

Kolodziej, Scott Parker. “Computational Optimization Techniques for Graph Partitioning.” 2019. Web. 23 Oct 2020.

Vancouver:

Kolodziej SP. Computational Optimization Techniques for Graph Partitioning. [Internet] [Doctoral dissertation]. Texas A&M University; 2019. [cited 2020 Oct 23]. Available from: http://hdl.handle.net/1969.1/186207.

Council of Science Editors:

Kolodziej SP. Computational Optimization Techniques for Graph Partitioning. [Doctoral Dissertation]. Texas A&M University; 2019. Available from: http://hdl.handle.net/1969.1/186207

30. ΜΑΡΙΝΙΤΣΗΣ, ΙΩΑΝΝΗΣ. ΑΛΓΟΡΙΘΜΟΙ ΔΙΑΜΕΛΙΣΜΟΥ ΚΑΙ ΑΥΤΟΠΡΟΣΑΡΜΟΖΟΜΕΝΟΙ ΑΛΓΟΡΙΘΜΟΙ ΛΑΙΝΙΩΤΗ ΠΑΡΑΚΟΛΟΥΘΗΣΗΣ ΑΕΡΟΣΚΑΦΩΝ ΜΕ RADAR ΣΤΑ ΣΥΣΤΗΜΑΤΑ ΕΛΕΓΧΟΥ ΕΝΑΕΡΙΑΣ ΚΥΚ...

Degree: 1996, Πανεπιστήμιο Πατρών; University of Patras

URL: http://hdl.handle.net/10442/hedi/6580

►

ΣΤΗΝ ΠΑΡΟΥΣΑ ΔΙΔΑΚΤΟΡΙΚΗ ΔΙΑΤΡΙΒΗ ΑΝΑΠΤΥΣΣΟΝΤΑΙ ΦΙΛΤΡΑ ΔΙΑΜΕΛΙΣΜΟΥ ΚΑΙ ΑΥΤΟΠΡΟΣΑΡΜΟΖΟΜΕΝΑ ΦΙΛΤΡΑ ΓΙΑ ΤΗΝ ΠΑΡΑΚΟΛΟΥΘΗΣΗ ΑΕΡΟΣΚΑΦΩΝ ΣΤΑ ΣΥΣΤΗΜΑΤΑ ΕΛΕΓΧΟΥ ΕΝΑΕΡΙΟΥ ΚΥΚΛΟΦΟΡΙΑΣ ΚΑΙ ΣΥΓΚΡΙΝΟΝΤΑΙ ΜΕ ΤΑ ΜΕΧΡΙ ΣΗΜΕΡΑ… (more)

Subjects/Keywords: ADAPTIVE TRACKING FILTERS; LAINIOTIS TRACKING FILTERS; PARTITIONING ALGORITHMS; ΑΛΓΟΡΙΘΜΟΙ ΔΙΑΜΕΛΙΣΜΟΥ; ΑΥΤΟΠΡΟΣΑΡΜΟΖΟΜΕΝΑ ΦΙΛΤΡΑ ΠΑΡΑΚΟΛΟΥΘΗΣΗΣ ΑΕΡΟΣΚΑΦΩΝ; Παρακολούθηση στόχων; ΦΙΛΤΡΑ ΛΑΙΝΙΩΤΗ ΠΑΡΑΚΟΛΟΥΘΗΣΗΣ ΑΕΡΟΣΚΑΦΩΝ

Record Details Similar Records

❌

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

APA (6^{th} Edition):

ΜΑΡΙΝΙΤΣΗΣ, . (1996). ΑΛΓΟΡΙΘΜΟΙ ΔΙΑΜΕΛΙΣΜΟΥ ΚΑΙ ΑΥΤΟΠΡΟΣΑΡΜΟΖΟΜΕΝΟΙ ΑΛΓΟΡΙΘΜΟΙ ΛΑΙΝΙΩΤΗ ΠΑΡΑΚΟΛΟΥΘΗΣΗΣ ΑΕΡΟΣΚΑΦΩΝ ΜΕ RADAR ΣΤΑ ΣΥΣΤΗΜΑΤΑ ΕΛΕΓΧΟΥ ΕΝΑΕΡΙΑΣ ΚΥΚ... (Thesis). Πανεπιστήμιο Πατρών; University of Patras. Retrieved from http://hdl.handle.net/10442/hedi/6580

Not specified: Masters Thesis or Doctoral Dissertation

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

ΜΑΡΙΝΙΤΣΗΣ, ΙΩΑΝΝΗΣ. “ΑΛΓΟΡΙΘΜΟΙ ΔΙΑΜΕΛΙΣΜΟΥ ΚΑΙ ΑΥΤΟΠΡΟΣΑΡΜΟΖΟΜΕΝΟΙ ΑΛΓΟΡΙΘΜΟΙ ΛΑΙΝΙΩΤΗ ΠΑΡΑΚΟΛΟΥΘΗΣΗΣ ΑΕΡΟΣΚΑΦΩΝ ΜΕ RADAR ΣΤΑ ΣΥΣΤΗΜΑΤΑ ΕΛΕΓΧΟΥ ΕΝΑΕΡΙΑΣ ΚΥΚ...” 1996. Thesis, Πανεπιστήμιο Πατρών; University of Patras. Accessed October 23, 2020. http://hdl.handle.net/10442/hedi/6580.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

ΜΑΡΙΝΙΤΣΗΣ, ΙΩΑΝΝΗΣ. “ΑΛΓΟΡΙΘΜΟΙ ΔΙΑΜΕΛΙΣΜΟΥ ΚΑΙ ΑΥΤΟΠΡΟΣΑΡΜΟΖΟΜΕΝΟΙ ΑΛΓΟΡΙΘΜΟΙ ΛΑΙΝΙΩΤΗ ΠΑΡΑΚΟΛΟΥΘΗΣΗΣ ΑΕΡΟΣΚΑΦΩΝ ΜΕ RADAR ΣΤΑ ΣΥΣΤΗΜΑΤΑ ΕΛΕΓΧΟΥ ΕΝΑΕΡΙΑΣ ΚΥΚ...” 1996. Web. 23 Oct 2020.

Vancouver:

ΜΑΡΙΝΙΤΣΗΣ . ΑΛΓΟΡΙΘΜΟΙ ΔΙΑΜΕΛΙΣΜΟΥ ΚΑΙ ΑΥΤΟΠΡΟΣΑΡΜΟΖΟΜΕΝΟΙ ΑΛΓΟΡΙΘΜΟΙ ΛΑΙΝΙΩΤΗ ΠΑΡΑΚΟΛΟΥΘΗΣΗΣ ΑΕΡΟΣΚΑΦΩΝ ΜΕ RADAR ΣΤΑ ΣΥΣΤΗΜΑΤΑ ΕΛΕΓΧΟΥ ΕΝΑΕΡΙΑΣ ΚΥΚ... [Internet] [Thesis]. Πανεπιστήμιο Πατρών; University of Patras; 1996. [cited 2020 Oct 23]. Available from: http://hdl.handle.net/10442/hedi/6580.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

ΜΑΡΙΝΙΤΣΗΣ . ΑΛΓΟΡΙΘΜΟΙ ΔΙΑΜΕΛΙΣΜΟΥ ΚΑΙ ΑΥΤΟΠΡΟΣΑΡΜΟΖΟΜΕΝΟΙ ΑΛΓΟΡΙΘΜΟΙ ΛΑΙΝΙΩΤΗ ΠΑΡΑΚΟΛΟΥΘΗΣΗΣ ΑΕΡΟΣΚΑΦΩΝ ΜΕ RADAR ΣΤΑ ΣΥΣΤΗΜΑΤΑ ΕΛΕΓΧΟΥ ΕΝΑΕΡΙΑΣ ΚΥΚ... [Thesis]. Πανεπιστήμιο Πατρών; University of Patras; 1996. Available from: http://hdl.handle.net/10442/hedi/6580

Not specified: Masters Thesis or Doctoral Dissertation