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:(teorie graf ). Showing records 1 – 11 of 11 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


Brno University of Technology

1. Sysel, František. Lehce rozšiřitelný grafový editor: Easily Upgradable Graph Editor.

Degree: 2019, Brno University of Technology

 The bachelors thesis deals with design and implementation of graph editor. The emphasis is put on division of the whole application into independent plug-ins which… (more)

Subjects/Keywords: Modulární systém; zásuvný modul; graf; teorie grafů; vykreslení grafu.; Modular system; plug-in; graph; graph theory; graph drawing.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sysel, F. (2019). Lehce rozšiřitelný grafový editor: Easily Upgradable Graph Editor. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/55799

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

Sysel, František. “Lehce rozšiřitelný grafový editor: Easily Upgradable Graph Editor.” 2019. Thesis, Brno University of Technology. Accessed October 31, 2020. http://hdl.handle.net/11012/55799.

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

MLA Handbook (7th Edition):

Sysel, František. “Lehce rozšiřitelný grafový editor: Easily Upgradable Graph Editor.” 2019. Web. 31 Oct 2020.

Vancouver:

Sysel F. Lehce rozšiřitelný grafový editor: Easily Upgradable Graph Editor. [Internet] [Thesis]. Brno University of Technology; 2019. [cited 2020 Oct 31]. Available from: http://hdl.handle.net/11012/55799.

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

Council of Science Editors:

Sysel F. Lehce rozšiřitelný grafový editor: Easily Upgradable Graph Editor. [Thesis]. Brno University of Technology; 2019. Available from: http://hdl.handle.net/11012/55799

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


Brno University of Technology

2. Dudka, Kamil. Zpracování grafu volání založené na dotazovacím jazyku: Query Language Based Call Graph Processing.

Degree: 2019, Brno University of Technology

 In this thesis, available tools for call graph generation, processing and visualization are analyzed. Based on this analysis, a call-graph processing tool is designed. The… (more)

Subjects/Keywords: graf volání; dotazovací jazyk; teorie grafů; bgl; graphviz; cgt; call graph; query language; graph theory; bgl; graphviz; cgt

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dudka, K. (2019). Zpracování grafu volání založené na dotazovacím jazyku: Query Language Based Call Graph Processing. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/53782

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

Dudka, Kamil. “Zpracování grafu volání založené na dotazovacím jazyku: Query Language Based Call Graph Processing.” 2019. Thesis, Brno University of Technology. Accessed October 31, 2020. http://hdl.handle.net/11012/53782.

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

MLA Handbook (7th Edition):

Dudka, Kamil. “Zpracování grafu volání založené na dotazovacím jazyku: Query Language Based Call Graph Processing.” 2019. Web. 31 Oct 2020.

Vancouver:

Dudka K. Zpracování grafu volání založené na dotazovacím jazyku: Query Language Based Call Graph Processing. [Internet] [Thesis]. Brno University of Technology; 2019. [cited 2020 Oct 31]. Available from: http://hdl.handle.net/11012/53782.

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

Council of Science Editors:

Dudka K. Zpracování grafu volání založené na dotazovacím jazyku: Query Language Based Call Graph Processing. [Thesis]. Brno University of Technology; 2019. Available from: http://hdl.handle.net/11012/53782

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


Brno University of Technology

3. Římský, Adam. Využití teorie grafů pro návrh a optimalizaci architektur datových sítí: Application of graph theory to the design and optimization data network architectures.

Degree: 2019, Brno University of Technology

 This masters'sthesis deals with graph theory and utilization of this theory for design and optimization of data network structures. Introduction chapter describes graph theory in… (more)

Subjects/Keywords: Teorie grafů; graf; orientovaný; neorientovaný; OSPF; Dijkstra; minimální kostra; tok; Graph theory; graph; directed; undirected; OSPF; Dijkstra; minimum spanning tree; flow

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Římský, A. (2019). Využití teorie grafů pro návrh a optimalizaci architektur datových sítí: Application of graph theory to the design and optimization data network architectures. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/4656

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

Římský, Adam. “Využití teorie grafů pro návrh a optimalizaci architektur datových sítí: Application of graph theory to the design and optimization data network architectures.” 2019. Thesis, Brno University of Technology. Accessed October 31, 2020. http://hdl.handle.net/11012/4656.

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

