A Feasibility Problem Approach For Reachable Set Approximation:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Abschlussarbeit Buch |
| Sprache: | English |
| Veröffentlicht: |
2014
|
| Schlagworte: | |
| Online-Zugang: | Volltext Volltext |
| Beschreibung: | Online-Ausg. 2015 erschienen |
| Beschreibung: | III, 134 S. graph. Darst. CD-ROM (12 cm) |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV042699794 | ||
| 003 | DE-604 | ||
| 005 | 20181130 | ||
| 007 | t | ||
| 008 | 150717s2014 d||| m||| 00||| eng d | ||
| 035 | |a (OCoLC)914232642 | ||
| 035 | |a (DE-599)BVBBV042699794 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-384 |a DE-473 |a DE-703 |a DE-1051 |a DE-824 |a DE-29 |a DE-12 |a DE-91 |a DE-19 |a DE-1049 |a DE-92 |a DE-739 |a DE-898 |a DE-355 |a DE-706 |a DE-20 |a DE-1102 | ||
| 084 | |a SK 870 |0 (DE-625)143265: |2 rvk | ||
| 100 | 1 | |a Jahn, Thomas |e Verfasser |0 (DE-588)1172523029 |4 aut | |
| 245 | 1 | 0 | |a A Feasibility Problem Approach For Reachable Set Approximation |c von Thomas Jahn |
| 264 | 1 | |c 2014 | |
| 300 | |a III, 134 S. |b graph. Darst. |e CD-ROM (12 cm) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 500 | |a Online-Ausg. 2015 erschienen | ||
| 502 | |a Bayreuth, Univ., Diss., 2014 | ||
| 650 | 0 | 7 | |a Innere-Punkte-Methode |0 (DE-588)4352322-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Parallelverarbeitung |0 (DE-588)4075860-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Erreichbarkeitsmenge |0 (DE-588)4411406-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Optimale Kontrolle |0 (DE-588)4121428-6 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Erreichbarkeitsmenge |0 (DE-588)4411406-0 |D s |
| 689 | 0 | 1 | |a Optimale Kontrolle |0 (DE-588)4121428-6 |D s |
| 689 | 0 | 2 | |a Innere-Punkte-Methode |0 (DE-588)4352322-5 |D s |
| 689 | 0 | 3 | |a Parallelverarbeitung |0 (DE-588)4075860-6 |D s |
| 689 | 0 | |5 DE-604 | |
| 776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |o urn:nbn:de:bvb:703-epub-2087-4 |
| 856 | 4 | 1 | |u https://nbn-resolving.org/urn:nbn:de:bvb:703-epub-2087-4 |x Resolving-System |z kostenfrei |3 Volltext |
| 856 | 4 | 1 | |u https://epub.uni-bayreuth.de/2087/ |x Verlag |z kostenfrei |3 Volltext |
| 912 | |a ebook | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-028131316 | ||
Datensatz im Suchindex
| _version_ | 1804174897555963904 |
|---|---|
| any_adam_object | |
| author | Jahn, Thomas |
| author_GND | (DE-588)1172523029 |
| author_facet | Jahn, Thomas |
| author_role | aut |
| author_sort | Jahn, Thomas |
| author_variant | t j tj |
| building | Verbundindex |
| bvnumber | BV042699794 |
| classification_rvk | SK 870 |
| collection | ebook |
| ctrlnum | (OCoLC)914232642 (DE-599)BVBBV042699794 |
| discipline | Mathematik |
| format | Thesis Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01869nam a2200445 c 4500</leader><controlfield tag="001">BV042699794</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20181130 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">150717s2014 d||| m||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)914232642</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV042699794</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-384</subfield><subfield code="a">DE-473</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-1051</subfield><subfield code="a">DE-824</subfield><subfield code="a">DE-29</subfield><subfield code="a">DE-12</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-1049</subfield><subfield code="a">DE-92</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-898</subfield><subfield code="a">DE-355</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-1102</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 870</subfield><subfield code="0">(DE-625)143265:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Jahn, Thomas</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1172523029</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A Feasibility Problem Approach For Reachable Set Approximation</subfield><subfield code="c">von Thomas Jahn</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2014</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">III, 134 S.</subfield><subfield code="b">graph. Darst.</subfield><subfield code="e">CD-ROM (12 cm)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Online-Ausg. 2015 erschienen</subfield></datafield><datafield tag="502" ind1=" " ind2=" "><subfield code="a">Bayreuth, Univ., Diss., 2014</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Innere-Punkte-Methode</subfield><subfield code="0">(DE-588)4352322-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Parallelverarbeitung</subfield><subfield code="0">(DE-588)4075860-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Erreichbarkeitsmenge</subfield><subfield code="0">(DE-588)4411406-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Optimale Kontrolle</subfield><subfield code="0">(DE-588)4121428-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Erreichbarkeitsmenge</subfield><subfield code="0">(DE-588)4411406-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Optimale Kontrolle</subfield><subfield code="0">(DE-588)4121428-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Innere-Punkte-Methode</subfield><subfield code="0">(DE-588)4352322-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="3"><subfield code="a">Parallelverarbeitung</subfield><subfield code="0">(DE-588)4075860-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Online-Ausgabe</subfield><subfield code="o">urn:nbn:de:bvb:703-epub-2087-4</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://nbn-resolving.org/urn:nbn:de:bvb:703-epub-2087-4</subfield><subfield code="x">Resolving-System</subfield><subfield code="z">kostenfrei</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://epub.uni-bayreuth.de/2087/</subfield><subfield code="x">Verlag</subfield><subfield code="z">kostenfrei</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ebook</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-028131316</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV042699794 |
| illustrated | Illustrated |
| indexdate | 2024-07-10T07:07:42Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-028131316 |
| oclc_num | 914232642 |
| open_access_boolean | 1 |
| owner | DE-384 DE-473 DE-BY-UBG DE-703 DE-1051 DE-824 DE-29 DE-12 DE-91 DE-BY-TUM DE-19 DE-BY-UBM DE-1049 DE-92 DE-739 DE-898 DE-BY-UBR DE-355 DE-BY-UBR DE-706 DE-20 DE-1102 |
| owner_facet | DE-384 DE-473 DE-BY-UBG DE-703 DE-1051 DE-824 DE-29 DE-12 DE-91 DE-BY-TUM DE-19 DE-BY-UBM DE-1049 DE-92 DE-739 DE-898 DE-BY-UBR DE-355 DE-BY-UBR DE-706 DE-20 DE-1102 |
| physical | III, 134 S. graph. Darst. CD-ROM (12 cm) |
| psigel | ebook |
| publishDate | 2014 |
| publishDateSearch | 2014 |
| publishDateSort | 2014 |
| record_format | marc |
| spelling | Jahn, Thomas Verfasser (DE-588)1172523029 aut A Feasibility Problem Approach For Reachable Set Approximation von Thomas Jahn 2014 III, 134 S. graph. Darst. CD-ROM (12 cm) txt rdacontent n rdamedia nc rdacarrier Online-Ausg. 2015 erschienen Bayreuth, Univ., Diss., 2014 Innere-Punkte-Methode (DE-588)4352322-5 gnd rswk-swf Parallelverarbeitung (DE-588)4075860-6 gnd rswk-swf Erreichbarkeitsmenge (DE-588)4411406-0 gnd rswk-swf Optimale Kontrolle (DE-588)4121428-6 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Erreichbarkeitsmenge (DE-588)4411406-0 s Optimale Kontrolle (DE-588)4121428-6 s Innere-Punkte-Methode (DE-588)4352322-5 s Parallelverarbeitung (DE-588)4075860-6 s DE-604 Erscheint auch als Online-Ausgabe urn:nbn:de:bvb:703-epub-2087-4 https://nbn-resolving.org/urn:nbn:de:bvb:703-epub-2087-4 Resolving-System kostenfrei Volltext https://epub.uni-bayreuth.de/2087/ Verlag kostenfrei Volltext |
| spellingShingle | Jahn, Thomas A Feasibility Problem Approach For Reachable Set Approximation Innere-Punkte-Methode (DE-588)4352322-5 gnd Parallelverarbeitung (DE-588)4075860-6 gnd Erreichbarkeitsmenge (DE-588)4411406-0 gnd Optimale Kontrolle (DE-588)4121428-6 gnd |
| subject_GND | (DE-588)4352322-5 (DE-588)4075860-6 (DE-588)4411406-0 (DE-588)4121428-6 (DE-588)4113937-9 |
| title | A Feasibility Problem Approach For Reachable Set Approximation |
| title_auth | A Feasibility Problem Approach For Reachable Set Approximation |
| title_exact_search | A Feasibility Problem Approach For Reachable Set Approximation |
| title_full | A Feasibility Problem Approach For Reachable Set Approximation von Thomas Jahn |
| title_fullStr | A Feasibility Problem Approach For Reachable Set Approximation von Thomas Jahn |
| title_full_unstemmed | A Feasibility Problem Approach For Reachable Set Approximation von Thomas Jahn |
| title_short | A Feasibility Problem Approach For Reachable Set Approximation |
| title_sort | a feasibility problem approach for reachable set approximation |
| topic | Innere-Punkte-Methode (DE-588)4352322-5 gnd Parallelverarbeitung (DE-588)4075860-6 gnd Erreichbarkeitsmenge (DE-588)4411406-0 gnd Optimale Kontrolle (DE-588)4121428-6 gnd |
| topic_facet | Innere-Punkte-Methode Parallelverarbeitung Erreichbarkeitsmenge Optimale Kontrolle Hochschulschrift |
| url | https://nbn-resolving.org/urn:nbn:de:bvb:703-epub-2087-4 https://epub.uni-bayreuth.de/2087/ |
| work_keys_str_mv | AT jahnthomas afeasibilityproblemapproachforreachablesetapproximation |