Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(hypercubes). Showing records 1 – 14 of 14 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


Penn State University

1. Ethier, John T. STRONG FORMS OF ORTHOGONALITY FOR SETS OF HYPERCUBES.

Degree: PhD, Mathematics, 2008, Penn State University

 The main goal of this work is to examine strong forms of orthogonality for various types of hypercubes. For integers n and d greater than… (more)

Subjects/Keywords: latin squares; mds codes; orthogonal hypercubes; frequency hypercubes

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ethier, J. T. (2008). STRONG FORMS OF ORTHOGONALITY FOR SETS OF HYPERCUBES. (Doctoral Dissertation). Penn State University. Retrieved from https://etda.libraries.psu.edu/catalog/8593

Chicago Manual of Style (16th Edition):

Ethier, John T. “STRONG FORMS OF ORTHOGONALITY FOR SETS OF HYPERCUBES.” 2008. Doctoral Dissertation, Penn State University. Accessed January 23, 2020. https://etda.libraries.psu.edu/catalog/8593.

MLA Handbook (7th Edition):

Ethier, John T. “STRONG FORMS OF ORTHOGONALITY FOR SETS OF HYPERCUBES.” 2008. Web. 23 Jan 2020.

Vancouver:

Ethier JT. STRONG FORMS OF ORTHOGONALITY FOR SETS OF HYPERCUBES. [Internet] [Doctoral dissertation]. Penn State University; 2008. [cited 2020 Jan 23]. Available from: https://etda.libraries.psu.edu/catalog/8593.

Council of Science Editors:

Ethier JT. STRONG FORMS OF ORTHOGONALITY FOR SETS OF HYPERCUBES. [Doctoral Dissertation]. Penn State University; 2008. Available from: https://etda.libraries.psu.edu/catalog/8593


Linköping University

2. Johansson, Per. Avoiding edge colorings of hypercubes.

Degree: Mathematics and Applied Mathematics, 2019, Linköping University

  The hypercube Qn is the graph whose vertices are the ordered n-tuples of zeros and ones, where two vertices are adjacent iff they differ… (more)

Subjects/Keywords: Graph Theory; Hypercubes; Avoiding edge colorings; Discrete Mathematics; Diskret matematik

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Johansson, P. (2019). Avoiding edge colorings of hypercubes. (Thesis). Linköping University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-160863

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

Chicago Manual of Style (16th Edition):

Johansson, Per. “Avoiding edge colorings of hypercubes.” 2019. Thesis, Linköping University. Accessed January 23, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-160863.

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

MLA Handbook (7th Edition):

Johansson, Per. “Avoiding edge colorings of hypercubes.” 2019. Web. 23 Jan 2020.

Vancouver:

Johansson P. Avoiding edge colorings of hypercubes. [Internet] [Thesis]. Linköping University; 2019. [cited 2020 Jan 23]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-160863.

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

Council of Science Editors:

Johansson P. Avoiding edge colorings of hypercubes. [Thesis]. Linköping University; 2019. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-160863

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


Missouri University of Science and Technology

3. Lathrom, Grant Harlan. Automorphism groups of resolvable incidence structure.

Degree: PhD, Mathematics, Missouri University of Science and Technology

Subjects/Keywords: Resolvable incidence structures; Frequency hypercubes; Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lathrom, G. H. (n.d.). Automorphism groups of resolvable incidence structure. (Doctoral Dissertation). Missouri University of Science and Technology. Retrieved from http://scholarsmine.mst.edu/doctoral_dissertations/1516

Note: this citation may be lacking information needed for this citation format:
No year of publication.

Chicago Manual of Style (16th Edition):

Lathrom, Grant Harlan. “Automorphism groups of resolvable incidence structure.” Doctoral Dissertation, Missouri University of Science and Technology. Accessed January 23, 2020. http://scholarsmine.mst.edu/doctoral_dissertations/1516.