MLA Handbook (7th Edition):

Římský, Adam. “Využití teorie grafů pro návrh a optimalizaci architektur datových sítí: Application of graph theory to the design and optimization data network architectures.” 2019. Web. 31 Oct 2020.

Vancouver:

Římský A. Využití teorie grafů pro návrh a optimalizaci architektur datových sítí: Application of graph theory to the design and optimization data network architectures. [Internet] [Thesis]. Brno University of Technology; 2019. [cited 2020 Oct 31]. Available from: http://hdl.handle.net/11012/4656.

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

Council of Science Editors:

Římský A. Využití teorie grafů pro návrh a optimalizaci architektur datových sítí: Application of graph theory to the design and optimization data network architectures. [Thesis]. Brno University of Technology; 2019. Available from: http://hdl.handle.net/11012/4656

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


Brno University of Technology

4. Bujnovský, Daniel. Optimalizace investic: Investment Optimization.

Degree: 2020, Brno University of Technology

 This work is focused on description of two models of mathematical programming - the network model and the Markowitz portfolio model, their connection and application… (more)

Subjects/Keywords: Optimalizace; teorie portfolia; riziko; Markowitzův model; efektivní hranice; diverzifikace; síťový model; graf; náhodná proměnná; Matlab.; Optimization; portfolio theory; risk; Markowitz model; efficient frontier; diversification; network model; graph; random variable; Matlab.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bujnovský, D. (2020). Optimalizace investic: Investment Optimization. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/191801

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

Bujnovský, Daniel. “Optimalizace investic: Investment Optimization.” 2020. Thesis, Brno University of Technology. Accessed October 31, 2020. http://hdl.handle.net/11012/191801.

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

MLA Handbook (7th Edition):

Bujnovský, Daniel. “Optimalizace investic: Investment Optimization.” 2020. Web. 31 Oct 2020.

Vancouver:

Bujnovský D. Optimalizace investic: Investment Optimization. [Internet] [Thesis]. Brno University of Technology; 2020. [cited 2020 Oct 31]. Available from: http://hdl.handle.net/11012/191801.

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

Council of Science Editors:

Bujnovský D. Optimalizace investic: Investment Optimization. [Thesis]. Brno University of Technology; 2020. Available from: http://hdl.handle.net/11012/191801

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


Brno University of Technology

5. Jágr, Petr. Hledání nejkratších cest grafem: The Shortest Graph's Pahts Finding.

Degree: 2020, Brno University of Technology

 The aim of this thesis is finding, comparing and implementation of algorithms for finding the shortest paths between each of pairs of nodes in a… (more)

Subjects/Keywords: algoritmus; asymptotické vyjádření složitosti; Bellman-Fordův algoritmus; cesta; Dijkstrův algoritmus; dynamické programování; Floyd-Warshallův algoritmus; genetické algoritmy; heuristické algoritmy; hladové algoritmy; Java; nejkratší cesta; neorientovaný graf; ohodnocený graf; Omega; Omikron; orientovaný graf; paralelní algoritmy; plánování trasy; pravidelný graf; rekurzivní algoritmy; rozděl a panuj; sled; smyčka; souvislý graf; stupeň vrcholu; tah; teorie grafů; Theta; algorithm; asymptotic notation; Bellman-Ford algorithm; complete graph; degree of a vertex; Dijkstra's algorithm; directed graph; divide and conquer algorithms; dynamic programming; Floyd-Warshall algorithm; genetic algorithms; graph teory; greedy algorithms; heuristic algorithms; Java; loop; move; Omega; Omicron; paralel algorithms; path; path planning; recursive algorithms; regular graph; sequence; the shortest path; Theta; undirected graph; weighted graph

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Jágr, P. (2020). Hledání nejkratších cest grafem: The Shortest Graph's Pahts Finding. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/187854

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

Jágr, Petr. “Hledání nejkratších cest grafem: The Shortest Graph's Pahts Finding.” 2020. Thesis, Brno University of Technology. Accessed October 31, 2020. http://hdl.handle.net/11012/187854.

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

MLA Handbook (7th Edition):

