標(biāo)題: Titlebook: Automata, Languages and Programming; 28th International C Fernando Orejas,Paul G. Spirakis,Jan Leeuwen Conference proceedings 2001 Springer [打印本頁] 作者: Fatuous 時(shí)間: 2025-3-21 17:30
書目名稱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é)科排名
作者: investigate 時(shí)間: 2025-3-21 22:37 作者: Isthmus 時(shí)間: 2025-3-22 02:36 作者: Euphonious 時(shí)間: 2025-3-22 08:14
Integrating Semantics for Object—Oriented System Models concerns reduces the complexity of the development, but prompts the question for their integration, i.e., the conception of a collection of heterogeneous models as a complete specification of a system. The integration can be achieved by using a common semantic domain for the interpretation of all m作者: Arroyo 時(shí)間: 2025-3-22 11:34 作者: 聯(lián)想 時(shí)間: 2025-3-22 13:04 作者: AWRY 時(shí)間: 2025-3-22 19:28
On Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalitiessystem of . linear inequalities in . variables, the number of maximal infeasible integer vectors is at most . times the number of minimal integer solutions to the system. This bound is accurate up to a . factor and leads to a polynomial-time reduction of the enumeration problem to a natural generali作者: gusher 時(shí)間: 2025-3-22 22:38 作者: Bmd955 時(shí)間: 2025-3-23 02:03
A Framework for Index Bulk Loading and Dynamization(or .) for indexing a set of points in ?..Well-known examples of wp-trees include .d- trees, BBD-trees, pseudo-quad-trees, and BAR-trees. Given an efficient external wp-tree construction algorithm, we present a general framework for automatically obtaining a dynamic external data structure. Using th作者: aesthetician 時(shí)間: 2025-3-23 07:32 作者: handle 時(shí)間: 2025-3-23 11:45
The Complexity of Constructing Evolutionary Trees Using Experimentsstructs an evolutionary tree of . species in time .(. log..) using at most .?./2?(log..+.(1)) experiments for . > 2, and at most .(log .+.(1)) experiments for . = 2, where . is the degree of the tree. This improves the previous best upper bound by a factor .(log .). For . = 2 the previously best alg作者: 牌帶來 時(shí)間: 2025-3-23 15:22
Hidden Pattern Statisticsunderstood as a sequence of consecutive symbols). A characteristic parameter is the number of occurrences of a given pattern . of length . as a subsequence in a random text of length . generated by a memoryless source. Spacings between letters of the pattern may either be constrained or not in order作者: Minatory 時(shí)間: 2025-3-23 19:28 作者: semiskilled 時(shí)間: 2025-3-24 00:03
All-Pairs Shortest Paths Computation in the BSP ModelSP algorithm for the all-pairs shortest paths problem in a weighted directed dense graph. In contrast with the general algebraic path algorithm, which performs .(..) to .(..) global synchronisation steps, our new algorithm only requires .(log .) synchronisation steps.作者: 工作 時(shí)間: 2025-3-24 02:39 作者: 即席 時(shí)間: 2025-3-24 06:52
Approximation Hardness of TSP with Bounded Metricsonstant factor as soon as the metric is bounded. In this paper we study the asymmetric and symmetric TSP problems with bounded metrics and prove approximation lower bounds of 101/100 and 203/202, respectively, for these problems. We prove also approximation lower bounds of 321/320 and 743/742 for th作者: N斯巴達(dá)人 時(shí)間: 2025-3-24 12:13 作者: podiatrist 時(shí)間: 2025-3-24 16:06 作者: transdermal 時(shí)間: 2025-3-24 22:30
A Characterization of Temporal Locality and Its Portability across Memory Hierarchiesre are computations whose optimal schedule does vary with the access function. In particular, we exhibit some computations for which any schedule is bound to be a polynomial factor slower than optimal on at least one of two sufficiently different machines. On the positive side, we show that relative作者: Vulnerable 時(shí)間: 2025-3-25 01:28 作者: Musket 時(shí)間: 2025-3-25 03:41
Bürger und Gemeinwesen in Europare are computations whose optimal schedule does vary with the access function. In particular, we exhibit some computations for which any schedule is bound to be a polynomial factor slower than optimal on at least one of two sufficiently different machines. On the positive side, we show that relative作者: Insulin 時(shí)間: 2025-3-25 11:28 作者: 斥責(zé) 時(shí)間: 2025-3-25 12:23
Integrating Semantics for Object—Oriented System Modelsodels, where each viewpoint model, due to its partiality, admits a set of possible interpretations. In this paper such an integrating semantic domain is sketched and an application to structure and behaviour models of the Unified Modeling Language is discussed.作者: 撫育 時(shí)間: 2025-3-25 18:07 作者: Infusion 時(shí)間: 2025-3-25 21:42
Gewaltenteilung und Parteien im Wandeln a box. We provide a quasi-polynomial algorithm for the latter dualization problem. These results imply, in particular, that the problem of incrementally generating minimal integer solutions of a monotone system of linear inequalities can be done in quasi-polynomial time.作者: Obliterate 時(shí)間: 2025-3-26 00:46 作者: CESS 時(shí)間: 2025-3-26 08:04 作者: ERUPT 時(shí)間: 2025-3-26 09:40 作者: Diuretic 時(shí)間: 2025-3-26 15:16 作者: 使苦惱 時(shí)間: 2025-3-26 20:23
The Complexity of Constructing Evolutionary Trees Using Experimentser bound, matching our upper bounds and improving the previous best lower bound by a factor .(log..). Central to our algorithm is the construction and maintenance of separator trees of small height, which may be of independent interest.作者: 沖突 時(shí)間: 2025-3-26 21:20 作者: Projection 時(shí)間: 2025-3-27 03:41
Approximation Algorithms for Partial Covering Problemsty at most three, we obtain an approximation of 4/3. We also present better-than-2-approximation algorithms for .-vertex cover on bounded degree graphs, and for vertex cover on expanders of bounded . degree. We obtain a polynomial-time approximation scheme for .-vertex cover on planar graphs, and for covering points in .. by disks.作者: Shuttle 時(shí)間: 2025-3-27 06:42 作者: 天文臺(tái) 時(shí)間: 2025-3-27 12:08
Zur Faszination von Action- und Horrorfilmenesults on evolutionary algorithms are presented in order to show how theoretical results on randomized search heuristics can be proved and how they contribute to the understanding of evolutionary algorithms.作者: Brochure 時(shí)間: 2025-3-27 16:03 作者: 讓步 時(shí)間: 2025-3-27 19:51
https://doi.org/10.1007/978-3-662-66706-4the discrepancy with respect to the set of all subintervals, and give an efficient algorithm to report all of them. Then, we give an optimal method to construct a compact graph to represent the set of global roundings satisfying a weaker discrepancy condition.作者: gentle 時(shí)間: 2025-3-28 01:14
Gewaltfreie M?nnlichkeitsidealeximation lower bounds of 101/100 and 203/202, respectively, for these problems. We prove also approximation lower bounds of 321/320 and 743/742 for the asymmetric and symmetric TSP with distances one and two.作者: AGONY 時(shí)間: 2025-3-28 02:35 作者: Hot-Flash 時(shí)間: 2025-3-28 10:12
Theoretical Aspects of Evolutionary Algorithmsesults on evolutionary algorithms are presented in order to show how theoretical results on randomized search heuristics can be proved and how they contribute to the understanding of evolutionary algorithms.作者: 演講 時(shí)間: 2025-3-28 13:31 作者: aneurysm 時(shí)間: 2025-3-28 16:21 作者: 吃掉 時(shí)間: 2025-3-28 22:47 作者: 懶惰民族 時(shí)間: 2025-3-28 22:58
Ursachen abweichenden Verhaltensd to range over infinite domains (e.g., unbounded stacks, queues, arrays, counters), or over finite domains whose sizes are left as parameters. Moreover, many systems are defined as networks of parametric size, i.e., they are assumed to work for an arbitrary number of processes running in parallel.作者: 救護(hù)車 時(shí)間: 2025-3-29 04:58 作者: temperate 時(shí)間: 2025-3-29 08:56
Languages, Rewriting Systems, and Verification of Infinite-State Systemsd to range over infinite domains (e.g., unbounded stacks, queues, arrays, counters), or over finite domains whose sizes are left as parameters. Moreover, many systems are defined as networks of parametric size, i.e., they are assumed to work for an arbitrary number of processes running in parallel.作者: GNAW 時(shí)間: 2025-3-29 14:46 作者: Mets552 時(shí)間: 2025-3-29 17:25
Die Landesmedienanstalten in der Pflicht?odels, where each viewpoint model, due to its partiality, admits a set of possible interpretations. In this paper such an integrating semantic domain is sketched and an application to structure and behaviour models of the Unified Modeling Language is discussed.作者: 大笑 時(shí)間: 2025-3-29 22:39
Regierungsmehrheit und Oppositionis framework together with a new general construction (bulk loading) technique of independent interest, we obtain data structures with guaranteed good update performance in terms of I/O transfers. Our approach gives considerably improved construction and update I/O bounds for e.g. external .d-trees and BBD-trees.作者: 放肆的我 時(shí)間: 2025-3-30 01:22
Automata, Circuits, and Hybrids: Facets of Continuous Timef, paradigms in which continuous time is involved whether in a pure way or in cooperation with discrete time. This development is in particular evident in the area that covers the following three interrelated trends: automata, logic (arguing about automata) and interaction (composition of automata).作者: 現(xiàn)任者 時(shí)間: 2025-3-30 04:40 作者: CHAR 時(shí)間: 2025-3-30 10:59 作者: Phenothiazines 時(shí)間: 2025-3-30 15:50
Fernando Orejas,Paul G. Spirakis,Jan LeeuwenIncludes supplementary material: 作者: 心胸開闊 時(shí)間: 2025-3-30 18:51
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/b/image/166220.jpg作者: 沒血色 時(shí)間: 2025-3-30 20:51
Zur Faszination von Action- und HorrorfilmenLabelled partial orders in concurrency are a natural and powerful modelling formalism. Recently, there has been a renewed focus on such models arising in various areas of applications. We survey some results on interesting problems for partial order based models, focussing on decidability issues.作者: Hallowed 時(shí)間: 2025-3-31 01:23
Modelling with Partial Orders — Why and Why Not?Labelled partial orders in concurrency are a natural and powerful modelling formalism. Recently, there has been a renewed focus on such models arising in various areas of applications. We survey some results on interesting problems for partial order based models, focussing on decidability issues.作者: 氣候 時(shí)間: 2025-3-31 05:35
https://doi.org/10.1007/978-3-658-33375-1mann computer and its software, employing the mathematical tools of Logic and Combinatorics. The next half century appears now much more confusing (half- centuries tend to look like that in the beginning). What computational artifact will be the object of the next great modeling adventure of our fie作者: Negotiate 時(shí)間: 2025-3-31 12:00
https://doi.org/10.1007/978-3-658-33375-1f, paradigms in which continuous time is involved whether in a pure way or in cooperation with discrete time. This development is in particular evident in the area that covers the following three interrelated trends: automata, logic (arguing about automata) and interaction (composition of automata).作者: LATHE 時(shí)間: 2025-3-31 16:43 作者: perpetual 時(shí)間: 2025-3-31 18:41
Die Landesmedienanstalten in der Pflicht? concerns reduces the complexity of the development, but prompts the question for their integration, i.e., the conception of a collection of heterogeneous models as a complete specification of a system. The integration can be achieved by using a common semantic domain for the interpretation of all m作者: judiciousness 時(shí)間: 2025-3-31 23:29 作者: 圓木可阻礙 時(shí)間: 2025-4-1 03:53 作者: Thyroxine 時(shí)間: 2025-4-1 08:16
Gewaltenteilung und Parteien im Wandelsystem of . linear inequalities in . variables, the number of maximal infeasible integer vectors is at most . times the number of minimal integer solutions to the system. This bound is accurate up to a . factor and leads to a polynomial-time reduction of the enumeration problem to a natural generali作者: 滲透 時(shí)間: 2025-4-1 13:19
Bürger und Gemeinwesen in Europauits. This has been perhaps the outstanding natural problem known to be in a standard circuit complexity class, but not known to be in its uniform version. We show that indeed division is in uniform TC.. A key step of our proof is the discovery of a first-order formula expressing exponentiation modu作者: TRACE 時(shí)間: 2025-4-1 17:40
Regierungsmehrheit und Opposition(or .) for indexing a set of points in ?..Well-known examples of wp-trees include .d- trees, BBD-trees, pseudo-quad-trees, and BAR-trees. Given an efficient external wp-tree construction algorithm, we present a general framework for automatically obtaining a dynamic external data structure. Using th
