Divide and conquer in game tree search: algorithms, software and case studies
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Abschlussarbeit Mikrofilm Buch |
Sprache: | English |
Veröffentlicht: |
2001
|
Ausgabe: | [Mikrofiche-Ausg.] |
Schlagworte: | |
Beschreibung: | 121 Bl. graph. Darst. |
Internformat
MARC
LEADER | 00000nam a2200000 c 4500 | ||
---|---|---|---|
001 | BV024494590 | ||
003 | DE-604 | ||
005 | 20090910 | ||
007 | he|uuuuuuuucu | ||
008 | 090924s2001 d||| bm||| 00||| eng d | ||
035 | |a (OCoLC)916605409 | ||
035 | |a (DE-599)BVBBV024494590 | ||
040 | |a DE-604 |b ger |e rakwb | ||
041 | 0 | |a eng | |
049 | |a DE-83 | ||
100 | 1 | |a Mäser, Fabian |e Verfasser |4 aut | |
245 | 1 | 0 | |a Divide and conquer in game tree search |b algorithms, software and case studies |c presented by Fabian Mäser |
250 | |a [Mikrofiche-Ausg.] | ||
264 | 1 | |c 2001 | |
300 | |a 121 Bl. |b graph. Darst. | ||
336 | |b txt |2 rdacontent | ||
337 | |b h |2 rdamedia | ||
338 | |b he |2 rdacarrier | ||
502 | |a Zürich, Eidgenöss. Techn. Hochsch., Diss. | ||
533 | |a Mikrofiche-Ausgabe |n 2 Mikrofiches | ||
650 | 0 | 7 | |a Mikroform |0 (DE-588)4039216-8 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Computerspiel |0 (DE-588)4010457-6 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Spielbaum-Suchverfahren |0 (DE-588)4206785-6 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Kombinatorisches Spiel |0 (DE-588)4164753-1 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Software |0 (DE-588)4055382-6 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Spieltheorie |0 (DE-588)4056243-8 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Divide-and-conquer-Verfahren |0 (DE-588)4291466-8 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
689 | 0 | 0 | |a Divide-and-conquer-Verfahren |0 (DE-588)4291466-8 |D s |
689 | 0 | 1 | |a Kombinatorisches Spiel |0 (DE-588)4164753-1 |D s |
689 | 0 | 2 | |a Mikroform |0 (DE-588)4039216-8 |D s |
689 | 0 | |5 DE-604 | |
689 | 1 | 0 | |a Spieltheorie |0 (DE-588)4056243-8 |D s |
689 | 1 | |8 1\p |5 DE-604 | |
689 | 2 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
689 | 2 | |8 2\p |5 DE-604 | |
689 | 3 | 0 | |a Spielbaum-Suchverfahren |0 (DE-588)4206785-6 |D s |
689 | 3 | |8 3\p |5 DE-604 | |
689 | 4 | 0 | |a Software |0 (DE-588)4055382-6 |D s |
689 | 4 | |8 4\p |5 DE-604 | |
689 | 5 | 0 | |a Computerspiel |0 (DE-588)4010457-6 |D s |
689 | 5 | |8 5\p |5 DE-604 | |
776 | 0 | 8 | |i Reproduktion von |a Mäser, Fabian |t Divide and conquer in game tree search |d 2001 |
999 | |a oai:aleph.bib-bvb.de:BVB01-018469608 | ||
883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
883 | 1 | |8 2\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
883 | 1 | |8 3\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
883 | 1 | |8 4\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
883 | 1 | |8 5\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk |
Datensatz im Suchindex
_version_ | 1804140488948711424 |
---|---|
any_adam_object | |
author | Mäser, Fabian |
author_facet | Mäser, Fabian |
author_role | aut |
author_sort | Mäser, Fabian |
author_variant | f m fm |
building | Verbundindex |
bvnumber | BV024494590 |
ctrlnum | (OCoLC)916605409 (DE-599)BVBBV024494590 |
edition | [Mikrofiche-Ausg.] |
format | Thesis Microfilm Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02569nam a2200625 c 4500</leader><controlfield tag="001">BV024494590</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20090910 </controlfield><controlfield tag="007">he|uuuuuuuucu</controlfield><controlfield tag="008">090924s2001 d||| bm||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)916605409</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV024494590</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-83</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Mäser, Fabian</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Divide and conquer in game tree search</subfield><subfield code="b">algorithms, software and case studies</subfield><subfield code="c">presented by Fabian Mäser</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">[Mikrofiche-Ausg.]</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2001</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">121 Bl.</subfield><subfield code="b">graph. Darst.</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">h</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">he</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="502" ind1=" " ind2=" "><subfield code="a">Zürich, Eidgenöss. Techn. Hochsch., Diss.</subfield></datafield><datafield tag="533" ind1=" " ind2=" "><subfield code="a">Mikrofiche-Ausgabe</subfield><subfield code="n">2 Mikrofiches</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Mikroform</subfield><subfield code="0">(DE-588)4039216-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Computerspiel</subfield><subfield code="0">(DE-588)4010457-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Spielbaum-Suchverfahren</subfield><subfield code="0">(DE-588)4206785-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Kombinatorisches Spiel</subfield><subfield code="0">(DE-588)4164753-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Software</subfield><subfield code="0">(DE-588)4055382-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Spieltheorie</subfield><subfield code="0">(DE-588)4056243-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Divide-and-conquer-Verfahren</subfield><subfield code="0">(DE-588)4291466-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</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">Divide-and-conquer-Verfahren</subfield><subfield code="0">(DE-588)4291466-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Kombinatorisches Spiel</subfield><subfield code="0">(DE-588)4164753-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Mikroform</subfield><subfield code="0">(DE-588)4039216-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Spieltheorie</subfield><subfield code="0">(DE-588)4056243-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="3" ind2="0"><subfield code="a">Spielbaum-Suchverfahren</subfield><subfield code="0">(DE-588)4206785-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2=" "><subfield code="8">3\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="4" ind2="0"><subfield code="a">Software</subfield><subfield code="0">(DE-588)4055382-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="4" ind2=" "><subfield code="8">4\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="5" ind2="0"><subfield code="a">Computerspiel</subfield><subfield code="0">(DE-588)4010457-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="5" ind2=" "><subfield code="8">5\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Reproduktion von</subfield><subfield code="a">Mäser, Fabian</subfield><subfield code="t">Divide and conquer in game tree search</subfield><subfield code="d">2001</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-018469608</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">3\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">4\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">5\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield></record></collection> |
genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
genre_facet | Hochschulschrift |
id | DE-604.BV024494590 |
illustrated | Illustrated |
indexdate | 2024-07-09T22:00:47Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-018469608 |
oclc_num | 916605409 |
open_access_boolean | |
owner | DE-83 |
owner_facet | DE-83 |
physical | 121 Bl. graph. Darst. |
publishDate | 2001 |
publishDateSearch | 2001 |
publishDateSort | 2001 |
record_format | marc |
spelling | Mäser, Fabian Verfasser aut Divide and conquer in game tree search algorithms, software and case studies presented by Fabian Mäser [Mikrofiche-Ausg.] 2001 121 Bl. graph. Darst. txt rdacontent h rdamedia he rdacarrier Zürich, Eidgenöss. Techn. Hochsch., Diss. Mikrofiche-Ausgabe 2 Mikrofiches Mikroform (DE-588)4039216-8 gnd rswk-swf Computerspiel (DE-588)4010457-6 gnd rswk-swf Spielbaum-Suchverfahren (DE-588)4206785-6 gnd rswk-swf Kombinatorisches Spiel (DE-588)4164753-1 gnd rswk-swf Software (DE-588)4055382-6 gnd rswk-swf Spieltheorie (DE-588)4056243-8 gnd rswk-swf Divide-and-conquer-Verfahren (DE-588)4291466-8 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Divide-and-conquer-Verfahren (DE-588)4291466-8 s Kombinatorisches Spiel (DE-588)4164753-1 s Mikroform (DE-588)4039216-8 s DE-604 Spieltheorie (DE-588)4056243-8 s 1\p DE-604 Algorithmus (DE-588)4001183-5 s 2\p DE-604 Spielbaum-Suchverfahren (DE-588)4206785-6 s 3\p DE-604 Software (DE-588)4055382-6 s 4\p DE-604 Computerspiel (DE-588)4010457-6 s 5\p DE-604 Reproduktion von Mäser, Fabian Divide and conquer in game tree search 2001 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 3\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 4\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 5\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
spellingShingle | Mäser, Fabian Divide and conquer in game tree search algorithms, software and case studies Mikroform (DE-588)4039216-8 gnd Computerspiel (DE-588)4010457-6 gnd Spielbaum-Suchverfahren (DE-588)4206785-6 gnd Kombinatorisches Spiel (DE-588)4164753-1 gnd Software (DE-588)4055382-6 gnd Spieltheorie (DE-588)4056243-8 gnd Divide-and-conquer-Verfahren (DE-588)4291466-8 gnd Algorithmus (DE-588)4001183-5 gnd |
subject_GND | (DE-588)4039216-8 (DE-588)4010457-6 (DE-588)4206785-6 (DE-588)4164753-1 (DE-588)4055382-6 (DE-588)4056243-8 (DE-588)4291466-8 (DE-588)4001183-5 (DE-588)4113937-9 |
title | Divide and conquer in game tree search algorithms, software and case studies |
title_auth | Divide and conquer in game tree search algorithms, software and case studies |
title_exact_search | Divide and conquer in game tree search algorithms, software and case studies |
title_full | Divide and conquer in game tree search algorithms, software and case studies presented by Fabian Mäser |
title_fullStr | Divide and conquer in game tree search algorithms, software and case studies presented by Fabian Mäser |
title_full_unstemmed | Divide and conquer in game tree search algorithms, software and case studies presented by Fabian Mäser |
title_short | Divide and conquer in game tree search |
title_sort | divide and conquer in game tree search algorithms software and case studies |
title_sub | algorithms, software and case studies |
topic | Mikroform (DE-588)4039216-8 gnd Computerspiel (DE-588)4010457-6 gnd Spielbaum-Suchverfahren (DE-588)4206785-6 gnd Kombinatorisches Spiel (DE-588)4164753-1 gnd Software (DE-588)4055382-6 gnd Spieltheorie (DE-588)4056243-8 gnd Divide-and-conquer-Verfahren (DE-588)4291466-8 gnd Algorithmus (DE-588)4001183-5 gnd |
topic_facet | Mikroform Computerspiel Spielbaum-Suchverfahren Kombinatorisches Spiel Software Spieltheorie Divide-and-conquer-Verfahren Algorithmus Hochschulschrift |
work_keys_str_mv | AT maserfabian divideandconqueringametreesearchalgorithmssoftwareandcasestudies |