Note: this citation may be lacking information needed for this citation format:
No year of publication.

MLA Handbook (7th Edition):

Lathrom, Grant Harlan. “Automorphism groups of resolvable incidence structure.” Web. 23 Jan 2020.

Note: this citation may be lacking information needed for this citation format:
No year of publication.

Vancouver:

Lathrom GH. Automorphism groups of resolvable incidence structure. [Internet] [Doctoral dissertation]. Missouri University of Science and Technology; [cited 2020 Jan 23]. Available from: http://scholarsmine.mst.edu/doctoral_dissertations/1516.

Note: this citation may be lacking information needed for this citation format:
No year of publication.

Council of Science Editors:

Lathrom GH. Automorphism groups of resolvable incidence structure. [Doctoral Dissertation]. Missouri University of Science and Technology; Available from: http://scholarsmine.mst.edu/doctoral_dissertations/1516

Note: this citation may be lacking information needed for this citation format:
No year of publication.

4. Zhang, Xiaohong. Combinatorial and algebraic aspects of quantum state transfer.

Degree: Mathematics, 2019, University of Manitoba

 Reliably transferring a quantum state from one location to another, as well as generating entangled states, are important tasks to achieve in quantum spin systems.… (more)

Subjects/Keywords: quantum information transfer; fidelity; Hadamard matrices; orthogonal polynomials; path; hypercubes; sensitivity; fractional revival

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhang, X. (2019). Combinatorial and algebraic aspects of quantum state transfer. (Thesis). University of Manitoba. Retrieved from http://hdl.handle.net/1993/34180

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

Chicago Manual of Style (16th Edition):

Zhang, Xiaohong. “Combinatorial and algebraic aspects of quantum state transfer.” 2019. Thesis, University of Manitoba. Accessed January 23, 2020. http://hdl.handle.net/1993/34180.

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

MLA Handbook (7th Edition):

Zhang, Xiaohong. “Combinatorial and algebraic aspects of quantum state transfer.” 2019. Web. 23 Jan 2020.

Vancouver:

Zhang X. Combinatorial and algebraic aspects of quantum state transfer. [Internet] [Thesis]. University of Manitoba; 2019. [cited 2020 Jan 23]. Available from: http://hdl.handle.net/1993/34180.

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

Council of Science Editors:

Zhang X. Combinatorial and algebraic aspects of quantum state transfer. [Thesis]. University of Manitoba; 2019. Available from: http://hdl.handle.net/1993/34180

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


Louisiana State University

5. Kithlanagamangala, Guru Prasad P. Efficient embedding of virtual hypercubes in irregular WDM optical networks.

Degree: MSEE, Electrical and Computer Engineering, 2003, Louisiana State University

 This thesis addresses one of the important issues in designing future WDM optical networks. Such networks are expected to employ an all-optical control plane for… (more)

Subjects/Keywords: network state information exchange; hypercubes; control plane; embedding; routing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kithlanagamangala, G. P. P. (2003). Efficient embedding of virtual hypercubes in irregular WDM optical networks. (Masters Thesis). Louisiana State University. Retrieved from etd-1112103-211729 ; https://digitalcommons.lsu.edu/gradschool_theses/2827

Chicago Manual of Style (16th Edition):

Kithlanagamangala, Guru Prasad P. “Efficient embedding of virtual hypercubes in irregular WDM optical networks.” 2003. Masters Thesis, Louisiana State University. Accessed January 23, 2020. etd-1112103-211729 ; https://digitalcommons.lsu.edu/gradschool_theses/2827.

MLA Handbook (7th Edition):

Kithlanagamangala, Guru Prasad P. “Efficient embedding of virtual hypercubes in irregular WDM optical networks.” 2003. Web. 23 Jan 2020.

Vancouver:

