Titlebook: Informatik; Festschrift zum 60. Johannes Buchmann,Harald Ganzinger,Wolfgang J. Pau Textbook 1992 Springer Fachmedien Wiesbaden 1992 Algebr

Guffaw

書目名稱Informatik影響因子(影響力)




書目名稱Informatik影響因子(影響力)學(xué)科排名




書目名稱Informatik網(wǎng)絡(luò)公開度




書目名稱Informatik網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Informatik被引頻次




書目名稱Informatik被引頻次學(xué)科排名




書目名稱Informatik年度引用




書目名稱Informatik年度引用學(xué)科排名




書目名稱Informatik讀者反饋




書目名稱Informatik讀者反饋學(xué)科排名

Dendritic-Cells

Decision Making in the Presence of Noise,. For arbitrary . ? ., we present examples in which the optimal decision changes . times as the probability of error in an individual datum increases from 0 to 1/2. Thus, no decision procedure that is insensitive to (or does not know) the amount of uncertainty in the data can perform as well as one that is aware of the unreliability of its data.

支架

宣稱

jocular

A Hierarchy Preserving Hierarchical Bottom-Up 2-layer Wiring Algorithm with Respect to Via Minimiza of the subcircuits of level ., it computes the optimal (partially induced by the wirings of the subcircuits) 2-layer wiring of the circuits of level . 1. The algorithm’s running time is ... where . is the size of the hierarchical description of ..

按等級

Dynamic Hashing in Real Time,cribed, where in constant length time intervals . instructions are given via the . processors. For dictionaries of size . ., the same performance bounds as for the sequential case are obtained..The construction is based on a new high performance universal class of hash functions.

職業(yè)拳擊手

GUISE

Complexity of Closeness, Sparseness and Segment Equivalence for Context-Free and Regular Languages, for NFAs and DFAs are .-complete. We also show that the equivalence problems for CFGs and NFAs generating commutative languages are . .-complete and co-.-complete, respectively. For trim DFAs generating commutative languages the equivalence problem is in ..

obsolete

Contracture

The Bisection Problem for Graphs of Degree 4 (Configuring Transputer Systems),all .-degree graphs of . vertices. We prove that . for all even .. This result is improved for . = 4 by constructing two algorithms . and ., where for a given 4-degree graph . . of . vertices.The algorithms . and . run in . . . time on graphs of . vertices, and they are used to optimize hardware for building large transputer systems.