標(biāo)題: Titlebook: Informatik; Festschrift zum 60. Johannes Buchmann,Harald Ganzinger,Wolfgang J. Pau Textbook 1992 Springer Fachmedien Wiesbaden 1992 Algebr [打印本頁] 作者: Guffaw 時(shí)間: 2025-3-21 18:12
書目名稱Informatik影響因子(影響力)
書目名稱Informatik影響因子(影響力)學(xué)科排名
書目名稱Informatik網(wǎng)絡(luò)公開度
書目名稱Informatik網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Informatik被引頻次
書目名稱Informatik被引頻次學(xué)科排名
書目名稱Informatik年度引用
書目名稱Informatik年度引用學(xué)科排名
書目名稱Informatik讀者反饋
書目名稱Informatik讀者反饋學(xué)科排名
作者: Dendritic-Cells 時(shí)間: 2025-3-21 23:48
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.作者: 支架 時(shí)間: 2025-3-22 03:32 作者: 宣稱 時(shí)間: 2025-3-22 04:47 作者: jocular 時(shí)間: 2025-3-22 12:24
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 ..作者: 按等級 時(shí)間: 2025-3-22 14:26
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è)拳擊手 時(shí)間: 2025-3-22 20:07 作者: GUISE 時(shí)間: 2025-3-22 23:57
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 時(shí)間: 2025-3-23 02:32 作者: Contracture 時(shí)間: 2025-3-23 08:53
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.作者: enfeeble 時(shí)間: 2025-3-23 10:09 作者: Confirm 時(shí)間: 2025-3-23 15:38
On the Physical Design of PRAMs, several instruction streams and a fast butterfly connection network. For the realization of the network we consider alternatively optoelectronic and electric transmission. We also discuss some basic software issues.作者: 厭倦嗎你 時(shí)間: 2025-3-23 20:07 作者: macular-edema 時(shí)間: 2025-3-24 01:20 作者: 統(tǒng)治人類 時(shí)間: 2025-3-24 06:19 作者: Cosmopolitan 時(shí)間: 2025-3-24 07:50
Teubner Texte zur Informatikhttp://image.papertrans.cn/i/image/464907.jpg作者: happiness 時(shí)間: 2025-3-24 12:17
978-3-8154-2033-1Springer Fachmedien Wiesbaden 1992作者: 厭食癥 時(shí)間: 2025-3-24 16:29 作者: 吸引人的花招 時(shí)間: 2025-3-24 21:09 作者: 草率女 時(shí)間: 2025-3-25 03:05
https://doi.org/10.1007/978-3-322-95233-2Algebra; Algorithmen; Automaten; Entwicklung; Entwurf; Informatik; Komplexit?t; Konstruktion; Logik; Mathemat作者: 協(xié)議 時(shí)間: 2025-3-25 04:33
Distributed Class Group Computation,We present an improved sequential and a parallel version of the algorithm of Hafner and McCurley for the computation of the class group of imaginary quadratic fields. We describe the implementation of this algorithm on a network of UNIX-workstations using the system LIPS.作者: 雕鏤 時(shí)間: 2025-3-25 07:58 作者: Obligatory 時(shí)間: 2025-3-25 12:23 作者: 很像弓] 時(shí)間: 2025-3-25 17:38
On the Physical Design of PRAMs, several instruction streams and a fast butterfly connection network. For the realization of the network we consider alternatively optoelectronic and electric transmission. We also discuss some basic software issues.作者: harrow 時(shí)間: 2025-3-25 22:10
Synthesis for Testability: Binary Decision Diagrams,or at least) BDD-like circuits are easily testable with respect to different fault models (cellular, stuck-at and path delay fault model). Furthermore the circuits and the test sets can be constructed efficiently.作者: DOTE 時(shí)間: 2025-3-26 03:55
,?hnlichkeit von Grammatiken — Ans?tze und Erfahrungen,en kann. Die betrachteten Verfahren werden insbesondere anhand der Ausdrucks-Syntaxen von PASCAL und MODULA-2 konkretisiert. Unter Rückgriff auf frühere theoretische Ergebnisse werden Perspektiven für den Ausbau der einfachen Ans?tze aufgezeigt.作者: obsession 時(shí)間: 2025-3-26 08:16 作者: 脫水 時(shí)間: 2025-3-26 09:37 作者: minimal 時(shí)間: 2025-3-26 12:56 作者: Blemish 時(shí)間: 2025-3-26 20:33 作者: Morsel 時(shí)間: 2025-3-26 22:53 作者: 溝通 時(shí)間: 2025-3-27 01:26 作者: 凝結(jié)劑 時(shí)間: 2025-3-27 08:33
The Bisection Problem for Graphs of Degree 4 (Configuring Transputer Systems),the bisection width of . . is at least . . .. It this paper some upper bounds on the . .′s are found. Let . . . be the maximum of bisection widths of all .-degree graphs of . vertices. We prove that . for all even .. This result is improved for . = 4 by constructing two algorithms . and ., where for作者: 牌帶來 時(shí)間: 2025-3-27 10:49
Complexity of Closeness, Sparseness and Segment Equivalence for Context-Free and Regular Languages, be shown that the closeness problem for context-free grammars (CFGs) is undecidable while it is .-complete for nondeterministic finite automata (NFAs) and .-complete for deterministic finite automata (DFAs). The segment equivalence problems for CFGs and NFAs are co-.-complete. It is .-complete for 作者: inferno 時(shí)間: 2025-3-27 15:55
Communication Complexity and Lower Bounds for Sequential Computation,ication concerns one-tape Turing machines with an additional oneway input tape. It is shown that lower bounds on the Communication Complexity of a given language immediately imply lower bounds on the running time for this Turing machine model. Consequently, lower bounds for the Turing machine comple作者: 稀釋前 時(shí)間: 2025-3-27 20:08
On the Stack Size of a Class of Backtrack Trees,uced by P.W.Purdom for the purpose of modelling backtrack trees. The considered trees have a height less than or equal to . and their shapes are controlled by an external parameter . ∈ [0,1]..We show that the average stack size of a tree appearing in ..(.) is bounded by a constant for 0 ≤ . < ?, and作者: TIA742 時(shí)間: 2025-3-28 01:56 作者: 寬容 時(shí)間: 2025-3-28 04:39
,über die relativistische Struktur logischer Zeit in verteilten Systemen,, ist dadurch charakterisiert, da? a priori kein Proze? eine konsistente Sicht des globalen Zustandes besitzt und eine gemeinsame Zeitbasis innerhalb des Systems nicht existiert. Interpretiert man nun den Zeitbegriff neu — als eine halbgeordnete Menge .dimensionaler Vektoren mit Verbandstruktur — so作者: Pulmonary-Veins 時(shí)間: 2025-3-28 07:31
A Hierarchy Preserving Hierarchical Bottom-Up 2-layer Wiring Algorithm with Respect to Via Minimizalayer wiring of . which needs a number of vias minimal with respect to the preservation of hierarchy, i.e., on condition that the description of the result is (nearly) as short as the description of . before the 2-layer wiring”. The problem arises in connection with hierarchical physical synthesis, 作者: 東西 時(shí)間: 2025-3-28 14:28 作者: admission 時(shí)間: 2025-3-28 16:13 作者: Ligament 時(shí)間: 2025-3-28 21:03
Hans-Peter Blattvice capabilities. Servilla addresses this difficulty in developing applications by offering a new middleware framework based on service provisioning. Using Servilla, developers can construct platform-independent applications over a dynamic and diverse set of devices. A salient feature of Servilla i作者: 效果 時(shí)間: 2025-3-29 00:26
Johannes Buchmann,Stephan Düllmannature of their house with a cell-phone, check that the shutters are closed with a PDA, or select the music to be played on a Hi-Fi system with a PC are examples of the targeted applications..Diffuse Web applications have similarities with Web 2.0 applications: . they rely on fast bi-directional inte作者: BROTH 時(shí)間: 2025-3-29 05:58
Volker Clausnate applications not only at the functional level, as is traditionally done, but also in terms of resource utilization. In this paper, we present a middleware that does this using adaptive service provisioning. Novel service binding strategies automatically adapt application behavior when opportuni作者: 品牌 時(shí)間: 2025-3-29 07:57
Martin Dietzfelbinger,Friedhelm Meyer auf der Heidenate applications not only at the functional level, as is traditionally done, but also in terms of resource utilization. In this paper, we present a middleware that does this using adaptive service provisioning. Novel service binding strategies automatically adapt application behavior when opportuni作者: Fretful 時(shí)間: 2025-3-29 15:24 作者: anchor 時(shí)間: 2025-3-29 16:27
Michael J. Fischer,Sophia A. Paleologout act and coordinate with no central orchestrator to support distributed applications. Engineering global behaviour out of local activity and interaction, however, is a difficult task, typically addressed by try-and-error approaches in simulation environments. In the context of Aggregate Computing (作者: Eulogy 時(shí)間: 2025-3-29 21:52
Bernd Halstenberg,Rüdiger Reischukt act and coordinate with no central orchestrator to support distributed applications. Engineering global behaviour out of local activity and interaction, however, is a difficult task, typically addressed by try-and-error approaches in simulation environments. In the context of Aggregate Computing (作者: 最小 時(shí)間: 2025-3-30 03:15 作者: urethritis 時(shí)間: 2025-3-30 04:31
Thomas Kretschmert act and coordinate with no central orchestrator to support distributed applications. Engineering global behaviour out of local activity and interaction, however, is a difficult task, typically addressed by try-and-error approaches in simulation environments. In the context of Aggregate Computing (作者: 討好女人 時(shí)間: 2025-3-30 11:54 作者: 新義 時(shí)間: 2025-3-30 13:43 作者: cardiopulmonary 時(shí)間: 2025-3-30 19:24
Bala Kalyanasundaram,Georg Schnitgerears we are witnessing the wide adoption of social software (blogs, microblogs, wiki, forums, shared calendars, etc.) as primary technological tools to support organizational best practices, fostering their creation, evolution and sharing, allowing their continuous refinement and alignment with the 作者: expeditious 時(shí)間: 2025-3-30 23:41
Rainer Kempom load balancing as it considers a collection of loads, instead of normal data items, where a single load can be described as a task. Current approaches that treat load clustering mainly lack of provisioning a general framework and autonomy. They are neither agent-based nor configurable for many to作者: 或者發(fā)神韻 時(shí)間: 2025-3-31 04:17
Rolf Klein,Kurt Mehlhorn,Stefan Meiserages (Coordination 2002), held in York, UK, 8–11 April 2002. Coordination models and languages close the conceptual gap - tween the cooperation model used by the constituent parts of an application and the lower-level communication model used in its implementation. Coordinati- based methods provide 作者: 一條卷發(fā) 時(shí)間: 2025-3-31 05:08
Friedemann Matternputational fields are particularly appealing for allowing components to join and leave with little or no overhead. In our approach, the space topology is represented by a graph-shaped field, namely a network with attributes on both nodes and arcs, where arcs represent interaction capabilities betwee作者: Adulterate 時(shí)間: 2025-3-31 12:49
Paul Molitorputational fields are particularly appealing for allowing components to join and leave with little or no overhead. In our approach, the space topology is represented by a graph-shaped field, namely a network with attributes on both nodes and arcs, where arcs represent interaction capabilities betwee作者: 無王時(shí)期, 時(shí)間: 2025-3-31 17:10 作者: Exclude 時(shí)間: 2025-3-31 19:03 作者: Irremediable 時(shí)間: 2025-4-1 01:33 作者: Mutter 時(shí)間: 2025-4-1 05:01
Johannes Buchmann,Stephan Düllmannand tunings..Hop (.) is a platform designed for building and running diffuse Web applications. Its software development kit contains two compilers, one interpreter, and a . Web server. That is, the Hop Web server is implemented in Hop. This paper shows that this implementation strategy allows Hop to作者: Canvas 時(shí)間: 2025-4-1 09:37
Volker ClauslosB and Imote2. Empirical results show that adaptive service provisioning can enable energy-aware service binding decisions that result in increased energy efficiency and significantly increase service availability, while imposing minimal additional burden on the application, service, and device de作者: ELUDE 時(shí)間: 2025-4-1 11:33 作者: accessory 時(shí)間: 2025-4-1 16:43 作者: vibrant 時(shí)間: 2025-4-1 19:40
