標(biāo)題: Titlebook: Language and Automata Theory and Applications; 8th International Co Adrian-Horia Dediu,Carlos Martín-Vide,Bianca Truth Conference proceedin [打印本頁(yè)] 作者: 指責(zé) 時(shí)間: 2025-3-21 19:49
書目名稱Language and Automata Theory and Applications影響因子(影響力)
書目名稱Language and Automata Theory and Applications影響因子(影響力)學(xué)科排名
書目名稱Language and Automata Theory and Applications網(wǎng)絡(luò)公開度
書目名稱Language and Automata Theory and Applications網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Language and Automata Theory and Applications被引頻次
書目名稱Language and Automata Theory and Applications被引頻次學(xué)科排名
書目名稱Language and Automata Theory and Applications年度引用
書目名稱Language and Automata Theory and Applications年度引用學(xué)科排名
書目名稱Language and Automata Theory and Applications讀者反饋
書目名稱Language and Automata Theory and Applications讀者反饋學(xué)科排名
作者: 不成比例 時(shí)間: 2025-3-21 20:59
Sanjeev Khannaems that are typically not considered by other resource-aware strategies, bringing about resource-saving opportunities that traditional approaches fail to uncover...The performance of the proposed models and strategies is empirically evaluated for several use cases. All of the considered examples sh作者: 捕鯨魚叉 時(shí)間: 2025-3-22 03:42
Helmut Seidl,Máté Kovácsal model of computation. .POLIS was initiated in 1988 as a research project at the University ofCalifornia at Berkeley and, over the years, grew into a full designmethodology with a software system supporting it. ..Hardware-Software Co-Design of Embedded Systems: The POLISApproach. is intended to gi作者: BINGE 時(shí)間: 2025-3-22 05:47 作者: 直覺好 時(shí)間: 2025-3-22 11:18
Marcella Anselmo,Dora Giammarresi,Maria Madoniace..The subproblems such as scheduling, allocation, or timing analysis on a fixed-architecture distributed system are NP-hard, let alone the overall architecture synthesis problem. Gupta [30] pointed out that timing is a global property and needs to be recalculated for the entire problem; it is why 作者: Neuralgia 時(shí)間: 2025-3-22 13:55 作者: 輕浮女 時(shí)間: 2025-3-22 17:40
Zuzana Bednárová,Viliam GeffertThe HAL abstraction, through the use of well defined HAL APIs, makes easier the software portability and enables flexibility. The paper shows that the HAL APIs allow early software development before the hardware architecture is available, but also architecture exploration. The proposed methodology 作者: 破裂 時(shí)間: 2025-3-22 22:29 作者: 道學(xué)氣 時(shí)間: 2025-3-23 03:35 作者: overbearing 時(shí)間: 2025-3-23 05:31 作者: 模仿 時(shí)間: 2025-3-23 10:17 作者: cleaver 時(shí)間: 2025-3-23 15:37 作者: 貨物 時(shí)間: 2025-3-23 21:15
Alexandre Blondin Massé,Sébastien Gaboury,Sylvain Hallé,Micha?l Larouchented for determining the optimum solution to any co-designproblem, including partitioning, architecture synthesis and codegeneration. .When deciding on trade-offs, one of the main factors to be consideredis the flow of communication, especially to and from the outsideworld. This involves the modelin作者: Noisome 時(shí)間: 2025-3-24 01:24 作者: MEEK 時(shí)間: 2025-3-24 03:48 作者: 賞錢 時(shí)間: 2025-3-24 06:55 作者: 枯燥 時(shí)間: 2025-3-24 11:33
Daniel Bundala,Jakub Závodnyarding the In Car listening and communication experience. Starting from a high level description of the algorithms, several implementations on different levels of hardware abstraction are presented, along with empirical results on both the design process undergone and the performance results achieve作者: GROG 時(shí)間: 2025-3-24 15:57
0302-9743 utational biology and bioinformatics; string processing algorithms; symbolic dynamics; term rewriting; transducers; trees, tree languages and tree automata; wei978-3-319-04920-5978-3-319-04921-2Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Factorable 時(shí)間: 2025-3-24 20:31 作者: 千篇一律 時(shí)間: 2025-3-25 01:09 作者: 和平 時(shí)間: 2025-3-25 07:17
Adrian-Horia Dediu,Carlos Martín-Vide,Bianca Truth作者: 莎草 時(shí)間: 2025-3-25 10:52
On the Parikh Membership Problem for FAs, PDAs, and CMslgorithms for a generalization of a tiling problem posed recently by Dana Scott. Finally, we give a classification of the complexity of the membership problem for restricted classes of semilinear sets.作者: WAX 時(shí)間: 2025-3-25 13:51 作者: 姑姑在炫耀 時(shí)間: 2025-3-25 17:10
Conference proceedings 2014age varieties and semigroups; parsing; patterns; quantum, chemical and optical computing; semantics; string and combinatorial issues in computational biology and bioinformatics; string processing algorithms; symbolic dynamics; term rewriting; transducers; trees, tree languages and tree automata; wei作者: 辮子帶來(lái)幫助 時(shí)間: 2025-3-25 22:01 作者: 含鐵 時(shí)間: 2025-3-26 00:22 作者: 大量 時(shí)間: 2025-3-26 06:07
Picture Codes with Finite Deciphering Delayite deciphering delay sets are an interesting class of string codes that coincide with prefix codes in the case of delay equal to 0. An analogous notion is introduced for picture codes and it is proved that they correspond to a bigger class of decidable picture codes that includes interesting examples and special cases.作者: 暗語(yǔ) 時(shí)間: 2025-3-26 08:50 作者: callous 時(shí)間: 2025-3-26 13:34
Conference proceedings 2014n Madrid, Spain in March 2014..The 45 revised full papers presented together with 4 invited talks were carefully reviewed and selected from 116 submissions. The papers cover the following topics: algebraic language theory; algorithms on automata and words; automata and logic; automata for system ana作者: GNAW 時(shí)間: 2025-3-26 19:25
Matchings, Random Walks, and Samplingly smaller than the size of the input that they operate on. In this talk, we will describe some results that illustrate surprising effectiveness of randomization in solving exact and approximate matching problems in sublinear space or time.作者: antiandrogen 時(shí)間: 2025-3-26 22:53
Formulae for Polyominoes on Twisted Cylindersear recurrence whose complexity grows exponentially with .. By building the finite automaton that “grows” polyominoes on the twisted cylinder, we obtain the prefix of the sequence enumerating these polyominoes. Then, we recover the recurrence formula by using the Berlekamp-Massey algorithm.作者: MAG 時(shí)間: 2025-3-27 03:28 作者: consent 時(shí)間: 2025-3-27 07:29 作者: dissolution 時(shí)間: 2025-3-27 13:19 作者: 勉強(qiáng) 時(shí)間: 2025-3-27 17:08
On the List Update Problem with Advicee show that surprisingly two bits of advice is sufficient to break the lower bound of 2 on the competitive ratio of deterministic online algorithms and achieve a deterministic algorithm with a competitive ratio of .. In this upper-bound argument, the bits of advice determine the algorithm with smaller cost among three classical online algorithms.作者: 尖酸一點(diǎn) 時(shí)間: 2025-3-27 20:25
Shift-Reduce Parsers for Transition Networksrsing of . grammars or .’s. The corresponding parser is smaller than a classical one, without any extra bookkeeping. A constraint on .’s is mentioned, which enables top-down deterministic . (1) analysis.作者: Ardent 時(shí)間: 2025-3-27 22:11 作者: Altitude 時(shí)間: 2025-3-28 03:17 作者: BRACE 時(shí)間: 2025-3-28 06:58 作者: Graves’-disease 時(shí)間: 2025-3-28 11:01 作者: 不妥協(xié) 時(shí)間: 2025-3-28 15:21
https://doi.org/10.1007/978-3-319-04921-2algebraic complexity theory; algebraic language theory; combinatorics on words; computational complexit作者: 不愛防注射 時(shí)間: 2025-3-28 20:24
A Brief History of Strahler Numberss in its history, and its connection to arithmetic expressions, graph traversing, decision problems for context-free languages, Parikh’s theorem, and Newton’s procedure for approximating zeros of differentiable functions.作者: 極大的痛苦 時(shí)間: 2025-3-29 00:44
Computing Optimal Reachability Costs in Priced Dense-Timed Pushdown Automataeal-valued clocks, and that the stack symbols have real-valued ages. Furthermore, the model allows a cost function that assigns transition costs to transitions and storage costs to stack symbols. We show that the optimal cost, i.e., the infimum of the costs of the set of runs reaching a given control state, is computable.作者: Abutment 時(shí)間: 2025-3-29 06:14 作者: Genetics 時(shí)間: 2025-3-29 10:23 作者: genesis 時(shí)間: 2025-3-29 12:45
978-3-319-04920-5Springer International Publishing Switzerland 2014作者: Forsake 時(shí)間: 2025-3-29 18:06
Language and Automata Theory and Applications978-3-319-04921-2Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 改革運(yùn)動(dòng) 時(shí)間: 2025-3-29 21:07 作者: CHIP 時(shí)間: 2025-3-29 23:56 作者: Generator 時(shí)間: 2025-3-30 07:52 作者: BOLUS 時(shí)間: 2025-3-30 09:43
Oscar H. Ibarra,Bala Ravikumarious systems and applications, as demonstrated with multiple.This book proposes probabilistic machine learning models that represent the hardware properties of the device hosting them. These models can be used to evaluate the impact that a specific device configuration may have on resource consumpti作者: objection 時(shí)間: 2025-3-30 12:38 作者: Dorsal 時(shí)間: 2025-3-30 20:03
Helmut Seidl,Máté Kovácssly with an environment through sensors andactuators. The programmable parts include micro-controllers andDigital Signal Processors (DSPs). .Embedded systems are often used in life-critical situations, wherereliability and safety are more important criteria than performance.Today, embedded systems a作者: 性行為放縱者 時(shí)間: 2025-3-30 22:40 作者: 一再困擾 時(shí)間: 2025-3-31 04:24 作者: 愛管閑事 時(shí)間: 2025-3-31 05:14 作者: 出處 時(shí)間: 2025-3-31 09:58 作者: Manifest 時(shí)間: 2025-3-31 14:20
Zuzana Bednárová,Viliam Geffertrder to reduce the long and fastidious design process, embedded software needs to be reused over several MPSoCs. Thus, software portability becomes a key challenge..In this chapter, we present a clear separation between the hardware independent and the hardware dependent software layers, through ado作者: browbeat 時(shí)間: 2025-3-31 21:25 作者: Halfhearted 時(shí)間: 2025-3-31 22:48
Slimane Bellaouar,Hadda Cherroun,Djelloul Ziadint steps performed at design, compile, and run time. The details of these architectures are provided in Chaps.?4 and 5. First, Sect.?3.1 discusses an H.324 video conferencing application and provides the processing time distribution of different computational hot spots of various application tasks.
