Lecture Notes in Computer Science / A.Albrecht , H . Jung k.Mehlhorn Editer

By: Jung.H, Albrecht .APublisher: Berlin Springer-Verlag 1987Description: 205pISBN: 3540180990Subject(s): Computer ScienceDDC classification: 004.35,LEC
Contents:
Deterministic Simulation of Idealized Parallel Computer on More Realistic ones (Page-11), Convex hull of randomly chosen Points from a Poly tope (Page-16), Data flow Computing (Page-25), Parallel in Sequence Towards the architecture of an elementary cortical Processor (Page-37), Parallel Algorithms Processing of Combinatorial Search (Page-60) Cost Parallel Algorithms for the Single function Coarsest Partition Problem (Page-70), Aystolic Algorithms of Computing the Visibility Polygon and Triangulation of a Polygonal Region (Page-77), A Recurstive layout Computing System (Page-86), Parallel Linear Conflict-free Subtree Access (Page-89) A Formal definition for systolic Systems (Page-97), Parallel Recognition of Outer planer Graphs (Page-105), Solutions for the Distributed Termination Problem (Page-114), Memories for Prallel Subtree-Access (Page-122), A Multi-Processor Lisp Machine with Parallel Garbage Collector (Page-131), A note on Optical Parallel Transformation of Regular Expressions to nondeterministic Finite automate (Page-138), Optical Prallel Parsing of Bracket Languages (Page-146), On reliable networks from unreliable Gates (Page-155) Area-time tradeoffs for Selection (Page-163), Optimization of Special Permutation Networks Using Simple (Page-169).
Tags from this library: No tags from this library for this title. Log in to add tags.
Item type Current location Home library Shelving location Call number URL Status Notes Date due Barcode Item holds
Book Book Military College of Signals (MCS)
Military College of Signals (MCS)
General Stacks 004.35,LEC (Browse shelf) Link to resource Available Almirah No.2, Self No.5 MCS3140
Total holds: 0

Deterministic Simulation of Idealized Parallel Computer on More Realistic ones (Page-11), Convex hull of randomly chosen Points from a Poly tope (Page-16), Data flow Computing (Page-25), Parallel in Sequence Towards the architecture of an elementary cortical Processor (Page-37), Parallel Algorithms Processing of Combinatorial Search (Page-60) Cost Parallel Algorithms for the Single function Coarsest Partition Problem (Page-70), Aystolic Algorithms of Computing the Visibility Polygon and Triangulation of a Polygonal Region (Page-77), A Recurstive layout Computing System (Page-86), Parallel Linear Conflict-free Subtree Access (Page-89) A Formal definition for systolic Systems (Page-97), Parallel Recognition of Outer planer Graphs (Page-105), Solutions for the Distributed Termination Problem (Page-114), Memories for Prallel Subtree-Access (Page-122), A Multi-Processor Lisp Machine with Parallel Garbage Collector (Page-131), A note on Optical Parallel Transformation of Regular Expressions to nondeterministic Finite automate (Page-138), Optical Prallel Parsing of Bracket Languages (Page-146), On reliable networks from unreliable Gates (Page-155) Area-time tradeoffs for Selection (Page-163), Optimization of Special Permutation Networks Using Simple (Page-169).

There are no comments on this title.

to post a comment.

Click on an image to view it in the image viewer

© 2023 Central Library, National University of Sciences and Technology. All Rights Reserved.