Titlebook: GI — 13. Jahrestagung; Hamburg, 3.–7. Oktob Ingbert Kupka Conference proceedings 1983 Springer-Verlag Berlin Heidelberg 1983 Algorithmen.Bi

sulfonylureas

書目名稱GI — 13. Jahrestagung影響因子(影響力)




書目名稱GI — 13. Jahrestagung影響因子(影響力)學(xué)科排名




書目名稱GI — 13. Jahrestagung網(wǎng)絡(luò)公開度




書目名稱GI — 13. Jahrestagung網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱GI — 13. Jahrestagung被引頻次




書目名稱GI — 13. Jahrestagung被引頻次學(xué)科排名




書目名稱GI — 13. Jahrestagung年度引用




書目名稱GI — 13. Jahrestagung年度引用學(xué)科排名




書目名稱GI — 13. Jahrestagung讀者反饋




書目名稱GI — 13. Jahrestagung讀者反饋學(xué)科排名

刀鋒

Data Mappings in Large Parallel Computersbanks that can be accessed independently in parallel at great speed. Aside from needing adequately parallelized (“vectorized”) algorithms, their application requires general storage mappings for distributing vector data and retrieving it from memory at low cost. Data mappings of this kind, also know

絆住

Infusion

Die Gestaltung der Mensch-Maschine-Schnittsteller als Kommunikationsmedium zu betrachten, neben Film, Fernsehen, oder Hellraumprojektor, ist vor allem durch elektronische Spiele popul?r geworden. Bei Spielen werden die vielseitigen technischen M?glichkeiten des Mediums Computer auch am virtuosesten ausgenutzt — Spiele sind oft die Prototypen, an

Lucubrate

Applicative State Transition Systems in LISP-Like Notationof the state in a single transition. An AST system is made up of a state space and a set of transition rules, together with an applicative subsystem in which to program these components. Considering the great number of possible variations of this concept of a computing system, the design and impleme

割公牛膨脹

An Algebraic Semantics for Backus’ Functional Programming Language with Infinite Objects data structure of finite nested sequences, i.e. trees with arbitrary branching, is generalized to infinite trees by allowing non-strict constructor functions. Then for the language constructs an extensional semantics is defined, and a matching operational semantics is outlined. At each level of the

割公牛膨脹

混沌

Partition Sorts for VLSIic says that they are concatenations of identical comparator networks. 2d-primitive says that there is a planar layout for these algorithms such that communication is exclusively local. This makes its members specially suitable for an implementation by means of VLSI-technology..It is shown that part

糾纏,纏繞

The Partner Algorithm for Protecting Statistical Databases Extended Abstractatistics and, in addition, sufficiently many nonsensitive statistics to prevent inference about identifiable individuals; it does not restrict entire statistical tables. The control works on a per query basis. It is memoryless, that is, it does not require preproduced output, nor is there a log of f

Panther