Kithlanagamangala GPP. Efficient embedding of virtual hypercubes in irregular WDM optical networks. [Internet] [Masters thesis]. Louisiana State University; 2003. [cited 2020 Jan 23]. Available from: etd-1112103-211729 ; https://digitalcommons.lsu.edu/gradschool_theses/2827.

Council of Science Editors:

Kithlanagamangala GPP. Efficient embedding of virtual hypercubes in irregular WDM optical networks. [Masters Thesis]. Louisiana State University; 2003. Available from: etd-1112103-211729 ; https://digitalcommons.lsu.edu/gradschool_theses/2827


Virginia Commonwealth University

6. Turner, Bethany. Embeddings of Product Graphs Where One Factor is a Hypercube.

Degree: MS, Mathematical Sciences, 2011, Virginia Commonwealth University

 Voltage graph theory can be used to describe embeddings of product graphs if one factor is a Cayley graph. We use voltage graphs to explore… (more)

Subjects/Keywords: graph theory; topological graph theory; voltage graph theory; prodcut graphs; hypercubes; embeddings; Physical Sciences and Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Turner, B. (2011). Embeddings of Product Graphs Where One Factor is a Hypercube. (Thesis). Virginia Commonwealth University. Retrieved from https://scholarscompass.vcu.edu/etd/2455

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

Chicago Manual of Style (16th Edition):

Turner, Bethany. “Embeddings of Product Graphs Where One Factor is a Hypercube.” 2011. Thesis, Virginia Commonwealth University. Accessed January 23, 2020. https://scholarscompass.vcu.edu/etd/2455.

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

MLA Handbook (7th Edition):

Turner, Bethany. “Embeddings of Product Graphs Where One Factor is a Hypercube.” 2011. Web. 23 Jan 2020.

Vancouver:

Turner B. Embeddings of Product Graphs Where One Factor is a Hypercube. [Internet] [Thesis]. Virginia Commonwealth University; 2011. [cited 2020 Jan 23]. Available from: https://scholarscompass.vcu.edu/etd/2455.

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

Council of Science Editors:

Turner B. Embeddings of Product Graphs Where One Factor is a Hypercube. [Thesis]. Virginia Commonwealth University; 2011. Available from: https://scholarscompass.vcu.edu/etd/2455

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

7. Νικολόπουλος, Βασίλειος. Πολυδιάστατοι αλγόριθμοι συσταδοποίησης και διαχείρισης γνώσης βασισμένοι σε ισομορφική υπερκυβική  τοπολογία.

Degree: 2011, National Technical University of Athens (NTUA); Εθνικό Μετσόβιο Πολυτεχνείο (ΕΜΠ)

The present research Thesis focuses on the scientific field of knowledge management and data fusion, by using specific algorithmic procedures based on hypercubic models and… (more)

Subjects/Keywords: Ενεργειακή πληροφορική; Υπερκύβος; Διαχείριση γνώσης; Συσταδοποίηση; Ενεργειακά πληροφοριακά συστήματα; Ευφυή δίκτυα; Διαχείριση ενέργειας; Energy informatics; Hypercubes; Clustering; K - Means; Knowledge management; Data fusion; Energy information systems; Smart grids

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Νικολόπουλος, . . (2011). Πολυδιάστατοι αλγόριθμοι συσταδοποίησης και διαχείρισης γνώσης βασισμένοι σε ισομορφική υπερκυβική  τοπολογία. (Thesis). National Technical University of Athens (NTUA); Εθνικό Μετσόβιο Πολυτεχνείο (ΕΜΠ). Retrieved from http://hdl.handle.net/10442/hedi/26297

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

Chicago Manual of Style (16th Edition):

Νικολόπουλος, Βασίλειος. “Πολυδιάστατοι αλγόριθμοι συσταδοποίησης και διαχείρισης γνώσης βασισμένοι σε ισομορφική υπερκυβική  τοπολογία.” 2011. Thesis, National Technical University of Athens (NTUA); Εθνικό Μετσόβιο Πολυτεχνείο (ΕΜΠ). Accessed January 23, 2020. http://hdl.handle.net/10442/hedi/26297.

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

