Ihre E-Mail wurde erfolgreich gesendet. Bitte prüfen Sie Ihren Maileingang.

Leider ist ein Fehler beim E-Mail-Versand aufgetreten. Bitte versuchen Sie es erneut.

Vorgang fortführen?

Exportieren
  • 1
    UID:
    almafu_9959186233402883
    Umfang: 1 online resource (IX, 200 p.)
    Ausgabe: 1st ed. 1987.
    Ausgabe: Online edition Springer Lecture Notes Archive ; 041142-5
    ISBN: 3-540-47760-8
    Serie: Lecture Notes in Computer Science, 269
    Anmerkung: Bibliographic Level Mode of Issuance: Monograph , Deterministic simulation of idealized parallel computers on more realistic ones -- Convex hull of randomly chosen points from a polytope -- Dataflow computing -- Parallel in sequence — Towards the architecture of an elementary cortical processor -- Parallel algorithms and static analysis of parallel programs -- Parallel processing of combinatorial search trees -- An O(nlogn) cost parallel algorithm for the single function coarsest partition problem -- Systolic algorithms for computing the visibility polygon and triangulation of a polygonal region -- RELACS — A recursive layout computing system -- Parallel linear conflict-tree subtree access -- A formal definition for systolic systems -- Parallel recognition of outerplanar graphs -- Solutions for the distributed termination problem -- Memories for parallel subtree-access -- Synapse: A multi-microprocessor lisp machine with parallel garbage collector -- A note on optimal parallel transformations of regular expressions to nondeterministic finite automata -- Optimal parallel parsing of bracket languages -- On reliable networks from unreliable gates -- Area-time tradeoffs for selection -- Optimization of special permutation networks using simple algebraic relations -- Computing a rectilinear steiner minimal tree in $$n^{O(\sqrt n )}$$ time -- What can be parallelized in computational geometry? -- A co-operative programming environment for a back-end type sequential inference machine CHI. , English
    In: Springer eBooks
    Weitere Ausg.: ISBN 3-540-18099-0
    Sprache: Englisch
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 2
    UID:
    gbv_595130542
    Umfang: Online-Ressource (205 S.)
    Ausgabe: Online-Ausg. Berlin [u.a.] Springer 2006 Springer lecture notes archive
    ISBN: 9783540477600
    Serie: Lecture notes in computer science 269
    Inhalt: Deterministic simulation of idealized parallel computers on more realistic ones -- Convex hull of randomly chosen points from a polytope -- Dataflow computing -- Parallel in sequence — Towards the architecture of an elementary cortical processor -- Parallel algorithms and static analysis of parallel programs -- Parallel processing of combinatorial search trees -- An O(nlogn) cost parallel algorithm for the single function coarsest partition problem -- Systolic algorithms for computing the visibility polygon and triangulation of a polygonal region -- RELACS — A recursive layout computing system -- Parallel linear conflict-tree subtree access -- A formal definition for systolic systems -- Parallel recognition of outerplanar graphs -- Solutions for the distributed termination problem -- Memories for parallel subtree-access -- Synapse: A multi-microprocessor lisp machine with parallel garbage collector -- A note on optimal parallel transformations of regular expressions to nondeterministic finite automata -- Optimal parallel parsing of bracket languages -- On reliable networks from unreliable gates -- Area-time tradeoffs for selection -- Optimization of special permutation networks using simple algebraic relations -- Computing a rectilinear steiner minimal tree in USDUSDn^{O(\sqrt n )}USDUSD time -- What can be parallelized in computational geometry? -- A co-operative programming environment for a back-end type sequential inference machine CHI.
    Anmerkung: Literaturangaben
    Weitere Ausg.: ISBN 3540180990
    Weitere Ausg.: ISBN 0387180990
    Weitere Ausg.: ISBN 9783540180999
    Weitere Ausg.: Erscheint auch als Druck-Ausgabe Parallel algorithms and architectures Berlin : Springer, 1987 ISBN 3540180990
    Weitere Ausg.: ISBN 0387180990
    Sprache: Englisch
    Fachgebiete: Informatik , Mathematik
    RVK:
    RVK:
    RVK:
    Schlagwort(e): Paralleler Algorithmus ; Parallelrechner ; Konferenzschrift
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    Mehr zum Autor: Albrecht, A. 1950-
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 3
    UID:
    gbv_021680795
    Umfang: 205 S. , graph. Darst.
    ISBN: 3540180990 , 0387180990
    Serie: Lecture notes in computer science 269
    Anmerkung: Literaturangaben
    Weitere Ausg.: Online-Ausg. Parallel algorithms and architectures Berlin [u.a.] : Springer, 1987 ISBN 9783540477600
    Weitere Ausg.: Erscheint auch als Online-Ausgabe Albrecht, Andreas Parallel Algorithms and Architectures Berlin, Heidelberg : Springer Berlin Heidelberg, 1987 ISBN 9783540477600
    Sprache: Englisch
    Fachgebiete: Informatik , Mathematik
    RVK:
    RVK:
    RVK:
    Schlagwort(e): Paralleler Algorithmus ; Parallelrechner ; Paralleler Algorithmus ; Parallelrechner ; Konferenzschrift
    Mehr zum Autor: Mehlhorn, Kurt 1949-
    Mehr zum Autor: Albrecht, A. 1950-
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 4
    UID:
    almahu_9947920998602882
    Umfang: IX, 200 p. , online resource.
    ISBN: 9783540477600
    Serie: Lecture Notes in Computer Science, 269
    Anmerkung: Deterministic simulation of idealized parallel computers on more realistic ones -- Convex hull of randomly chosen points from a polytope -- Dataflow computing -- Parallel in sequence — Towards the architecture of an elementary cortical processor -- Parallel algorithms and static analysis of parallel programs -- Parallel processing of combinatorial search trees -- An O(nlogn) cost parallel algorithm for the single function coarsest partition problem -- Systolic algorithms for computing the visibility polygon and triangulation of a polygonal region -- RELACS — A recursive layout computing system -- Parallel linear conflict-tree subtree access -- A formal definition for systolic systems -- Parallel recognition of outerplanar graphs -- Solutions for the distributed termination problem -- Memories for parallel subtree-access -- Synapse: A multi-microprocessor lisp machine with parallel garbage collector -- A note on optimal parallel transformations of regular expressions to nondeterministic finite automata -- Optimal parallel parsing of bracket languages -- On reliable networks from unreliable gates -- Area-time tradeoffs for selection -- Optimization of special permutation networks using simple algebraic relations -- Computing a rectilinear steiner minimal tree in $$n^{O(\sqrt n )}$$ time -- What can be parallelized in computational geometry? -- A co-operative programming environment for a back-end type sequential inference machine CHI.
    In: Springer eBooks
    Weitere Ausg.: Printed edition: ISBN 9783540180999
    Sprache: Englisch
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 5
    UID:
    almahu_9948621502102882
    Umfang: IX, 200 p. , online resource.
    Ausgabe: 1st ed. 1987.
    ISBN: 9783540477600
    Serie: Lecture Notes in Computer Science, 269
    Anmerkung: Deterministic simulation of idealized parallel computers on more realistic ones -- Convex hull of randomly chosen points from a polytope -- Dataflow computing -- Parallel in sequence - Towards the architecture of an elementary cortical processor -- Parallel algorithms and static analysis of parallel programs -- Parallel processing of combinatorial search trees -- An O(nlogn) cost parallel algorithm for the single function coarsest partition problem -- Systolic algorithms for computing the visibility polygon and triangulation of a polygonal region -- RELACS - A recursive layout computing system -- Parallel linear conflict-tree subtree access -- A formal definition for systolic systems -- Parallel recognition of outerplanar graphs -- Solutions for the distributed termination problem -- Memories for parallel subtree-access -- Synapse: A multi-microprocessor lisp machine with parallel garbage collector -- A note on optimal parallel transformations of regular expressions to nondeterministic finite automata -- Optimal parallel parsing of bracket languages -- On reliable networks from unreliable gates -- Area-time tradeoffs for selection -- Optimization of special permutation networks using simple algebraic relations -- Computing a rectilinear steiner minimal tree in $$n^{O(\sqrt n )}$$ time -- What can be parallelized in computational geometry? -- A co-operative programming environment for a back-end type sequential inference machine CHI.
    In: Springer Nature eBook
    Weitere Ausg.: Printed edition: ISBN 9783662166284
    Weitere Ausg.: Printed edition: ISBN 9783540180999
    Sprache: Englisch
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 6
    UID:
    edoccha_9959186233402883
    Umfang: 1 online resource (IX, 200 p.)
    Ausgabe: 1st ed. 1987.
    Ausgabe: Online edition Springer Lecture Notes Archive ; 041142-5
    ISBN: 3-540-47760-8
    Serie: Lecture Notes in Computer Science, 269
    Anmerkung: Bibliographic Level Mode of Issuance: Monograph , Deterministic simulation of idealized parallel computers on more realistic ones -- Convex hull of randomly chosen points from a polytope -- Dataflow computing -- Parallel in sequence — Towards the architecture of an elementary cortical processor -- Parallel algorithms and static analysis of parallel programs -- Parallel processing of combinatorial search trees -- An O(nlogn) cost parallel algorithm for the single function coarsest partition problem -- Systolic algorithms for computing the visibility polygon and triangulation of a polygonal region -- RELACS — A recursive layout computing system -- Parallel linear conflict-tree subtree access -- A formal definition for systolic systems -- Parallel recognition of outerplanar graphs -- Solutions for the distributed termination problem -- Memories for parallel subtree-access -- Synapse: A multi-microprocessor lisp machine with parallel garbage collector -- A note on optimal parallel transformations of regular expressions to nondeterministic finite automata -- Optimal parallel parsing of bracket languages -- On reliable networks from unreliable gates -- Area-time tradeoffs for selection -- Optimization of special permutation networks using simple algebraic relations -- Computing a rectilinear steiner minimal tree in $$n^{O(\sqrt n )}$$ time -- What can be parallelized in computational geometry? -- A co-operative programming environment for a back-end type sequential inference machine CHI. , English
    In: Springer eBooks
    Weitere Ausg.: ISBN 3-540-18099-0
    Sprache: Englisch
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 7
    UID:
    edocfu_9959186233402883
    Umfang: 1 online resource (IX, 200 p.)
    Ausgabe: 1st ed. 1987.
    Ausgabe: Online edition Springer Lecture Notes Archive ; 041142-5
    ISBN: 3-540-47760-8
    Serie: Lecture Notes in Computer Science, 269
    Anmerkung: Bibliographic Level Mode of Issuance: Monograph , Deterministic simulation of idealized parallel computers on more realistic ones -- Convex hull of randomly chosen points from a polytope -- Dataflow computing -- Parallel in sequence — Towards the architecture of an elementary cortical processor -- Parallel algorithms and static analysis of parallel programs -- Parallel processing of combinatorial search trees -- An O(nlogn) cost parallel algorithm for the single function coarsest partition problem -- Systolic algorithms for computing the visibility polygon and triangulation of a polygonal region -- RELACS — A recursive layout computing system -- Parallel linear conflict-tree subtree access -- A formal definition for systolic systems -- Parallel recognition of outerplanar graphs -- Solutions for the distributed termination problem -- Memories for parallel subtree-access -- Synapse: A multi-microprocessor lisp machine with parallel garbage collector -- A note on optimal parallel transformations of regular expressions to nondeterministic finite automata -- Optimal parallel parsing of bracket languages -- On reliable networks from unreliable gates -- Area-time tradeoffs for selection -- Optimization of special permutation networks using simple algebraic relations -- Computing a rectilinear steiner minimal tree in $$n^{O(\sqrt n )}$$ time -- What can be parallelized in computational geometry? -- A co-operative programming environment for a back-end type sequential inference machine CHI. , English
    In: Springer eBooks
    Weitere Ausg.: ISBN 3-540-18099-0
    Sprache: Englisch
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 8
    UID:
    gbv_1649207182
    Umfang: Online-Ressource
    ISBN: 9783540477600
    Serie: Lecture Notes in Computer Science 269
    Weitere Ausg.: ISBN 9783540180999
    Weitere Ausg.: Buchausg. u.d.T. Parallel algorithms and architectures Berlin : Springer, 1987 ISBN 3540180990
    Weitere Ausg.: ISBN 0387180990
    Sprache: Englisch
    Fachgebiete: Informatik , Mathematik
    RVK:
    RVK:
    RVK:
    RVK:
    Schlagwort(e): Paralleler Algorithmus ; Parallelrechner ; Konferenzschrift
    Mehr zum Autor: Mehlhorn, Kurt 1949-
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
Meinten Sie 9783540407300?
Meinten Sie 9783540071600?
Meinten Sie 9783540097600?
Schließen ⊗
Diese Webseite nutzt Cookies und das Analyse-Tool Matomo. Weitere Informationen finden Sie auf den KOBV Seiten zum Datenschutz