標(biāo)題: Titlebook: Design and Analysis of Algorithms; First Mediterranean Guy Even,Dror Rawitz Conference proceedings 2012 Springer-Verlag Berlin Heidelberg [打印本頁] 作者: Neogamist 時(shí)間: 2025-3-21 18:03
書目名稱Design and Analysis of Algorithms影響因子(影響力)
書目名稱Design and Analysis of Algorithms影響因子(影響力)學(xué)科排名
書目名稱Design and Analysis of Algorithms網(wǎng)絡(luò)公開度
書目名稱Design and Analysis of Algorithms網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Design and Analysis of Algorithms被引頻次
書目名稱Design and Analysis of Algorithms被引頻次學(xué)科排名
書目名稱Design and Analysis of Algorithms年度引用
書目名稱Design and Analysis of Algorithms年度引用學(xué)科排名
書目名稱Design and Analysis of Algorithms讀者反饋
書目名稱Design and Analysis of Algorithms讀者反饋學(xué)科排名
作者: DENT 時(shí)間: 2025-3-21 22:07 作者: Obstruction 時(shí)間: 2025-3-22 00:30 作者: 作繭自縛 時(shí)間: 2025-3-22 04:56 作者: 四目在模仿 時(shí)間: 2025-3-22 10:17
Catherine Allan,Allan Curtis,Bruce ShindlerWe show that SETF, the idealized version of the uniprocessor scheduling algorithm used by Unix, is scalable for the objective of fractional flow on a homogeneous multiprocessor. We also give a potential function analysis for the objective of weighted fractional flow on a uniprocessor.作者: 刪減 時(shí)間: 2025-3-22 14:19
Shortest-Elapsed-Time-First on a Multiprocessor,We show that SETF, the idealized version of the uniprocessor scheduling algorithm used by Unix, is scalable for the objective of fractional flow on a homogeneous multiprocessor. We also give a potential function analysis for the objective of weighted fractional flow on a uniprocessor.作者: 刪減 時(shí)間: 2025-3-22 17:34
Mart-Jan Schelhaas,Marian Lajos Mayrn, i.e., the longest subsequence . of ., for which there exists a number . such that the absolute difference between any two consecutive numbers in the subsequence is at least . and at most .(1?+?.)..The best known algorithm for this problem has .(..) time complexity. This bound is too high for larg作者: 調(diào)色板 時(shí)間: 2025-3-23 00:07
Arnór Snorrason,Bjarki Kjartanssonding, are not applicable. This has recently been demonstrated for Strassen’s and Strassen-like fast square matrix multiplication algorithms. Here we extend the expansion analysis approach to fast algorithms for rectangular matrix multiplication, obtaining a new class of communication cost lower boun作者: pericardium 時(shí)間: 2025-3-23 03:47
Arnór Snorrason,Bjarki Kjartanssone . is the static power, and .?>?1 is some constant. We assume that a link may be shutdown if not in use. In response to the arrival of client . at vertex .. a routing path (the virtual circuit) .. connecting a fixed source . to sink .. must be established. The objective is to minimize the aggregate作者: Mets552 時(shí)間: 2025-3-23 07:33 作者: 禁止,切斷 時(shí)間: 2025-3-23 12:52
Catherine Allan,Allan Curtis,Bruce Shindlerfficiency. However, the adoption of PCM will require technological solutions to surmount some deficiencies of PCM, such as writes requiring significantly more energy and time than reads. One way to limit the number of writes is by adopting a last-level cache replacement policy that is aware of the a作者: 人工制品 時(shí)間: 2025-3-23 13:51
Wild Ennerdale: A Cultural Landscaped by a server and then transmitted to a client device in a car using some mobile radio communication where bandwidth may be low. Compressed routes are represented by only a few via nodes which are the connection points when the route is decomposed into unique optimal segments. To reconstruct the rou作者: inhumane 時(shí)間: 2025-3-23 18:02
What Is Forest Landscape Restoration? than the distance in .. In this paper, we focus on an extension of the concept of spanners to ., defined as the smallest length of a collection of . pairwise (vertex or edge) disjoint paths. The notion of multipath spanners was introduced in [15,16] for edge (respectively, vertex) disjoint paths. T作者: 有效 時(shí)間: 2025-3-23 23:46 作者: ACME 時(shí)間: 2025-3-24 06:10
Karl Gartner,Michael Englisch,Ernst Leitgeb in large-scale text mining. We study ways to speed up the computation of the expectation and variance of the number of occurrences of a pattern with rigid gaps in a random string. Our contributions are twofold: first, we focus on patterns in which groups of characters from an alphabet Σ can occur a作者: 易改變 時(shí)間: 2025-3-24 09:00 作者: saturated-fat 時(shí)間: 2025-3-24 13:41
Sofía Simeto,Gustavo Balmelli,Carlos Pérezting from the algorithm design point of view was the observation that the asymptotic run-time drops when memory is used to avoid re-contacting neighbors within a small number of rounds..In this experimental investigation, we confirm that a small amount of memory indeed reduces the run-time of the pr作者: Pigeon 時(shí)間: 2025-3-24 16:04
https://doi.org/10.1007/978-3-030-35143-4., |.|?=?. and set of (hyper-)edges .. The .-partial vertex cover problem in hypergraphs is the problem of finding a minimum cardinality subset of vertices in which at least . hyperedges are incident. It is a generalisation of the fundamental (partial) vertex cover problem in graphs and the hitting 作者: extinct 時(shí)間: 2025-3-24 19:55 作者: exercise 時(shí)間: 2025-3-25 01:47
Jon D. Johnson,Michael L. Clinehe same key. We design hashing-based indexing schemes for dictionaries and multimaps that achieve worst-case optimal performance for lookups and updates, with minimal space overhead and . probability that the data structure will require a rehash operation. Our dictionary structure is designed for th作者: STRIA 時(shí)間: 2025-3-25 06:16 作者: 懶惰民族 時(shí)間: 2025-3-25 09:52 作者: 飛行員 時(shí)間: 2025-3-25 14:00 作者: Anal-Canal 時(shí)間: 2025-3-25 15:56
Design and Analysis of Algorithms978-3-642-34862-4Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: CLASH 時(shí)間: 2025-3-25 23:02 作者: 充足 時(shí)間: 2025-3-26 01:56 作者: 鈍劍 時(shí)間: 2025-3-26 05:22 作者: 小爭(zhēng)吵 時(shí)間: 2025-3-26 10:09 作者: 喚醒 時(shí)間: 2025-3-26 14:59 作者: macular-edema 時(shí)間: 2025-3-26 19:29
An Efficient Generator for Clustered Dynamic Random Networks,at are obtained by ., i.e., the deletion or insertion of an edge or vertex. The random process follows a dynamically changing ground-truth clustering that can be used to evaluate dynamic graph clustering algorithms. We give a theoretical justification of our model and show how the corresponding random process can be implemented efficiently.作者: mercenary 時(shí)間: 2025-3-27 00:21 作者: allergen 時(shí)間: 2025-3-27 03:14
Mart-Jan Schelhaas,Marian Lajos Mayr?∑?....We study two different problems: (.) achieving an optimal solution using the minimal possible transition cost, and (.) achieving the best possible schedule using a given limited budget for the transition. We present optimal algorithms for the first problem and for several classes of instances for the second problem.作者: milligram 時(shí)間: 2025-3-27 05:25
Wild Ennerdale: A Cultural Landscapempressing takes only a few milliseconds. And previous experiments suggest that a client can decompress each route segment virtually instantaneously. So, as the segments can be decompressed successively while driving, it is not likely that the driver experiences any delay except for the time needed by the mobile communication.作者: acrobat 時(shí)間: 2025-3-27 13:29 作者: 流出 時(shí)間: 2025-3-27 13:42
Reoptimization of the Minimum Total Flow-Time Scheduling Problem,?∑?....We study two different problems: (.) achieving an optimal solution using the minimal possible transition cost, and (.) achieving the best possible schedule using a given limited budget for the transition. We present optimal algorithms for the first problem and for several classes of instances for the second problem.作者: RENAL 時(shí)間: 2025-3-27 19:31
Efficient Route Compression for Hybrid Route Planning,mpressing takes only a few milliseconds. And previous experiments suggest that a client can decompress each route segment virtually instantaneously. So, as the segments can be decompressed successively while driving, it is not likely that the driver experiences any delay except for the time needed by the mobile communication.作者: omnibus 時(shí)間: 2025-3-27 22:45
Multipath Spanners via Fault-Tolerant Spanners,introduced in [6] for general graphs. More precisely, we show that at the cost of increasing the number of edges by a polynomial factor in . and ., it is possible to obtain an .-multipath spanner, thereby improving on the large stretch obtained in [15,16].作者: Constitution 時(shí)間: 2025-3-28 05:26
Conference proceedings 2012December 2012. .The 18 papers presented were carefully reviewed and selected from 44 submissions. The conference papers focus on the design, engineering, theoretical and experimental performance analysis of algorithms for problems arising in different areas of computation. Topics covered include: co作者: Decrepit 時(shí)間: 2025-3-28 06:46 作者: FIS 時(shí)間: 2025-3-28 12:46
Arnór Snorrason,Bjarki Kjartanssony be directed, then we show that no poly-log approximation is possible in polynomial time under standard complexity assumptions. These are the first results on multicast routing in speed scalable networks in the algorithmic literature.作者: 奇思怪想 時(shí)間: 2025-3-28 17:51
https://doi.org/10.1007/978-90-481-9834-4eveloping corresponding fixed-parameter tractability and (parameterized) hardness results. In particular, we demonstrate that upper-bounding the thresholds by a constant may significantly alleviate the search for efficiently solvable, but still meaningful special cases of ..作者: Fresco 時(shí)間: 2025-3-28 20:37 作者: Goblet-Cells 時(shí)間: 2025-3-29 02:31
Multicast Routing for Energy Minimization Using Speed Scaling,y be directed, then we show that no poly-log approximation is possible in polynomial time under standard complexity assumptions. These are the first results on multicast routing in speed scalable networks in the algorithmic literature.作者: scrutiny 時(shí)間: 2025-3-29 04:37
Constant Thresholds Can Make Target Set Selection Tractable,eveloping corresponding fixed-parameter tractability and (parameterized) hardness results. In particular, we demonstrate that upper-bounding the thresholds by a constant may significantly alleviate the search for efficiently solvable, but still meaningful special cases of ..作者: FOIL 時(shí)間: 2025-3-29 10:59 作者: 責(zé)問 時(shí)間: 2025-3-29 14:37
0302-9743 iterranean Conference on Algorithms, MedAlg?2012, held in Kibbutz Ein Gedi, Israel, in December 2012. .The 18 papers presented were carefully reviewed and selected from 44 submissions. The conference papers focus on the design, engineering, theoretical and experimental performance analysis of algori作者: Rankle 時(shí)間: 2025-3-29 16:56
Arnór Snorrason,Bjarki Kjartanssonxtend the expansion analysis approach to fast algorithms for rectangular matrix multiplication, obtaining a new class of communication cost lower bounds. These apply, for example to the algorithms of Bini et?al.?(1979) and the algorithms of Hopcroft and Kerr (1971). Some of our bounds are proved to be optimal.作者: 增強(qiáng) 時(shí)間: 2025-3-29 21:21
Seedling Quality of Southern Pines push-out (when the policy is permitted to drop already admitted packets) and non-push-out cases. In particular, we provide analytical guarantees for the throughput performance of our algorithms. We further conduct a comprehensive simulation study which experimentally validates the predicted theoretical behaviour.作者: faucet 時(shí)間: 2025-3-30 02:24 作者: 表狀態(tài) 時(shí)間: 2025-3-30 08:06
Catherine Allan,Allan Curtis,Bruce ShindlerA is comparable or better than .-Chance, even for the best choice of ., and uses at least 11% less energy than LRU. For read dominated benchmarks, we find that AL and VA are comparable to LRU, while .-Chance (using the . that was best for benchmarks that were a mixture of reads and writes) uses at l作者: 東西 時(shí)間: 2025-3-30 10:26
Karl Gartner,Michael Englisch,Ernst Leitgebm Σ occurs at each position. We study the case in which . is given offline, and an arbitrary motif . of . is queried online. We relate computational complexity to the structure of . and ., identifying sets of motifs that are amenable to .(|.|log|.|) time online computation after .(|.|.) preprocessin作者: dendrites 時(shí)間: 2025-3-30 12:36 作者: Overthrow 時(shí)間: 2025-3-30 20:21 作者: 曲解 時(shí)間: 2025-3-30 22:25 作者: attenuate 時(shí)間: 2025-3-31 04:26
https://doi.org/10.1007/978-94-011-3800-0rvation techniques (namely speed scaling and sleep states) and profit-oriented scheduling models. We show that . schedulers (whose rejection decisions are not based on former decisions) have - in contrast to the model without sleep states - an unbounded competitive ratio w.r.t. the processor paramet作者: anachronistic 時(shí)間: 2025-3-31 07:25 作者: notification 時(shí)間: 2025-3-31 09:33 作者: 噴油井 時(shí)間: 2025-3-31 16:26
Faster Variance Computation for Patterns with Gaps,m Σ occurs at each position. We study the case in which . is given offline, and an arbitrary motif . of . is queried online. We relate computational complexity to the structure of . and ., identifying sets of motifs that are amenable to .(|.|log|.|) time online computation after .(|.|.) preprocessin