MLA Handbook (7th Edition):

Νικολόπουλος, Βασίλειος. “Πολυδιάστατοι αλγόριθμοι συσταδοποίησης και διαχείρισης γνώσης βασισμένοι σε ισομορφική υπερκυβική  τοπολογία.” 2011. Web. 23 Jan 2020.

Vancouver:

Νικολόπουλος . Πολυδιάστατοι αλγόριθμοι συσταδοποίησης και διαχείρισης γνώσης βασισμένοι σε ισομορφική υπερκυβική  τοπολογία. [Internet] [Thesis]. National Technical University of Athens (NTUA); Εθνικό Μετσόβιο Πολυτεχνείο (ΕΜΠ); 2011. [cited 2020 Jan 23]. Available from: http://hdl.handle.net/10442/hedi/26297.

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

Council of Science Editors:

Νικολόπουλος . Πολυδιάστατοι αλγόριθμοι συσταδοποίησης και διαχείρισης γνώσης βασισμένοι σε ισομορφική υπερκυβική  τοπολογία. [Thesis]. National Technical University of Athens (NTUA); Εθνικό Μετσόβιο Πολυτεχνείο (ΕΜΠ); 2011. Available from: http://hdl.handle.net/10442/hedi/26297

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


University of North Texas

8. John, Ajita. Linearly Ordered Concurrent Data Structures on Hypercubes.

Degree: 1992, University of North Texas

 This thesis presents a simple method for the concurrent manipulation of linearly ordered data structures on hypercubes. The method is based on the existence of… (more)

Subjects/Keywords: linearly ordered data structures; hypercubes; concurrent manipulation; Hypercube.; Data structures (Computer science)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

John, A. (1992). Linearly Ordered Concurrent Data Structures on Hypercubes. (Thesis). University of North Texas. Retrieved from https://digital.library.unt.edu/ark:/67531/metadc501197/

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

Chicago Manual of Style (16th Edition):

John, Ajita. “Linearly Ordered Concurrent Data Structures on Hypercubes.” 1992. Thesis, University of North Texas. Accessed January 23, 2020. https://digital.library.unt.edu/ark:/67531/metadc501197/.

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

MLA Handbook (7th Edition):

John, Ajita. “Linearly Ordered Concurrent Data Structures on Hypercubes.” 1992. Web. 23 Jan 2020.

Vancouver:

John A. Linearly Ordered Concurrent Data Structures on Hypercubes. [Internet] [Thesis]. University of North Texas; 1992. [cited 2020 Jan 23]. Available from: https://digital.library.unt.edu/ark:/67531/metadc501197/.

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

Council of Science Editors:

John A. Linearly Ordered Concurrent Data Structures on Hypercubes. [Thesis]. University of North Texas; 1992. Available from: https://digital.library.unt.edu/ark:/67531/metadc501197/

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


Indian Institute of Science

9. Kumar, Mohan J. Architecture, Performance and Applications of a Hierarchial Network of Hypercubes.

Degree: 1992, Indian Institute of Science

 This thesis, presents a multiprocessor topology, the hierarchical network of hyper-cubes, which has a low diameter, low degree of connectivity and yet exhibits hypercube like… (more)

Subjects/Keywords: Computer and Information Science; Computer network architectures; Computer architectures; Multiprocessors; Parallel processing; Hierarchical Network of Hypercubes

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kumar, M. J. (1992). Architecture, Performance and Applications of a Hierarchial Network of Hypercubes. (Thesis). Indian Institute of Science. Retrieved from http://hdl.handle.net/2005/53

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

Chicago Manual of Style (16th Edition):

Kumar, Mohan J. “Architecture, Performance and Applications of a Hierarchial Network of Hypercubes.” 1992. Thesis, Indian Institute of Science. Accessed January 23, 2020. http://hdl.handle.net/2005/53.

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

