標題: Titlebook: Automata, Languages, and Programming; 39th International C Artur Czumaj,Kurt Mehlhorn,Roger Wattenhofer Conference proceedings 2012 Springe [打印本頁] 作者: Definite 時間: 2025-3-21 19:04
書目名稱Automata, Languages, and Programming影響因子(影響力)
書目名稱Automata, Languages, and Programming影響因子(影響力)學(xué)科排名
書目名稱Automata, Languages, and Programming網(wǎng)絡(luò)公開度
書目名稱Automata, Languages, and Programming網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Automata, Languages, and Programming被引頻次
書目名稱Automata, Languages, and Programming被引頻次學(xué)科排名
書目名稱Automata, Languages, and Programming年度引用
書目名稱Automata, Languages, and Programming年度引用學(xué)科排名
書目名稱Automata, Languages, and Programming讀者反饋
書目名稱Automata, Languages, and Programming讀者反饋學(xué)科排名
作者: 頂點 時間: 2025-3-21 20:24 作者: microscopic 時間: 2025-3-22 02:35 作者: 擔(dān)心 時間: 2025-3-22 05:19
https://doi.org/10.1007/978-3-8350-5487-5ewton, but the general metaphor of a dwarf standing on a giant goes back many, many years earlier. I would recommend the wonderful 1965 book by Robert K. Merton, referred to fondly as OTSOG (on the shoulders of giants) [1] .作者: 容易懂得 時間: 2025-3-22 10:25 作者: Between 時間: 2025-3-22 14:43 作者: deceive 時間: 2025-3-22 18:00
https://doi.org/10.1007/978-3-322-89328-4towski sets (FM sets, also known as nominal sets). The key idea is that we allow infinite disjunction (and conjunction), as long as the set of disjuncts (conjunct) is finite modulo renaming of data values. We study model theory for this logic; in particular we prove that the infinite disjunction can be eliminated from formulas.作者: heckle 時間: 2025-3-23 01:01 作者: Granular 時間: 2025-3-23 02:28 作者: 殺菌劑 時間: 2025-3-23 05:50 作者: 承認 時間: 2025-3-23 11:50
Toward Model Theory with Data Valuestowski sets (FM sets, also known as nominal sets). The key idea is that we allow infinite disjunction (and conjunction), as long as the set of disjuncts (conjunct) is finite modulo renaming of data values. We study model theory for this logic; in particular we prove that the infinite disjunction can be eliminated from formulas.作者: Free-Radical 時間: 2025-3-23 14:28
Artur Czumaj,Kurt Mehlhorn,Roger WattenhoferUp-to-date results.Fast-track conference proceedings.State-of-the-art research作者: Basal-Ganglia 時間: 2025-3-23 21:22
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/b/image/166236.jpg作者: anachronistic 時間: 2025-3-23 22:24
https://doi.org/10.1007/978-3-8350-5553-7r in the click-through rates, and budgets, which are restricting their overall payments. Additionally, the number of slots per keyword assigned to a bidder is bounded..We show the following results: (1)?We give the first mechanism for multiple keywords, where click-through rates differ among slots. 作者: Amorous 時間: 2025-3-24 06:17 作者: Antagonism 時間: 2025-3-24 07:55 作者: 粉筆 時間: 2025-3-24 12:28
https://doi.org/10.1007/978-3-8350-5487-5tructures in an asynchronous version of the .-calculus. Its theory is supported and enriched by several foundations, including Linear Logic, automata theory, typed .-calculi and typed .-calculi. Unlike types for sequential computing, where types abstract and specify data and functions, session types作者: 佛刊 時間: 2025-3-24 17:59 作者: 有惡臭 時間: 2025-3-24 20:40 作者: 格言 時間: 2025-3-24 23:50
https://doi.org/10.1007/978-3-8350-5487-5ation trees. In particular, we investigate the relative expressive power of algebraic recursion schemes over two signatures, which are based on those for Basic CCS and Basic Process Algebra, as a means for defining synchronization trees up to isomorphism as well as modulo bisimilarity and language e作者: Antagonist 時間: 2025-3-25 04:06
https://doi.org/10.1007/978-3-8350-5487-5transforming hierarchically structured data such as XML documents. We introduce . as an analyzable, executable, and expressive model for transforming unranked ordered trees (and hedges) in a single pass. Given a linear encoding of the input tree, the transducer makes a single left-to-right pass thro作者: Occlusion 時間: 2025-3-25 09:10 作者: NEG 時間: 2025-3-25 14:46
https://doi.org/10.1007/978-3-8349-8408-1ases, but has left the precise complexity characterization open. We begin by establishing a . lower bound on the MDL/UCQ containment problem, resolving an open problem from the early 90’s. We then present a general approach for getting tighter bounds on the complexity, based on analysis of the numbe作者: esthetician 時間: 2025-3-25 16:40 作者: Evacuate 時間: 2025-3-25 22:56 作者: Flounder 時間: 2025-3-26 03:13
https://doi.org/10.1007/978-3-322-89328-4 to be performed for ensuring that the target location is reached. In this work, we are interested in synthesizing “robust” strategies for ensuring reachability of a location in a timed automaton; with “robust”, we mean that it must still ensure reachability even when the delays are perturbed by the作者: countenance 時間: 2025-3-26 06:25
,Thesenf?rmige Zusammenfassung,cesses. Since the value may be irrational and an optimal strategy may be rather complicated, we concentrate on the problems of approximating the value up to a given error .?>?0 and computing a finite representation of an .-optimal strategy. We show that these problems are solvable in exponential tim作者: 矛盾心理 時間: 2025-3-26 10:00 作者: 護身符 時間: 2025-3-26 12:58 作者: 罐里有戒指 時間: 2025-3-26 20:49 作者: 純樸 時間: 2025-3-26 23:26
Die Darstellung der Grundlagen,We extend the theory of Cellular Automata to arbitrary, time-varying graphs.作者: bacteria 時間: 2025-3-27 04:45 作者: Adj異類的 時間: 2025-3-27 05:18
Causal Graph DynamicsWe extend the theory of Cellular Automata to arbitrary, time-varying graphs.作者: Foreknowledge 時間: 2025-3-27 12:54
Regular Languages of Infinite Trees That Are Boolean Combinations of Open SetsIn this paper, we study boolean (not necessarily positive) combinations of open sets. In other words, we study positive boolean combinations of safety and reachability conditions. We give an algorithm, which inputs a regular language of infinite trees, and decides if the language is a boolean combination of open sets.作者: BRIBE 時間: 2025-3-27 16:46 作者: Isolate 時間: 2025-3-27 18:26
https://doi.org/10.1007/978-3-8350-5487-5 consider variations of the basic model when inputs/outputs are restricted to strings and ranked trees, and in particular, present the model of ., which is the first known MSO-equivalent transducer model that processes trees in a bottom-up manner.作者: 矛盾 時間: 2025-3-28 01:04
Session Types and Distributed Computingng it easy to specify protocols and to validate programs against them, statically and at runtime..In this talk we introduce central ideas of session types through illustrative examples, identify different properties of concurrent and distributed systems which session types and associated theories ca作者: Gratuitous 時間: 2025-3-28 05:46
Streaming Tree Transducers consider variations of the basic model when inputs/outputs are restricted to strings and ranked trees, and in particular, present the model of ., which is the first known MSO-equivalent transducer model that processes trees in a bottom-up manner.作者: Cardiac-Output 時間: 2025-3-28 09:35 作者: ARBOR 時間: 2025-3-28 12:36
A Theory Independent Curry-De Bruijn-Howard Correspondences of . as input and returning proofs of . as output. Curry, De Bruijn, and Howard have developed this idea further. First, they have proposed to express these algorithms in the lambda-calculus, writing for instance ....?(.?.?.) for the proof of the proposition (. ?. ?.) ?. ?. taking a proof . of . ?作者: 1分開 時間: 2025-3-28 17:57 作者: coagulation 時間: 2025-3-28 22:49
Session Types and Distributed Computingtructures in an asynchronous version of the .-calculus. Its theory is supported and enriched by several foundations, including Linear Logic, automata theory, typed .-calculi and typed .-calculi. Unlike types for sequential computing, where types abstract and specify data and functions, session types作者: 歡騰 時間: 2025-3-29 01:43
Algorithms, Graph Theory, and the Solution of Laplacian Linear Equationstions in the Laplacian matrices of graphs and their submatrices. We begin with a few examples of where such equations arise, including the analysis of networks of resistors, the analysis of networks of springs, and the solution of maximum flow problems by interior point methods.作者: 陶醉 時間: 2025-3-29 07:03
Randomized Mechanisms for Multi-unit Auctionsigned to a number of agents (bidders) with different valuations on bundles of items. They are the central representative problem for the field of algorithmic mechanism design. In this field, algorithmic problems are studied in a game theoretic setting in which the input of the algorithm is not publi作者: 問到了燒瓶 時間: 2025-3-29 09:21
Algebraic Synchronization Trees and Processesation trees. In particular, we investigate the relative expressive power of algebraic recursion schemes over two signatures, which are based on those for Basic CCS and Basic Process Algebra, as a means for defining synchronization trees up to isomorphism as well as modulo bisimilarity and language e作者: 完整 時間: 2025-3-29 12:58
Streaming Tree Transducerstransforming hierarchically structured data such as XML documents. We introduce . as an analyzable, executable, and expressive model for transforming unranked ordered trees (and hedges) in a single pass. Given a linear encoding of the input tree, the transducer makes a single left-to-right pass thro作者: 落葉劑 時間: 2025-3-29 18:46 作者: Exonerate 時間: 2025-3-29 21:05 作者: chalice 時間: 2025-3-30 02:41 作者: GULLY 時間: 2025-3-30 05:04
Toward Model Theory with Data Valuestowski sets (FM sets, also known as nominal sets). The key idea is that we allow infinite disjunction (and conjunction), as long as the set of disjuncts (conjunct) is finite modulo renaming of data values. We study model theory for this logic; in particular we prove that the infinite disjunction can作者: Exposition 時間: 2025-3-30 08:24 作者: inflate 時間: 2025-3-30 16:01 作者: 胡言亂語 時間: 2025-3-30 19:01 作者: IVORY 時間: 2025-3-31 00:06
A Saturation Method for Collapsible Pushdown Systems. We believe this new model has many advantages. We present a saturation method for global backwards reachability analysis of these models that can also be used to analyse collapsible pushdown systems. Beginning with an automaton representing a set of configurations, we build an automaton accepting 作者: 哀求 時間: 2025-3-31 01:57
Regular Languages Are Church-Rosser Congruentialof Church-Rosser congruential languages was introduced by McNaughton, Narendran, and Otto in 1988. A language . is Church-Rosser congruential if there exists a finite, confluent, and length-reducing semi-Thue system . such that . is a finite union of congruence classes modulo .. It was known that th作者: 粗魯性質(zhì) 時間: 2025-3-31 07:31
https://doi.org/10.1007/978-3-8350-5487-5proofs of . to proofs of ., their type . is .. Thus the function . mapping propositions to the type of their proofs is a morphism transforming the operation ? into the operation →. In the same way, this morphism transforms cut-reduction in proofs into beta-reduction in lambda-terms.作者: 者變 時間: 2025-3-31 11:15
https://doi.org/10.1007/978-3-8350-5487-5em. A mechanism is called . or . if it allocates the goods and sets payments for the bidders in such a way that it is a dominant strategy for each bidder to report his/her valuations for different bundles of items in a truthful manner.作者: conference 時間: 2025-3-31 16:00
A Theory Independent Curry-De Bruijn-Howard Correspondenceproofs of . to proofs of ., their type . is .. Thus the function . mapping propositions to the type of their proofs is a morphism transforming the operation ? into the operation →. In the same way, this morphism transforms cut-reduction in proofs into beta-reduction in lambda-terms.作者: 束縛 時間: 2025-3-31 18:59
Randomized Mechanisms for Multi-unit Auctionsem. A mechanism is called . or . if it allocates the goods and sets payments for the bidders in such a way that it is a dominant strategy for each bidder to report his/her valuations for different bundles of items in a truthful manner.作者: 壯觀的游行 時間: 2025-3-31 22:17
0302-9743 refereed proceedings of the 39th International Colloquium on Automata, Languages and Programming, ICALP 2012, held in Warwick, UK, in July 2012. The total of 123 revised full papers presented in this volume were carefully reviewed and selected from 432 submissions. They are organized in three track作者: 安心地散步 時間: 2025-4-1 03:16
https://doi.org/10.1007/978-3-8350-5487-5for Basic CCS and Basic Process Algebra, as a means for defining synchronization trees up to isomorphism as well as modulo bisimilarity and language equivalence. The expressiveness of algebraic recursion schemes is also compared to that of the low levels in the Caucal hierarchy.作者: 最低點 時間: 2025-4-1 09:42
,Thesenf?rmige Zusammenfassung, up to a given error .?>?0 and computing a finite representation of an .-optimal strategy. We show that these problems are solvable in exponential time for a given configuration, and we also show that they are computationally hard in the sense that a polynomial-time approximation algorithm cannot exist unless P=NP.作者: Lipohypertrophy 時間: 2025-4-1 11:13
Algebraic Synchronization Trees and Processesfor Basic CCS and Basic Process Algebra, as a means for defining synchronization trees up to isomorphism as well as modulo bisimilarity and language equivalence. The expressiveness of algebraic recursion schemes is also compared to that of the low levels in the Caucal hierarchy.作者: 讓步 時間: 2025-4-1 16:50
Minimizing Expected Termination Time in One-Counter Markov Decision Processes up to a given error .?>?0 and computing a finite representation of an .-optimal strategy. We show that these problems are solvable in exponential time for a given configuration, and we also show that they are computationally hard in the sense that a polynomial-time approximation algorithm cannot exist unless P=NP.
