標題: Titlebook: STACS 94; 11th Annual Symposiu Patrice Enjalbert,Ernst W. Mayr,Klaus W. Wagner Conference proceedings 1994 Springer-Verlag Berlin Heidelber [打印本頁] 作者: 傷害 時間: 2025-3-21 18:51
書目名稱STACS 94影響因子(影響力)
書目名稱STACS 94影響因子(影響力)學科排名
書目名稱STACS 94網(wǎng)絡公開度
書目名稱STACS 94網(wǎng)絡公開度學科排名
書目名稱STACS 94被引頻次
書目名稱STACS 94被引頻次學科排名
書目名稱STACS 94年度引用
書目名稱STACS 94年度引用學科排名
書目名稱STACS 94讀者反饋
書目名稱STACS 94讀者反饋學科排名
作者: 驚惶 時間: 2025-3-21 22:22 作者: GRATE 時間: 2025-3-22 03:52 作者: Onerous 時間: 2025-3-22 04:58 作者: Chromatic 時間: 2025-3-22 08:44
https://doi.org/10.1007/3-540-57785-8Bisimulation; Computer-Science-Logik; Kombinatorik; Komplexit?t; Monoid; automata; combinatorics; complexit作者: Leisureliness 時間: 2025-3-22 13:02 作者: Neuralgia 時間: 2025-3-22 17:53 作者: 箴言 時間: 2025-3-23 00:08 作者: 使糾纏 時間: 2025-3-23 05:22
Faster sorting and routing on grids with diagonals,able grids without diagonals. In most of the cases the number of transport steps for the new algorithms are less than half the on principle smallest number given by the bisection bound for grids without diagonals.作者: Finasteride 時間: 2025-3-23 08:55
The nature and meaning of perturbations in geometric computing,ing with them amounts to computing with limits. and (re)derive some methods of computing with such limits automatically. In principle a line can always be used as a perturbation curve. We discuss a generic method for choosing such a line that is applicable in many situations.作者: 難管 時間: 2025-3-23 12:50 作者: glucagon 時間: 2025-3-23 14:29 作者: FLOAT 時間: 2025-3-23 18:27
0302-9743 ogram committee during a highly competitive reviewing process from a total of 234 submissions for 38 countries. The volume competently represents most areas of theoretical computer science with a certain emphasis on (parallel) algorithms and complexity.978-3-540-57785-0978-3-540-48332-8Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 原告 時間: 2025-3-23 22:36
The nature and meaning of perturbations in geometric computing,s it mean to compute with them? How can one compute with them? Is it sensible to use them?.We define perturbations to be curves, point out that computing with them amounts to computing with limits. and (re)derive some methods of computing with such limits automatically. In principle a line can alway作者: orthopedist 時間: 2025-3-24 03:45 作者: 組裝 時間: 2025-3-24 07:12 作者: 不在灌木叢中 時間: 2025-3-24 13:29
A hierarchy of temporal logics with past, the incorporation of past-time modalities. In addition, we propose a new temporal combinator, N for “Now”, that brings new and interesting expressive power. In several situations, non-trivial translation algorithms exist from a temporal logic with past to a pure-future fragment. These algorithms ha作者: arthroplasty 時間: 2025-3-24 15:09 作者: 蹣跚 時間: 2025-3-24 19:58
Two proof procedures for a cardinality based language in propositional calculus,ods. Hence to express propositional problems and logical constraints we introduce the pair formulas (.) which mean that “at least . literals among those of a list . are true”. This makes a generalization of propositional clauses which express ”At least one literal is true among those of the clause”.作者: 僵硬 時間: 2025-3-25 02:07
The alternation hierarchy for machines with sublogarithmic space is infinite,) to two-way machines with weak space-bounds, b) to two-way machines with strong space-bounds, and c) to one-way machines with weak space-bounds. In all of these cases the .. and II.classes are not comparable for . ≥ 2. Furthermore the ..classes are not closed under intersection and the II.classes a作者: 發(fā)酵 時間: 2025-3-25 06:46
Quasilinear time complexity theory,l properties of the polynomial-time hierarchy carry over to the quasilineartime hierarchy. Whereas all previously known versions of the Valiant-Vazirani reduction from NP to parity run in quadratic time, we give a new construction using error-correcting codes that runs in quasilinear time. We show, 作者: 重畫只能放棄 時間: 2025-3-25 10:53
Space-efficient deterministic simulation of probabilistic automata,ngth ., we ask how much space does a deterministic Turing machine need in order to decide the acceptance of an input string by that automaton?.The question is interesting even in the case of one-head one-way probabilistic finite automata. We call (rational) . (S.) the class of languages recognized b作者: Carminative 時間: 2025-3-25 15:01
Reachability and the power of local ordering,tructures expressible in first-order logic augmented with the appropriate Transitive Closure operator [I87]: Over ordered structures, (FO + DTC) captures L and (FO + TC) captures NL. On the other hand, in the absence of ordering, (FO + TC) is strictly more powerful than (FO + DTC) [GM92]. An apparen作者: Ejaculate 時間: 2025-3-25 17:08 作者: groggy 時間: 2025-3-25 21:30 作者: Inscrutable 時間: 2025-3-26 00:49 作者: 不理會 時間: 2025-3-26 05:41
Combination of matching algorithms,der which conditions matching algorithms in the single theories are sufficient to obtain a matching algorithm in the combination? In general, the blind use of combination techniques introduces unification. Two different restrictions are considered in order to reduce this unification to matching. Fir作者: Breach 時間: 2025-3-26 09:02 作者: 作嘔 時間: 2025-3-26 16:18
Optimal pattern matching on meshes,put text is a string of . symbols placed in a √.×√. mesh, each processor storing one symbol. The pattern is stored similarly in a contiguous portion of the mesh. An algorithm solving the problem in time .(√n) is presented. It applies a novel technique to design parallel pattern-matching algorithms b作者: neutralize 時間: 2025-3-26 17:59 作者: BRAWL 時間: 2025-3-26 21:50
Deterministic 1 -, routing on meshes with applications to worm-hole routing,or is the destination of at most . packets. This problem has great practical importance in itself and by its implications for hot-potato worm-hole routing..We present a near-optimal deterministic algorithm running in . steps, and an algorithm with slightly worse routing time but working queue size t作者: xanthelasma 時間: 2025-3-27 03:59
One binary horn clause is enough,, we prove effectively by logical transformations that all conjunctive formulas of Horn clauses can be translated into an equivalent conjuctive 4-formula (as above). Some consequences are presented in several contexts (mathematical logic, unification modulo a set of axioms, compilation techniques and other program patterns).作者: 不可思議 時間: 2025-3-27 07:33 作者: MAUVE 時間: 2025-3-27 12:36
Reachability and the power of local ordering,ible, by the two-way JAG model, which we define. Furthermore, we have shown that the language (FO + DTC) over two-way locally ordered graphs is more robust than even the two-way JAG model, and yet lower bounds remain accessible. We prove an upper bound on the power of TC over locally ordered graphs, and three lower bounds on DTC.作者: ETCH 時間: 2025-3-27 14:33 作者: majestic 時間: 2025-3-27 19:38 作者: ascend 時間: 2025-3-28 01:19
Conference proceedings 1994ruary 24-26, 1994. Besides three prominent invited papers, the proceedings contains 60 accepted contributions chosen by the international program committee during a highly competitive reviewing process from a total of 234 submissions for 38 countries. The volume competently represents most areas of 作者: 口音在加重 時間: 2025-3-28 04:37
The complexity of resource-bounded first-order classical logic,er logic modulo an equational theory. These results allow us not only to give estimations of the inherent difficulty of automated theorem proving problems, but to gain some insight into the computational relevance of several automated theorem proving methods.作者: 向外供接觸 時間: 2025-3-28 09:53 作者: 巨大沒有 時間: 2025-3-28 12:07 作者: HARP 時間: 2025-3-28 14:40 作者: 大暴雨 時間: 2025-3-28 18:59
The alternation hierarchy for machines with sublogarithmic space is infinite,re not closed under union. Thus these classes are not closed under complementation. The hierarchy results also apply to classes determined by an alternation depth which is a function depending on the input rather than on a constant.作者: Regurgitation 時間: 2025-3-29 00:20 作者: ACME 時間: 2025-3-29 06:51 作者: 故意 時間: 2025-3-29 08:27 作者: Limited 時間: 2025-3-29 13:10 作者: Arthritis 時間: 2025-3-29 19:10
Philippe Devienne,Patrick Lebègue,Jean-Christophe Routier,J?rg Würtz are beyond the scope of existing Artificial Intelligence (AI) algorithms. With the growth of the Web, human computation systems can now leverage the abilities of an unprecedented number of people via the Web to perform complex computation. There are various genres of human computation applications 作者: Muffle 時間: 2025-3-29 21:52 作者: opalescence 時間: 2025-3-30 01:33
F. Laroussinie,Ph. Schnoebelens can be aggregated to approximate the answer of an expert [8,299]. However, as we have seen in the previous chapter, the competence and expertise of the workers . matter—outputs from different workers should be trusted to different extents depending on how reliable they are. This is especially impo作者: 使長胖 時間: 2025-3-30 05:12
Jean Goubaultomputational problems (e.g., consider Table 2.1 for some examples). Typically, in computer science, we study how to design . to automatically solve these computational problems. For example, with the invention of automated computers, multiplications can now be trivially solved by computers. Likewise作者: Conspiracy 時間: 2025-3-30 08:22 作者: 半導體 時間: 2025-3-30 13:15 作者: debacle 時間: 2025-3-30 17:07 作者: Nomogram 時間: 2025-3-30 20:56 作者: esoteric 時間: 2025-3-31 02:38
Zurab Khasidashvili on various person characteristics (age, sex, personal space preferences, and level of behavioral normalcy). The statistical procedures used, which incorporated factor analyses and multivariate analysis of variance, provided a more comprehensive analysis of the effects of density. Negative effects o作者: 必死 時間: 2025-3-31 05:34
Andrea Sattler-Klein on various person characteristics (age, sex, personal space preferences, and level of behavioral normalcy). The statistical procedures used, which incorporated factor analyses and multivariate analysis of variance, provided a more comprehensive analysis of the effects of density. Negative effects o作者: 形容詞詞尾 時間: 2025-3-31 09:54
Burchard von Braunmühl,Romain Gengler,Robert Rettinger作者: 手段 時間: 2025-3-31 13:51 作者: 復習 時間: 2025-3-31 19:11 作者: obstruct 時間: 2025-3-31 22:33 作者: committed 時間: 2025-4-1 03:06 作者: 過去分詞 時間: 2025-4-1 08:31
F. Laroussinie,Ph. Schnoebelenpeople are more detail oriented and prefer repetitive tasks, while others are more creative and prefer tasks with open-ended questions). Under the assumption that experts can handle knowledge-intensive tasks better, task routing is in fact another point of intervention for ensuring output quality .