MLA Handbook (7th Edition):

Kumar, Mohan J. “Architecture, Performance and Applications of a Hierarchial Network of Hypercubes.” 1992. Web. 23 Jan 2020.

Vancouver:

Kumar MJ. Architecture, Performance and Applications of a Hierarchial Network of Hypercubes. [Internet] [Thesis]. Indian Institute of Science; 1992. [cited 2020 Jan 23]. Available from: http://hdl.handle.net/2005/53.

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

Council of Science Editors:

Kumar MJ. Architecture, Performance and Applications of a Hierarchial Network of Hypercubes. [Thesis]. Indian Institute of Science; 1992. Available from: http://hdl.handle.net/2005/53

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


Universidade do Rio Grande do Sul

10. De Rose, Cesar Augusto Fonticielha. Algoritmos paralelos para alocação e gerência de processadores em máquinas multiprocessadoras hipercúbicas.

Degree: 1993, Universidade do Rio Grande do Sul

 Nos últimos anos, máquinas maciçamente paralelas, compostas de centenas de processadores, vem sendo estudadas como uma alternativa para a construção de supercomputadores. Neste novo conceito… (more)

Subjects/Keywords: Computer architecture; Arquitetura de computadores; Processamento paralelo; Parallel processing; Algoritmos paralelos; Processor allocation; Parallel algorithms; Hipercubo; Alocacao : Processadores; Hypercubes

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

De Rose, C. A. F. (1993). Algoritmos paralelos para alocação e gerência de processadores em máquinas multiprocessadoras hipercúbicas. (Thesis). Universidade do Rio Grande do Sul. Retrieved from http://hdl.handle.net/10183/25184

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

Chicago Manual of Style (16th Edition):

De Rose, Cesar Augusto Fonticielha. “Algoritmos paralelos para alocação e gerência de processadores em máquinas multiprocessadoras hipercúbicas.” 1993. Thesis, Universidade do Rio Grande do Sul. Accessed January 23, 2020. http://hdl.handle.net/10183/25184.

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

MLA Handbook (7th Edition):

De Rose, Cesar Augusto Fonticielha. “Algoritmos paralelos para alocação e gerência de processadores em máquinas multiprocessadoras hipercúbicas.” 1993. Web. 23 Jan 2020.

Vancouver:

De Rose CAF. Algoritmos paralelos para alocação e gerência de processadores em máquinas multiprocessadoras hipercúbicas. [Internet] [Thesis]. Universidade do Rio Grande do Sul; 1993. [cited 2020 Jan 23]. Available from: http://hdl.handle.net/10183/25184.

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

Council of Science Editors:

De Rose CAF. Algoritmos paralelos para alocação e gerência de processadores em máquinas multiprocessadoras hipercúbicas. [Thesis]. Universidade do Rio Grande do Sul; 1993. Available from: http://hdl.handle.net/10183/25184

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


Australian National University

11. Liang, Weifa. Designing Efficient Parallel Algorithms for Graph Problems .

Degree: 1997, Australian National University

 Graph algorithms are concerned with the algorithmic aspects of solving graph problems. The problems are motivated from and have application to diverse areas of computer… (more)

Subjects/Keywords: efficient parallel algorithms; graph problems; graph algorithms; paralellization; dynamic updates; sparsification; communication networks; Parallel Random Access Machine; PRAM; meshes; hypercubes

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Liang, W. (1997). Designing Efficient Parallel Algorithms for Graph Problems . (Thesis). Australian National University. Retrieved from http://hdl.handle.net/1885/47660

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

Chicago Manual of Style (16th Edition):

Liang, Weifa. “Designing Efficient Parallel Algorithms for Graph Problems .” 1997. Thesis, Australian National University. Accessed January 23, 2020. http://hdl.handle.net/1885/47660.

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

MLA Handbook (7th Edition):

