Decomposability: queueing and computer system applications
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
New York [u.a.]
Acad. Press
1977
|
| Schriftenreihe: | ACM monograph series
|
| Schlagworte: | |
| Beschreibung: | XIII, 201 S. graph. Darst. |
| ISBN: | 012193750X |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV002275116 | ||
| 003 | DE-604 | ||
| 005 | 20140602 | ||
| 007 | t| | ||
| 008 | 890928s1977 xx d||| |||| 00||| eng d | ||
| 020 | |a 012193750X |9 0-12-193750-X | ||
| 035 | |a (OCoLC)251796159 | ||
| 035 | |a (DE-599)BVBBV002275116 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-12 |a DE-91G |a DE-384 |a DE-739 |a DE-824 |a DE-706 |a DE-83 |a DE-188 | ||
| 050 | 0 | |a QA402.2 | |
| 082 | 0 | |a 519.8/2 | |
| 084 | |a ST 136 |0 (DE-625)143591: |2 rvk | ||
| 084 | |a 60K25 |2 msc | ||
| 100 | 1 | |a Courtois, P. J. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Decomposability |b queueing and computer system applications |c P. J. Courtois |
| 264 | 1 | |a New York [u.a.] |b Acad. Press |c 1977 | |
| 300 | |a XIII, 201 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a ACM monograph series | |
| 650 | 4 | |a Décomposition (Méthode mathématique) | |
| 650 | 4 | |a Files d'attente, Théorie des | |
| 650 | 4 | |a Ordinateurs - Évaluation | |
| 650 | 7 | |a file attente |2 inriac | |
| 650 | 7 | |a méthode décomposition |2 inriac | |
| 650 | 7 | |a réseau file attente |2 inriac | |
| 650 | 7 | |a système complexe |2 inriac | |
| 650 | 7 | |a théorie file attente |2 inriac | |
| 650 | 7 | |a évaluation performance |2 inriac | |
| 650 | 4 | |a Decomposition method | |
| 650 | 4 | |a Electronic digital computers |x Evaluation | |
| 650 | 4 | |a Queuing theory | |
| 650 | 0 | 7 | |a Automatentheorie |0 (DE-588)4003953-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Modulare Programmierung |0 (DE-588)4120756-7 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Matrizenrechnung |0 (DE-588)4126963-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Warteschlange |0 (DE-588)4189150-8 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Automatentheorie |0 (DE-588)4003953-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Modulare Programmierung |0 (DE-588)4120756-7 |D s |
| 689 | 1 | |8 1\p |5 DE-604 | |
| 689 | 2 | 0 | |a Warteschlange |0 (DE-588)4189150-8 |D s |
| 689 | 2 | |8 2\p |5 DE-604 | |
| 689 | 3 | 0 | |a Matrizenrechnung |0 (DE-588)4126963-9 |D s |
| 689 | 3 | |8 3\p |5 DE-604 | |
| 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 | |
| 940 | 1 | |q TUB-www | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-001494455 | |
| 980 | 4 | |a (DE-12)AK04590155 | |
Datensatz im Suchindex
| _version_ | 1817704469394096128 |
|---|---|
| adam_text | |
| any_adam_object | |
| author | Courtois, P. J. |
| author_facet | Courtois, P. J. |
| author_role | aut |
| author_sort | Courtois, P. J. |
| author_variant | p j c pj pjc |
| building | Verbundindex |
| bvnumber | BV002275116 |
| callnumber-first | Q - Science |
| callnumber-label | QA402 |
| callnumber-raw | QA402.2 |
| callnumber-search | QA402.2 |
| callnumber-sort | QA 3402.2 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | ST 136 |
| ctrlnum | (OCoLC)251796159 (DE-599)BVBBV002275116 |
| dewey-full | 519.8/2 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 519 - Probabilities and applied mathematics |
| dewey-raw | 519.8/2 |
| dewey-search | 519.8/2 |
| dewey-sort | 3519.8 12 |
| dewey-tens | 510 - Mathematics |
| discipline | Informatik Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 c 4500</leader><controlfield tag="001">BV002275116</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20140602</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">890928s1977 xx d||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">012193750X</subfield><subfield code="9">0-12-193750-X</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)251796159</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV002275116</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-12</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-824</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-188</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA402.2</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">519.8/2</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 136</subfield><subfield code="0">(DE-625)143591:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">60K25</subfield><subfield code="2">msc</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Courtois, P. J.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Decomposability</subfield><subfield code="b">queueing and computer system applications</subfield><subfield code="c">P. J. Courtois</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York [u.a.]</subfield><subfield code="b">Acad. Press</subfield><subfield code="c">1977</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XIII, 201 S.</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">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="0" ind2=" "><subfield code="a">ACM monograph series</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Décomposition (Méthode mathématique)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Files d'attente, Théorie des</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Ordinateurs - Évaluation</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">file attente</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">méthode décomposition</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">réseau file attente</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">système complexe</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">théorie file attente</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">évaluation performance</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Decomposition method</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Electronic digital computers</subfield><subfield code="x">Evaluation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Queuing theory</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Automatentheorie</subfield><subfield code="0">(DE-588)4003953-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Modulare Programmierung</subfield><subfield code="0">(DE-588)4120756-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Matrizenrechnung</subfield><subfield code="0">(DE-588)4126963-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Warteschlange</subfield><subfield code="0">(DE-588)4189150-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Automatentheorie</subfield><subfield code="0">(DE-588)4003953-5</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">Modulare Programmierung</subfield><subfield code="0">(DE-588)4120756-7</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">Warteschlange</subfield><subfield code="0">(DE-588)4189150-8</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">Matrizenrechnung</subfield><subfield code="0">(DE-588)4126963-9</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="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="940" ind1="1" ind2=" "><subfield code="q">TUB-www</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-001494455</subfield></datafield><datafield tag="980" ind1="4" ind2=" "><subfield code="a">(DE-12)AK04590155</subfield></datafield></record></collection> |
| id | DE-604.BV002275116 |
| illustrated | Illustrated |
| indexdate | 2024-12-06T15:14:26Z |
| institution | BVB |
| isbn | 012193750X |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-001494455 |
| oclc_num | 251796159 |
| open_access_boolean | |
| owner | DE-12 DE-91G DE-BY-TUM DE-384 DE-739 DE-824 DE-706 DE-83 DE-188 |
| owner_facet | DE-12 DE-91G DE-BY-TUM DE-384 DE-739 DE-824 DE-706 DE-83 DE-188 |
| physical | XIII, 201 S. graph. Darst. |
| psigel | TUB-www |
| publishDate | 1977 |
| publishDateSearch | 1977 |
| publishDateSort | 1977 |
| publisher | Acad. Press |
| record_format | marc |
| series2 | ACM monograph series |
| spelling | Courtois, P. J. Verfasser aut Decomposability queueing and computer system applications P. J. Courtois New York [u.a.] Acad. Press 1977 XIII, 201 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier ACM monograph series Décomposition (Méthode mathématique) Files d'attente, Théorie des Ordinateurs - Évaluation file attente inriac méthode décomposition inriac réseau file attente inriac système complexe inriac théorie file attente inriac évaluation performance inriac Decomposition method Electronic digital computers Evaluation Queuing theory Automatentheorie (DE-588)4003953-5 gnd rswk-swf Modulare Programmierung (DE-588)4120756-7 gnd rswk-swf Matrizenrechnung (DE-588)4126963-9 gnd rswk-swf Warteschlange (DE-588)4189150-8 gnd rswk-swf Automatentheorie (DE-588)4003953-5 s DE-604 Modulare Programmierung (DE-588)4120756-7 s 1\p DE-604 Warteschlange (DE-588)4189150-8 s 2\p DE-604 Matrizenrechnung (DE-588)4126963-9 s 3\p DE-604 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 |
| spellingShingle | Courtois, P. J. Decomposability queueing and computer system applications Décomposition (Méthode mathématique) Files d'attente, Théorie des Ordinateurs - Évaluation file attente inriac méthode décomposition inriac réseau file attente inriac système complexe inriac théorie file attente inriac évaluation performance inriac Decomposition method Electronic digital computers Evaluation Queuing theory Automatentheorie (DE-588)4003953-5 gnd Modulare Programmierung (DE-588)4120756-7 gnd Matrizenrechnung (DE-588)4126963-9 gnd Warteschlange (DE-588)4189150-8 gnd |
| subject_GND | (DE-588)4003953-5 (DE-588)4120756-7 (DE-588)4126963-9 (DE-588)4189150-8 |
| title | Decomposability queueing and computer system applications |
| title_auth | Decomposability queueing and computer system applications |
| title_exact_search | Decomposability queueing and computer system applications |
| title_full | Decomposability queueing and computer system applications P. J. Courtois |
| title_fullStr | Decomposability queueing and computer system applications P. J. Courtois |
| title_full_unstemmed | Decomposability queueing and computer system applications P. J. Courtois |
| title_short | Decomposability |
| title_sort | decomposability queueing and computer system applications |
| title_sub | queueing and computer system applications |
| topic | Décomposition (Méthode mathématique) Files d'attente, Théorie des Ordinateurs - Évaluation file attente inriac méthode décomposition inriac réseau file attente inriac système complexe inriac théorie file attente inriac évaluation performance inriac Decomposition method Electronic digital computers Evaluation Queuing theory Automatentheorie (DE-588)4003953-5 gnd Modulare Programmierung (DE-588)4120756-7 gnd Matrizenrechnung (DE-588)4126963-9 gnd Warteschlange (DE-588)4189150-8 gnd |
| topic_facet | Décomposition (Méthode mathématique) Files d'attente, Théorie des Ordinateurs - Évaluation file attente méthode décomposition réseau file attente système complexe théorie file attente évaluation performance Decomposition method Electronic digital computers Evaluation Queuing theory Automatentheorie Modulare Programmierung Matrizenrechnung Warteschlange |
| work_keys_str_mv | AT courtoispj decomposabilityqueueingandcomputersystemapplications |