Jágr, Petr. “Hledání nejkratších cest grafem: The Shortest Graph's Pahts Finding.” 2020. Web. 31 Oct 2020.

Vancouver:

Jágr P. Hledání nejkratších cest grafem: The Shortest Graph's Pahts Finding. [Internet] [Thesis]. Brno University of Technology; 2020. [cited 2020 Oct 31]. Available from: http://hdl.handle.net/11012/187854.

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

Council of Science Editors:

Jágr P. Hledání nejkratších cest grafem: The Shortest Graph's Pahts Finding. [Thesis]. Brno University of Technology; 2020. Available from: http://hdl.handle.net/11012/187854

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


Brno University of Technology

6. Jágr, Petr. Hledání nejkratších cest grafem: The Shortest Graph's Pahts Finding.

Degree: 2019, Brno University of Technology

 The aim of this thesis is finding, comparing and implementation of algorithms for finding the shortest paths between each of pairs of nodes in a… (more)

Subjects/Keywords: algoritmus; asymptotické vyjádření složitosti; Bellman-Fordův algoritmus; cesta; Dijkstrův algoritmus; dynamické programování; Floyd-Warshallův algoritmus; genetické algoritmy; heuristické algoritmy; hladové algoritmy; Java; nejkratší cesta; neorientovaný graf; ohodnocený graf; Omega; Omikron; orientovaný graf; paralelní algoritmy; plánování trasy; pravidelný graf; rekurzivní algoritmy; rozděl a panuj; sled; smyčka; souvislý graf; stupeň vrcholu; tah; teorie grafů; Theta; algorithm; asymptotic notation; Bellman-Ford algorithm; complete graph; degree of a vertex; Dijkstra's algorithm; directed graph; divide and conquer algorithms; dynamic programming; Floyd-Warshall algorithm; genetic algorithms; graph teory; greedy algorithms; heuristic algorithms; Java; loop; move; Omega; Omicron; paralel algorithms; path; path planning; recursive algorithms; regular graph; sequence; the shortest path; Theta; undirected graph; weighted graph

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Jágr, P. (2019). Hledání nejkratších cest grafem: The Shortest Graph's Pahts Finding. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/56214

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

Jágr, Petr. “Hledání nejkratších cest grafem: The Shortest Graph's Pahts Finding.” 2019. Thesis, Brno University of Technology. Accessed October 31, 2020. http://hdl.handle.net/11012/56214.

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

MLA Handbook (7th Edition):

Jágr, Petr. “Hledání nejkratších cest grafem: The Shortest Graph's Pahts Finding.” 2019. Web. 31 Oct 2020.

Vancouver:

Jágr P. Hledání nejkratších cest grafem: The Shortest Graph's Pahts Finding. [Internet] [Thesis]. Brno University of Technology; 2019. [cited 2020 Oct 31]. Available from: http://hdl.handle.net/11012/56214.

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

Council of Science Editors:

Jágr P. Hledání nejkratších cest grafem: The Shortest Graph's Pahts Finding. [Thesis]. Brno University of Technology; 2019. Available from: http://hdl.handle.net/11012/56214

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


Brno University of Technology

7. Matula, Radek. Grafická reprezentace grafů: Graphics Graph Representation.

Degree: 2018, Brno University of Technology

 This Master Thesis deals with the drawing algorithms of graphs known from the mathematical theory. These algorithms deals with an appropriate distribution of the graph… (more)

Subjects/Keywords: Teorie grafů; vrchol; hrana; ohodnocený graf; orientovaný graf; matice sousednosti; matice vzdáleností; matice incidence; Laplaceova matice; seznam sousedů; seznam vrcholů a hran; algoritmus High-Dimensional Embedding; algoritmus založený na silách; pružinový algoritmus; algoritmus Kamada-Kawai; algoritmus Fruchterman-Reingold; Graph theory; vertex; edge; edge-weighted graph; directed graph; adjacency matrix; distance matrix; incidence matrix; Laplacian matrix; list of neighbors; list of vertices and edges; mapping vertices on the circle; High-Dimensional Embedding algorithm; Force-based algorithm; Spring algorithm; Kamada-Kawai algorithm; Fruchterman-Reingold algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Matula, R. (2018). Grafická reprezentace grafů: Graphics Graph Representation. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/53896

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