Liang, Weifa. “Designing Efficient Parallel Algorithms for Graph Problems .” 1997. Web. 23 Jan 2020.

Vancouver:

Liang W. Designing Efficient Parallel Algorithms for Graph Problems . [Internet] [Thesis]. Australian National University; 1997. [cited 2020 Jan 23]. Available from: http://hdl.handle.net/1885/47660.

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

Council of Science Editors:

Liang W. Designing Efficient Parallel Algorithms for Graph Problems . [Thesis]. Australian National University; 1997. Available from: http://hdl.handle.net/1885/47660

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

12. Νάστου, Παναγιώτης. Αρχιτεκτονική συσχετικού επεξεργαστή με παράλληλο επεξεργαστικό στοιχείο και διασυνδετικό δίκτυο.

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

Subjects/Keywords: Συσχετικός επεξεργαστής; Διασυνδετικό δίκτυο; Ανίχνευση κατωφλίου; Τοπολογία δένδρου-λέξης; Υπερκύβος; Επεξεργασία εικόνας; Associative processor; Threshold search; Word-tree topology; Hypercubes; Interconnection network; Image processing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Νάστου, . (1998). Αρχιτεκτονική συσχετικού επεξεργαστή με παράλληλο επεξεργαστικό στοιχείο και διασυνδετικό δίκτυο. (Thesis). Πανεπιστήμιο Πατρών; University of Patras. Retrieved from http://hdl.handle.net/10442/hedi/11268

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

Chicago Manual of Style (16th Edition):

Νάστου, Παναγιώτης. “Αρχιτεκτονική συσχετικού επεξεργαστή με παράλληλο επεξεργαστικό στοιχείο και διασυνδετικό δίκτυο.” 1998. Thesis, Πανεπιστήμιο Πατρών; University of Patras. Accessed January 23, 2020. http://hdl.handle.net/10442/hedi/11268.

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

MLA Handbook (7th Edition):

Νάστου, Παναγιώτης. “Αρχιτεκτονική συσχετικού επεξεργαστή με παράλληλο επεξεργαστικό στοιχείο και διασυνδετικό δίκτυο.” 1998. Web. 23 Jan 2020.

Vancouver:

Νάστου . Αρχιτεκτονική συσχετικού επεξεργαστή με παράλληλο επεξεργαστικό στοιχείο και διασυνδετικό δίκτυο. [Internet] [Thesis]. Πανεπιστήμιο Πατρών; University of Patras; 1998. [cited 2020 Jan 23]. Available from: http://hdl.handle.net/10442/hedi/11268.

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

Council of Science Editors:

Νάστου . Αρχιτεκτονική συσχετικού επεξεργαστή με παράλληλο επεξεργαστικό στοιχείο και διασυνδετικό δίκτυο. [Thesis]. Πανεπιστήμιο Πατρών; University of Patras; 1998. Available from: http://hdl.handle.net/10442/hedi/11268

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

13. Μάμαλης, Βασίλεισος. Παράλληλη και κατανεμημένη ανάκτηση πληροφορίας: αλγόριθμοι και εφαρμογές τους σε πολυεπεξεργασικά περιβάλλοντα κατανεμημένης μνήμης.

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

Subjects/Keywords: Παράλληλη ανάκτηση κειμένων; Κατανεμημένη ανάκτηση κειμένων; Πληροφορίες, Ανάκτηση; Παράλληλοι αλγόριθμοι; Ενδοεπικοινωνιακά δίκτυα; Κατανεμημένα συστήματα; Δενδρικές τοπολογίες; Υπερκύβος; Parallel text tetrieval; Distributed text retrieval; Information retrieval; Parallel algorithms; Interconnection network; Distributed systems; Tree topologies; Hypercubes

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Μάμαλης, . (1997). Παράλληλη και κατανεμημένη ανάκτηση πληροφορίας: αλγόριθμοι και εφαρμογές τους σε πολυεπεξεργασικά περιβάλλοντα κατανεμημένης μνήμης. (Thesis). Πανεπιστήμιο Πατρών; University of Patras. Retrieved from http://hdl.handle.net/10442/hedi/11272

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

