Advanced search options

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

You searched for `subject:(Time Space Graph)`

.
Showing records 1 – 5 of
5 total matches.

▼ Search Limiters

Delft University of Technology

1. Kalicharan, Kishan (author). Intermodal Transport: Routing Vehicles and Scheduling Containers.

Degree: 2018, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:6a99a2a6-ae1d-4355-95db-363f8a399a12

►

In intermodal transport multiple types of vehicles are used to transport containers. If the routes of the vehicles are known, then the container allocation can… (more)

Subjects/Keywords: Branch and Bound; Cutting Plane; Multicommodity Flow; Intermodal Transport; Time-Space Graph; Network Design; Min Cost Flow; Column Generating; Local search algorithm; fix; fixed-charge; capacitated; Container; Barges; Reductions; ILP

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kalicharan, K. (. (2018). Intermodal Transport: Routing Vehicles and Scheduling Containers. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:6a99a2a6-ae1d-4355-95db-363f8a399a12

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

Kalicharan, Kishan (author). “Intermodal Transport: Routing Vehicles and Scheduling Containers.” 2018. Masters Thesis, Delft University of Technology. Accessed December 03, 2020. http://resolver.tudelft.nl/uuid:6a99a2a6-ae1d-4355-95db-363f8a399a12.

MLA Handbook (7^{th} Edition):

Kalicharan, Kishan (author). “Intermodal Transport: Routing Vehicles and Scheduling Containers.” 2018. Web. 03 Dec 2020.

Vancouver:

Kalicharan K(. Intermodal Transport: Routing Vehicles and Scheduling Containers. [Internet] [Masters thesis]. Delft University of Technology; 2018. [cited 2020 Dec 03]. Available from: http://resolver.tudelft.nl/uuid:6a99a2a6-ae1d-4355-95db-363f8a399a12.

Council of Science Editors:

Kalicharan K(. Intermodal Transport: Routing Vehicles and Scheduling Containers. [Masters Thesis]. Delft University of Technology; 2018. Available from: http://resolver.tudelft.nl/uuid:6a99a2a6-ae1d-4355-95db-363f8a399a12

University of Illinois – Urbana-Champaign

2. Howard, Christian Joseph. Spacetime meshing of stratified spaces for spacetime discontinuous Galerkin methods in arbitrary spatial dimensions.

Degree: MS, Computer Science, 2019, University of Illinois – Urbana-Champaign

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

► We introduce the spacetime discontinuous Galerkin method and motivate the need for supporting spacetime meshing on meshes comprised of multiple manifolds. We first discuss preliminary…
(more)

Subjects/Keywords: computer science; graph; computational; geometry; computational geometry; topology; homology; simplex; simplices; complexes; simplicial homology; data structures; data structure; algorithm; algorithms; spacetime; space-time; finite element; galerkin; meshing; stratified spaces; discontinuous; cpp; C++; hyperbolic; partial differential equations; differential equations; numerical methods; generics; metaprogramming

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Howard, C. J. (2019). Spacetime meshing of stratified spaces for spacetime discontinuous Galerkin methods in arbitrary spatial dimensions. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/104936

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

Howard, Christian Joseph. “Spacetime meshing of stratified spaces for spacetime discontinuous Galerkin methods in arbitrary spatial dimensions.” 2019. Thesis, University of Illinois – Urbana-Champaign. Accessed December 03, 2020. http://hdl.handle.net/2142/104936.

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Howard, Christian Joseph. “Spacetime meshing of stratified spaces for spacetime discontinuous Galerkin methods in arbitrary spatial dimensions.” 2019. Web. 03 Dec 2020.

Vancouver:

Howard CJ. Spacetime meshing of stratified spaces for spacetime discontinuous Galerkin methods in arbitrary spatial dimensions. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2019. [cited 2020 Dec 03]. Available from: http://hdl.handle.net/2142/104936.

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

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Howard CJ. Spacetime meshing of stratified spaces for spacetime discontinuous Galerkin methods in arbitrary spatial dimensions. [Thesis]. University of Illinois – Urbana-Champaign; 2019. Available from: http://hdl.handle.net/2142/104936

Not specified: Masters Thesis or Doctoral Dissertation

Indian Institute of Science

3. Vijayvaradharaj, T M. Network Coding for Wirless Relaying and Wireline Networks.

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

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

► Network coding has emerged as an attractive alternative to routing because of the through put improvement it provides by reducing the number of channel uses.…
(more)

Subjects/Keywords: Network Coding; Telecommunication Engineering; Coding Theory; Wireless Relaying; Wireline Networks; Multi-User Multiple Access Relay Channel (MARC); Physical Layer Network Coding (PNC); Distributed Space Time Coding (DSTC); Index Coding; Discrete Polymatroids; Latin Squares; Wireless Two-way Relaying; Graph Vertex Coloring; Adaptive Physical Layer Network Coding; Linear Network Coding; Wireless Network Coding; MIMO Two-way Relaying; Communication Engineering

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Vijayvaradharaj, T. M. (2017). Network Coding for Wirless Relaying and Wireline Networks. (Doctoral Dissertation). Indian Institute of Science. Retrieved from http://etd.iisc.ac.in/handle/2005/2892

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

Vijayvaradharaj, T M. “Network Coding for Wirless Relaying and Wireline Networks.” 2017. Doctoral Dissertation, Indian Institute of Science. Accessed December 03, 2020. http://etd.iisc.ac.in/handle/2005/2892.

MLA Handbook (7^{th} Edition):

Vijayvaradharaj, T M. “Network Coding for Wirless Relaying and Wireline Networks.” 2017. Web. 03 Dec 2020.

Vancouver:

Vijayvaradharaj TM. Network Coding for Wirless Relaying and Wireline Networks. [Internet] [Doctoral dissertation]. Indian Institute of Science; 2017. [cited 2020 Dec 03]. Available from: http://etd.iisc.ac.in/handle/2005/2892.

Council of Science Editors:

Vijayvaradharaj TM. Network Coding for Wirless Relaying and Wireline Networks. [Doctoral Dissertation]. Indian Institute of Science; 2017. Available from: http://etd.iisc.ac.in/handle/2005/2892

Brno University of Technology

4. Kopřiva, Jan. Srovnání algoritmů při řešení problému obchodního cestujícího: The Comparison of the Algorithms for the Solution of Travel Sales Problem.

Degree: 2019, Brno University of Technology

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

► The Master Thesis deals with logistic module innovation of information system ERP. The principle of innovation is based on implementation of heuristic algorithms which solve…
(more)

Subjects/Keywords: Problém obchodního cestujícího; Turingův stroj; časová a prostorová složitost problému; polynomialní složitost; deterministický a nedeterministický algoritmus; orientovaný a neorientovaný graf; software MATLAB; P-těžké problémy; N-těžké problémy; NP-úplné problémy; algoritmus Hill climbing; algoritmus Tabu search; alogritmus Exhause search; algoritmus Random search; algoritmus Greedy; algoritmus Backtracking; algoritmus Simultal anheling; algoritmus Genetic search; algoritmus Ant Colony; algoritmus Particle swarms; Travel salesman problem; Turing machine; time and space complexity; polynomial time; deterministic and nondeterministic algorithm; directed and undirected graph; software MATLAB; P-hard; N-hard; NP-complete problem; alogrithm Hill climbing; algorithm Tabu search; algorithm Exhause search; algorithm Random search; algoritm Greedy; algorithm Backtracking; algorithm Simultal anheling; Genetic algorithm; algorithm Ant Colony algorithm; algoritm Particle swarms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kopřiva, J. (2019). Srovnání algoritmů při řešení problému obchodního cestujícího: The Comparison of the Algorithms for the Solution of Travel Sales Problem. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/4355

Not specified: Masters Thesis or Doctoral Dissertation

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

Kopřiva, Jan. “Srovnání algoritmů při řešení problému obchodního cestujícího: The Comparison of the Algorithms for the Solution of Travel Sales Problem.” 2019. Thesis, Brno University of Technology. Accessed December 03, 2020. http://hdl.handle.net/11012/4355.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Kopřiva, Jan. “Srovnání algoritmů při řešení problému obchodního cestujícího: The Comparison of the Algorithms for the Solution of Travel Sales Problem.” 2019. Web. 03 Dec 2020.

Vancouver:

Kopřiva J. Srovnání algoritmů při řešení problému obchodního cestujícího: The Comparison of the Algorithms for the Solution of Travel Sales Problem. [Internet] [Thesis]. Brno University of Technology; 2019. [cited 2020 Dec 03]. Available from: http://hdl.handle.net/11012/4355.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kopřiva J. Srovnání algoritmů při řešení problému obchodního cestujícího: The Comparison of the Algorithms for the Solution of Travel Sales Problem. [Thesis]. Brno University of Technology; 2019. Available from: http://hdl.handle.net/11012/4355

Not specified: Masters Thesis or Doctoral Dissertation

5. Emanuelsson, Kristoffer. Approximating multi-commodity max-flow in practice.

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

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

►

Garg and Könemann developed a framework for computing multi-commodity maximum flow in a *graph*, later called a multiplicative weight update framework. Madry used this…
(more)

Subjects/Keywords: multi-commodity; maximum flow; max flow; flow; multicommodity; approximation; schemes; framework; dynamic graph; dynamic; ES-tree; complexity; space; time; Madry; multicommodity; maximum flöde; max flöde; flöde; approximering; framework; dynamiska grafer; graf; dynamiskgraf; ES-träd; tidskomplexitet; komplexitet; minneskomplexitet; Madry; Computer Sciences; Datavetenskap (datalogi)

…dynamic *graph* that has a slightly worse *time* complexity.
We compared the two algorithms from… …all
update requests on the *graph*. Throughout this paper, if the context is clear, the
*time*… …*graph* is modified
(i.e., each *time* Line 7 is executed in Algorithm 1). The data… …2.15 *Space* complexity . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
23
3 Method… …3.2
Implementing the dynamic *graph* structure . . . . . . . . . . . . . .
27
3.2.1…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Emanuelsson, K. (2016). Approximating multi-commodity max-flow in practice. (Thesis). KTH. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-184193

Not specified: Masters Thesis or Doctoral Dissertation

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

Emanuelsson, Kristoffer. “Approximating multi-commodity max-flow in practice.” 2016. Thesis, KTH. Accessed December 03, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-184193.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Emanuelsson, Kristoffer. “Approximating multi-commodity max-flow in practice.” 2016. Web. 03 Dec 2020.

Vancouver:

Emanuelsson K. Approximating multi-commodity max-flow in practice. [Internet] [Thesis]. KTH; 2016. [cited 2020 Dec 03]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-184193.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Emanuelsson K. Approximating multi-commodity max-flow in practice. [Thesis]. KTH; 2016. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-184193

Not specified: Masters Thesis or Doctoral Dissertation