Matula, Radek. “Grafická reprezentace grafů: Graphics Graph Representation.” 2018. Thesis, Brno University of Technology. Accessed October 31, 2020. http://hdl.handle.net/11012/53896.

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

MLA Handbook (7th Edition):

Matula, Radek. “Grafická reprezentace grafů: Graphics Graph Representation.” 2018. Web. 31 Oct 2020.

Vancouver:

Matula R. Grafická reprezentace grafů: Graphics Graph Representation. [Internet] [Thesis]. Brno University of Technology; 2018. [cited 2020 Oct 31]. Available from: http://hdl.handle.net/11012/53896.

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

Council of Science Editors:

Matula R. Grafická reprezentace grafů: Graphics Graph Representation. [Thesis]. Brno University of Technology; 2018. Available from: http://hdl.handle.net/11012/53896

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


Brno University of Technology

8. Kolář, Adam. Úloha obchodního cestujícího: Travelling Salesman Problem.

Degree: 2020, Brno University of Technology

 The aim of this bachelor's thesis is to design a testing environment for the traveling salesman problem and compare the effectiveness of different approaches to… (more)

Subjects/Keywords: úplný graf; Hamiltonovská kružnice; problém obchodního cestujícího; NP-úplný problém; Darwinova evoluční teorie; genetický drift; genetické algoritmy; mutace; křížení; fitness funkce; neuronové sítě; Kohonenova neuronová síť; Hopfieldova neuronová síť; Lyapunova funkce; entire graph; Hamiltonian cycle; travelling salesman problem; NP-complete problem; Darwin evolution theory; genetic drift; genetic algorithms; mutation; crossover; fitness function; neural network; Kohonen neural network; Hopfield neural network; Lyapunov function

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kolář, A. (2020). Úloha obchodního cestujícího: Travelling Salesman Problem. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/189676

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

Kolář, Adam. “Úloha obchodního cestujícího: Travelling Salesman Problem.” 2020. Thesis, Brno University of Technology. Accessed October 31, 2020. http://hdl.handle.net/11012/189676.

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

MLA Handbook (7th Edition):

Kolář, Adam. “Úloha obchodního cestujícího: Travelling Salesman Problem.” 2020. Web. 31 Oct 2020.

Vancouver:

Kolář A. Úloha obchodního cestujícího: Travelling Salesman Problem. [Internet] [Thesis]. Brno University of Technology; 2020. [cited 2020 Oct 31]. Available from: http://hdl.handle.net/11012/189676.

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

Council of Science Editors:

Kolář A. Úloha obchodního cestujícího: Travelling Salesman Problem. [Thesis]. Brno University of Technology; 2020. Available from: http://hdl.handle.net/11012/189676

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


Brno University of Technology

9. Kolář, Adam. Úloha obchodního cestujícího: Travelling Salesman Problem.

Degree: 2020, Brno University of Technology

 The aim of this bachelor's thesis is to design a testing environment for the traveling salesman problem and compare the effectiveness of different approaches to… (more)

Subjects/Keywords: úplný graf; Hamiltonovská kružnice; problém obchodního cestujícího; NP-úplný problém; Darwinova evoluční teorie; genetický drift; genetické algoritmy; mutace; křížení; fitness funkce; neuronové sítě; Kohonenova neuronová síť; Hopfieldova neuronová síť; Lyapunova funkce; entire graph; Hamiltonian cycle; travelling salesman problem; NP-complete problem; Darwin evolution theory; genetic drift; genetic algorithms; mutation; crossover; fitness function; neural network; Kohonen neural network; Hopfield neural network; Lyapunov function

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kolář, A. (2020). Úloha obchodního cestujícího: Travelling Salesman Problem. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/188241

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

Kolář, Adam. “Úloha obchodního cestujícího: Travelling Salesman Problem.” 2020. Thesis, Brno University of Technology. Accessed October 31, 2020. http://hdl.handle.net/11012/188241.

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

MLA Handbook (7th Edition):

Kolář, Adam. “Úloha obchodního cestujícího: Travelling Salesman Problem.” 2020. Web. 31 Oct 2020.