Chicago Manual of Style (16th Edition):

Μάμαλης, Βασίλεισος. “Παράλληλη και κατανεμημένη ανάκτηση πληροφορίας: αλγόριθμοι και εφαρμογές τους σε πολυεπεξεργασικά περιβάλλοντα κατανεμημένης μνήμης.” 1997. Thesis, Πανεπιστήμιο Πατρών; University of Patras. Accessed January 23, 2020. http://hdl.handle.net/10442/hedi/11272.

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

MLA Handbook (7th Edition):

Μάμαλης, Βασίλεισος. “Παράλληλη και κατανεμημένη ανάκτηση πληροφορίας: αλγόριθμοι και εφαρμογές τους σε πολυεπεξεργασικά περιβάλλοντα κατανεμημένης μνήμης.” 1997. Web. 23 Jan 2020.

Vancouver:

Μάμαλης . Παράλληλη και κατανεμημένη ανάκτηση πληροφορίας: αλγόριθμοι και εφαρμογές τους σε πολυεπεξεργασικά περιβάλλοντα κατανεμημένης μνήμης. [Internet] [Thesis]. Πανεπιστήμιο Πατρών; University of Patras; 1997. [cited 2020 Jan 23]. Available from: http://hdl.handle.net/10442/hedi/11272.

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

Council of Science Editors:

Μάμαλης . Παράλληλη και κατανεμημένη ανάκτηση πληροφορίας: αλγόριθμοι και εφαρμογές τους σε πολυεπεξεργασικά περιβάλλοντα κατανεμημένης μνήμης. [Thesis]. Πανεπιστήμιο Πατρών; University of Patras; 1997. Available from: http://hdl.handle.net/10442/hedi/11272

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

14. Grabaskas, David. Efficient Approaches to the Treatment of Uncertainty in Satisfying Regulatory Limits.

Degree: PhD, Nuclear Engineering, 2012, The Ohio State University

  Utilities operating nuclear power plants in the United States are required to demonstrate that their plants comply with the safety requirements set by the… (more)

Subjects/Keywords: Nuclear Engineering; Statistics; Latin Hypercube Sampling; Orthogonal Arrays; Orthogonal Latin Hypercubes; Monte Carlo Sampling; Confidence Intervals; Quantiles; Regulatory Limits; Nuclear Regulatory Commission; MELCOR; Probability; Safety Limits; Safety Goals; Margin; Hypothesis Testing

…Orthogonal Arrays and Orthogonal Latin Hypercubes ................................... 58 3.2… …includes newer experiment designs, such as orthogonal Latin hypercubes. The goal is to determine… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Grabaskas, D. (2012). Efficient Approaches to the Treatment of Uncertainty in Satisfying Regulatory Limits. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1345464067

Chicago Manual of Style (16th Edition):

Grabaskas, David. “Efficient Approaches to the Treatment of Uncertainty in Satisfying Regulatory Limits.” 2012. Doctoral Dissertation, The Ohio State University. Accessed January 23, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=osu1345464067.

MLA Handbook (7th Edition):

Grabaskas, David. “Efficient Approaches to the Treatment of Uncertainty in Satisfying Regulatory Limits.” 2012. Web. 23 Jan 2020.

Vancouver:

Grabaskas D. Efficient Approaches to the Treatment of Uncertainty in Satisfying Regulatory Limits. [Internet] [Doctoral dissertation]. The Ohio State University; 2012. [cited 2020 Jan 23]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1345464067.

Council of Science Editors:

Grabaskas D. Efficient Approaches to the Treatment of Uncertainty in Satisfying Regulatory Limits. [Doctoral Dissertation]. The Ohio State University; 2012. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1345464067

.