標(biāo)題: Titlebook: Automata, Languages and Programming; 30th International C Jos C. M. Baeten,Jan Karel Lenstra,Gerhard J. Woeg Conference proceedings 2003 Sp [打印本頁(yè)] 作者: 類(lèi)屬 時(shí)間: 2025-3-21 19:51
書(shū)目名稱(chēng)Automata, Languages and Programming影響因子(影響力)
書(shū)目名稱(chēng)Automata, Languages and Programming影響因子(影響力)學(xué)科排名
書(shū)目名稱(chēng)Automata, Languages and Programming網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱(chēng)Automata, Languages and Programming網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱(chēng)Automata, Languages and Programming被引頻次
書(shū)目名稱(chēng)Automata, Languages and Programming被引頻次學(xué)科排名
書(shū)目名稱(chēng)Automata, Languages and Programming年度引用
書(shū)目名稱(chēng)Automata, Languages and Programming年度引用學(xué)科排名
書(shū)目名稱(chēng)Automata, Languages and Programming讀者反饋
書(shū)目名稱(chēng)Automata, Languages and Programming讀者反饋學(xué)科排名
作者: outskirts 時(shí)間: 2025-3-21 23:22
Some Issues Regarding Search, Censorship, and Anonymity in Peer to Peer Networksluding efficiency issues, censorship issues, anonymity issues, etc. While many of these problems have been studied in the past, the file swapping application has taken over the Internet, given these problems renewed impetus. I will discuss papers co-authored with J. Saia, E. Cohen, H. Kaplan, R. Berman, A. Ta-Sham, and others.作者: 表狀態(tài) 時(shí)間: 2025-3-22 01:56
Approximation Schemes for Degree-Restricted MST and Red-Blue Separation Problemfor approximating TSP. Given . points in the plane, . = 2 or 3, and . > 0, the scheme finds an approximation with cost within 1 + . of the lowest cost spanning tree with the property that all nodes have degree at most .. We also develop a polynomial time approximation scheme for the Euclidean version of the Red-Blue Separation Problem.作者: Cytokines 時(shí)間: 2025-3-22 08:33 作者: dry-eye 時(shí)間: 2025-3-22 10:06 作者: 狂怒 時(shí)間: 2025-3-22 15:43 作者: MURKY 時(shí)間: 2025-3-22 17:34 作者: 大量殺死 時(shí)間: 2025-3-22 23:17
https://doi.org/10.1007/978-1-4842-7789-8odel serves in a natural way as a semantics for several program algebras. In particular, the fully abstract model of the program algebra axioms of [.] is considered which results by working modulo behavioral congruence. This algebra is extended with a new basic instruction, named ‘entry instruction’作者: lethal 時(shí)間: 2025-3-23 03:11 作者: Aviary 時(shí)間: 2025-3-23 05:34
Getting to Know Visual Studio 2019,roduced by Di Battista and Tamassia [.] based on ideas by Bienstock and Monma [[.], [.]]. For planar graphs, SPQR-trees have the nice property to represent the set of all its combinatorial embeddings. Therefore, the data structure has mainly (but not only) been used in the area of planar graph algor作者: collagen 時(shí)間: 2025-3-23 12:12 作者: 背心 時(shí)間: 2025-3-23 14:21
Getting Familiar with WidgetKit in a Flash,of the type “does . intersect .?”, where . is a subset of .. Group testing is a basic search paradigm that occurs in a variety of situations such as quality control in product testing, searching in storage systems, multiple access communications, and software testing, among the others. Group testing作者: MORPH 時(shí)間: 2025-3-23 20:09 作者: 破布 時(shí)間: 2025-3-24 00:07 作者: PACK 時(shí)間: 2025-3-24 04:45
Web Crawl Processing on Big Data Scale,e spaces. We present the language and a type system for controlling the activities, e.g. access to resources and mobility, of the processes in a net. By dealing with privileges acquisition, the type system enables dynamic variations of security policies. We exploit a combination of static and dynami作者: 弓箭 時(shí)間: 2025-3-24 08:28
Web Crawl Processing on Big Data Scale,rsive definitions. These two approaches are equivalent in the full .-calculus, while there is a common agreement that this is not the case when name mobility is not allowed (as in the case of CCS), even if no formal discriminating results have been proved so far..We consider a hierarchy of calculi, 作者: maculated 時(shí)間: 2025-3-24 11:23
https://doi.org/10.1007/978-94-6091-846-9tion developed in [.], we obtain a combinatorial algorithm with a performance factor of 3.27 for any . ≥ 2, thus improving the previous bound of 4.56. Then we develop another combinatorial algorithm that has a better performance guarantee and uses the first algorithm as a subroutine. The latter algo作者: 鄙視 時(shí)間: 2025-3-24 15:53
They Call It a Credit Card for a Reason, .(.) ≤ . · (.(.) + .(.)) for all nodes .. Chandran and Ram [.] recently gave the first constant factor approximation algorithm with polynomial running time for this problem. They achieve performance ratio ./1?.. We devise an approximation algorithm with performance ratio ., which is better than the作者: 豐滿(mǎn)有漂亮 時(shí)間: 2025-3-24 21:32 作者: 愛(ài)管閑事 時(shí)間: 2025-3-25 02:55
Navigating the Maze of the SBA,for approximating TSP. Given . points in the plane, . = 2 or 3, and . > 0, the scheme finds an approximation with cost within 1 + . of the lowest cost spanning tree with the property that all nodes have degree at most .. We also develop a polynomial time approximation scheme for the Euclidean versio作者: 口訣 時(shí)間: 2025-3-25 03:19
Keeping Your Relationship Personal,rected graph . = (.), a subset of vertices ... called ., and an integer . ≤ |.|, the objective is to find a minimum weight set of edges whose removal results in . disconnected components, each of which contains at least one terminal. We give two approximation algorithms for the problem: a 2 ? 2/.-ap作者: 手術(shù)刀 時(shí)間: 2025-3-25 08:39
The Sun Will Come Out Tomorrow,d by analyzing a simple greedy heuristic. Then, we give an algorithm that approximates MAX .-CUT within expected polynomial time. The approximation ratio tends to 1 as .→ ∞. As an application, we obtain an algorithm for approximating the chromatic number of .., 1/.≤ . ≤ 1/2, within a factor of . in 作者: Crepitus 時(shí)間: 2025-3-25 12:28 作者: scrape 時(shí)間: 2025-3-25 16:05 作者: Inflated 時(shí)間: 2025-3-25 20:35 作者: CLIFF 時(shí)間: 2025-3-26 02:00
Dhananjay V. Gadre,Sarthak GuptaWe describe several computational problems on prediction and design of RNA molecules.作者: deadlock 時(shí)間: 2025-3-26 06:36 作者: 過(guò)去分詞 時(shí)間: 2025-3-26 10:53 作者: Largess 時(shí)間: 2025-3-26 12:46 作者: 滑動(dòng) 時(shí)間: 2025-3-26 20:26 作者: STALE 時(shí)間: 2025-3-26 21:24
Getting Familiar with WidgetKit in a Flash,information theoretic lower bound on the problem. We also provide efficient algorithms for the case in which there is a Bernoulli probability distribution on the possible sets ., and an optimal algorithm for the case in which the outcome of tests may be unreliable because of the presence of “inhibit作者: Grievance 時(shí)間: 2025-3-27 04:52 作者: GUILE 時(shí)間: 2025-3-27 08:26
Generalized Framework for Selectors with Applications in Optimal Group Testinginformation theoretic lower bound on the problem. We also provide efficient algorithms for the case in which there is a Bernoulli probability distribution on the possible sets ., and an optimal algorithm for the case in which the outcome of tests may be unreliable because of the presence of “inhibit作者: arterioles 時(shí)間: 2025-3-27 10:05
Approximation Algorithm for Directed Telephone Multicast Problem) due to [.]..We show that our algorithm for the directed multicast problem can be used to derive an algorithm with a similar ratio for the . problem, that is, the problem of constructing an arborescence that spans a collection . of terminals, minimizing the sum of height of the arborescence plus ma作者: Melanoma 時(shí)間: 2025-3-27 15:23 作者: 惰性氣體 時(shí)間: 2025-3-27 21:08 作者: hazard 時(shí)間: 2025-3-27 22:41
The SPQR-Tree Data Structure in Graph Drawingroduced by Di Battista and Tamassia [.] based on ideas by Bienstock and Monma [[.], [.]]. For planar graphs, SPQR-trees have the nice property to represent the set of all its combinatorial embeddings. Therefore, the data structure has mainly (but not only) been used in the area of planar graph algor作者: 悲觀 時(shí)間: 2025-3-28 04:11 作者: GRIN 時(shí)間: 2025-3-28 07:51
Generalized Framework for Selectors with Applications in Optimal Group Testingof the type “does . intersect .?”, where . is a subset of .. Group testing is a basic search paradigm that occurs in a variety of situations such as quality control in product testing, searching in storage systems, multiple access communications, and software testing, among the others. Group testing作者: tackle 時(shí)間: 2025-3-28 11:34 作者: 矛盾心理 時(shí)間: 2025-3-28 15:10
On the Axiomatizability of Ready Traces, Ready Simulation, and Failure Traceshabet of actions is finite, then there exists a (sound and complete) finite equational axiomatization for the process algebra BCCSP modulo ready trace semantics. We prove that if the alphabet is infinite, then such an axiomatization does not exist. Furthermore, we present finite equational axiomatiz作者: 存心 時(shí)間: 2025-3-28 20:31 作者: Spongy-Bone 時(shí)間: 2025-3-29 00:46 作者: 奇思怪想 時(shí)間: 2025-3-29 05:24 作者: inculpate 時(shí)間: 2025-3-29 11:13
An Improved Approximation Algorithm for the Asymmetric TSP with Strengthened Triangle Inequality .(.) ≤ . · (.(.) + .(.)) for all nodes .. Chandran and Ram [.] recently gave the first constant factor approximation algorithm with polynomial running time for this problem. They achieve performance ratio ./1?.. We devise an approximation algorithm with performance ratio ., which is better than the作者: Needlework 時(shí)間: 2025-3-29 11:50 作者: 憤世嫉俗者 時(shí)間: 2025-3-29 16:55
Approximation Schemes for Degree-Restricted MST and Red-Blue Separation Problemfor approximating TSP. Given . points in the plane, . = 2 or 3, and . > 0, the scheme finds an approximation with cost within 1 + . of the lowest cost spanning tree with the property that all nodes have degree at most .. We also develop a polynomial time approximation scheme for the Euclidean versio作者: 儲(chǔ)備 時(shí)間: 2025-3-29 21:11
Approximating Steiner ,-Cutsrected graph . = (.), a subset of vertices ... called ., and an integer . ≤ |.|, the objective is to find a minimum weight set of edges whose removal results in . disconnected components, each of which contains at least one terminal. We give two approximation algorithms for the problem: a 2 ? 2/.-ap作者: 間諜活動(dòng) 時(shí)間: 2025-3-30 00:34 作者: 喚起 時(shí)間: 2025-3-30 06:57
Approximation Algorithm for Directed Telephone Multicast Problemdiscrete “rounds”, and in every round every processor is allowed to pick one of its neighbors, and to send him a message. The . problem requires to compute a schedule with minimal number of rounds that delivers a message from a given single processor, that generates the message, to all the processor作者: colony 時(shí)間: 2025-3-30 10:35 作者: adequate-intake 時(shí)間: 2025-3-30 15:17
They Call It a Credit Card for a Reason,g time for this problem. They achieve performance ratio ./1?.. We devise an approximation algorithm with performance ratio ., which is better than the one by Chandran and Ram for . ∈ [0.6507, 1), that is, for the particularly interesting large values of ..作者: 驚惶 時(shí)間: 2025-3-30 19:29 作者: 同音 時(shí)間: 2025-3-30 23:46 作者: A簡(jiǎn)潔的 時(shí)間: 2025-3-31 01:40 作者: 眨眼 時(shí)間: 2025-3-31 07:57
MAX ,-CUT and Approximating the Chromatic Number of Random Graphstio tends to 1 as .→ ∞. As an application, we obtain an algorithm for approximating the chromatic number of .., 1/.≤ . ≤ 1/2, within a factor of . in polynomial expected time, thereby answering a question of Krivelevich and Vu, and extending a result of Coja-Oghlan and Taraz. We give similar algorithms for random regular graphs ...作者: 欲望 時(shí)間: 2025-3-31 09:36
Getting to Know Visual Studio 2019,ons reach from Steiner tree problems, to on-line problems in a dynamic setting as well as problems concerned with planarity and graph drawing. This paper gives a survey on the use of SPQR-trees in graph algorithms, with a focus on graph drawing.作者: Fermentation 時(shí)間: 2025-3-31 17:17
https://doi.org/10.1007/978-1-4842-8922-8tion..One-way two-counter machines represent a universal model of computation. Here we consider the polynomial-time classes of multicounter machines with a constant number of reversals and separate the computational power of nondeterminism, randomization and determinism.作者: 縮影 時(shí)間: 2025-3-31 21:34
Web Crawl Processing on Big Data Scale,CS, provided that recursive process definitions are allowed, while termination turns out to be decidable when only replication is permitted. On the other hand, this discrimination result does not hold any longer when we move to the next calculus in the hierarchy, which supports a very limited form of name mobility.作者: 裙帶關(guān)系 時(shí)間: 2025-4-1 00:06
https://doi.org/10.1007/978-94-6091-846-9s, for the cases of . = 2 and . = 3 the second combinatorial algorithm ensures an approximation factor significantly better than 3, which is currently the best approximation ratio for the .-level problem provided by the non-combinatorial algorithm due to Aardal, Chudak, and Shmoys [.].
