Übersicht			Auf mobile öffnen

Lieferstatus:	i.d.R. innert 5-10 Tagen versandfertig
Veröffentlichung:	Dezember 1987
Genre:	EDV / Informatik
	Area / Automata / computationalgeometry / Computer / computingsystem / Form / Graphs / Layout / mathematicalprogramming / MicrosoftAccess / Network / Networks / processor / Programming / Transformation mehr...
ISBN:	9783540180999
EAN-Code:	9783540180999
Verlag:	Springer
Einband:	Kartoniert
Sprache:	English
Dimensionen:	H 235 mm / B 155 mm / D 12 mm
Gewicht:	330 gr
Seiten:	212
Bewertung:	Titel bewerten / Meinung schreiben

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 $$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.