An algorithm for finding a query which discriminates competing hypotheses:
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Tokyo, Japan
1985
|
| Schriftenreihe: | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report
143 |
| Schlagworte: | |
| Beschreibung: | 10 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010925587 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 960903s1985 |||| 00||| engod | ||
| 035 | |a (OCoLC)14557020 | ||
| 035 | |a (DE-599)BVBBV010925587 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Seki, Hirohisa |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a An algorithm for finding a query which discriminates competing hypotheses |c by Hirohisa Seki and Akikazu Takeuchi |
| 264 | 1 | |a Tokyo, Japan |c 1985 | |
| 300 | |a 10 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |v 143 | |
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Induction (Mathematics) | |
| 700 | 1 | |a Takeuchi, Akikazu |e Verfasser |4 aut | |
| 830 | 0 | |a Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |v 143 |w (DE-604)BV010923438 |9 143 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007308626 | ||
Datensatz im Suchindex
| _version_ | 1804125416598798336 |
|---|---|
| any_adam_object | |
| author | Seki, Hirohisa Takeuchi, Akikazu |
| author_facet | Seki, Hirohisa Takeuchi, Akikazu |
| author_role | aut aut |
| author_sort | Seki, Hirohisa |
| author_variant | h s hs a t at |
| building | Verbundindex |
| bvnumber | BV010925587 |
| ctrlnum | (OCoLC)14557020 (DE-599)BVBBV010925587 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01035nam a2200301 cb4500</leader><controlfield tag="001">BV010925587</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960903s1985 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)14557020</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010925587</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Seki, Hirohisa</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">An algorithm for finding a query which discriminates competing hypotheses</subfield><subfield code="c">by Hirohisa Seki and Akikazu Takeuchi</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Tokyo, Japan</subfield><subfield code="c">1985</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">10 S.</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="490" ind1="1" ind2=" "><subfield code="a">Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report</subfield><subfield code="v">143</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Induction (Mathematics)</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Takeuchi, Akikazu</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report</subfield><subfield code="v">143</subfield><subfield code="w">(DE-604)BV010923438</subfield><subfield code="9">143</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007308626</subfield></datafield></record></collection> |
| id | DE-604.BV010925587 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:01:13Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007308626 |
| oclc_num | 14557020 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 10 S. |
| publishDate | 1985 |
| publishDateSearch | 1985 |
| publishDateSort | 1985 |
| record_format | marc |
| series | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |
| series2 | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |
| spelling | Seki, Hirohisa Verfasser aut An algorithm for finding a query which discriminates competing hypotheses by Hirohisa Seki and Akikazu Takeuchi Tokyo, Japan 1985 10 S. txt rdacontent n rdamedia nc rdacarrier Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 143 Algorithms Induction (Mathematics) Takeuchi, Akikazu Verfasser aut Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 143 (DE-604)BV010923438 143 |
| spellingShingle | Seki, Hirohisa Takeuchi, Akikazu An algorithm for finding a query which discriminates competing hypotheses Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report Algorithms Induction (Mathematics) |
| title | An algorithm for finding a query which discriminates competing hypotheses |
| title_auth | An algorithm for finding a query which discriminates competing hypotheses |
| title_exact_search | An algorithm for finding a query which discriminates competing hypotheses |
| title_full | An algorithm for finding a query which discriminates competing hypotheses by Hirohisa Seki and Akikazu Takeuchi |
| title_fullStr | An algorithm for finding a query which discriminates competing hypotheses by Hirohisa Seki and Akikazu Takeuchi |
| title_full_unstemmed | An algorithm for finding a query which discriminates competing hypotheses by Hirohisa Seki and Akikazu Takeuchi |
| title_short | An algorithm for finding a query which discriminates competing hypotheses |
| title_sort | an algorithm for finding a query which discriminates competing hypotheses |
| topic | Algorithms Induction (Mathematics) |
| topic_facet | Algorithms Induction (Mathematics) |
| volume_link | (DE-604)BV010923438 |
| work_keys_str_mv | AT sekihirohisa analgorithmforfindingaquerywhichdiscriminatescompetinghypotheses AT takeuchiakikazu analgorithmforfindingaquerywhichdiscriminatescompetinghypotheses |