Vancouver:

Kolář A. Úloha obchodního cestujícího: Travelling Salesman Problem. [Internet] [Thesis]. Brno University of Technology; 2020. [cited 2020 Oct 31]. Available from: http://hdl.handle.net/11012/188241.

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

Council of Science Editors:

Kolář A. Úloha obchodního cestujícího: Travelling Salesman Problem. [Thesis]. Brno University of Technology; 2020. Available from: http://hdl.handle.net/11012/188241

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


Brno University of Technology

10. Kolář, Adam. Úloha obchodního cestujícího: Travelling Salesman Problem.

Degree: 2019, Brno University of Technology

 The aim of this bachelor's thesis is to design a testing environment for the traveling salesman problem and compare the effectiveness of different approaches to… (more)

Subjects/Keywords: úplný graf; Hamiltonovská kružnice; problém obchodního cestujícího; NP-úplný problém; Darwinova evoluční teorie; genetický drift; genetické algoritmy; mutace; křížení; fitness funkce; neuronové sítě; Kohonenova neuronová síť; Hopfieldova neuronová síť; Lyapunova funkce; entire graph; Hamiltonian cycle; travelling salesman problem; NP-complete problem; Darwin evolution theory; genetic drift; genetic algorithms; mutation; crossover; fitness function; neural network; Kohonen neural network; Hopfield neural network; Lyapunov function

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kolář, A. (2019). Úloha obchodního cestujícího: Travelling Salesman Problem. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/55643

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

Kolář, Adam. “Úloha obchodního cestujícího: Travelling Salesman Problem.” 2019. Thesis, Brno University of Technology. Accessed October 31, 2020. http://hdl.handle.net/11012/55643.

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

MLA Handbook (7th Edition):

Kolář, Adam. “Úloha obchodního cestujícího: Travelling Salesman Problem.” 2019. Web. 31 Oct 2020.

Vancouver:

Kolář A. Úloha obchodního cestujícího: Travelling Salesman Problem. [Internet] [Thesis]. Brno University of Technology; 2019. [cited 2020 Oct 31]. Available from: http://hdl.handle.net/11012/55643.

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

Council of Science Editors:

Kolář A. Úloha obchodního cestujícího: Travelling Salesman Problem. [Thesis]. Brno University of Technology; 2019. Available from: http://hdl.handle.net/11012/55643

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


Brno University of Technology

11. Hudec, Lukáš. Systémy dálkového měření v energetice: Systems for remote measurement in power engineering.

Degree: 2019, Brno University of Technology

 The work deals with the measurement and management in power. Provides an introduction to the problems of remote meter reading, management, and describes the current… (more)

Subjects/Keywords: HDO; AMR; AMI; AMM; chytré sítě; teorie grafů; graf; strom; hierarchická agregace; sběrná síť; koncentrace dat; sběr dat v energetice; Dijkstrův algoritmus; k-means; optimalizace sběru dat; Smart metering; Smart grid; MRC; AMR; AMI; AMM; graph theory; graph; tree; hierarchical aggregation; collection networks; data concentration; energy; Dijkstra's algorithm; k-means; optimization of data collection

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hudec, L. (2019). Systémy dálkového měření v energetice: Systems for remote measurement in power engineering. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/3694

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

Hudec, Lukáš. “Systémy dálkového měření v energetice: Systems for remote measurement in power engineering.” 2019. Thesis, Brno University of Technology. Accessed October 31, 2020. http://hdl.handle.net/11012/3694.

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

MLA Handbook (7th Edition):

Hudec, Lukáš. “Systémy dálkového měření v energetice: Systems for remote measurement in power engineering.” 2019. Web. 31 Oct 2020.

Vancouver:

Hudec L. Systémy dálkového měření v energetice: Systems for remote measurement in power engineering. [Internet] [Thesis]. Brno University of Technology; 2019. [cited 2020 Oct 31]. Available from: http://hdl.handle.net/11012/3694.

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

Council of Science Editors:

Hudec L. Systémy dálkového měření v energetice: Systems for remote measurement in power engineering. [Thesis]. Brno University of Technology; 2019. Available from: http://hdl.handle.net/11012/3694

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

.