標(biāo)題: Titlebook: Algorithms - ESA 2001; 9th Annual European Friedhelm Meyer Heide Conference proceedings 2001 Springer-Verlag Berlin Heidelberg 2001 Algori [打印本頁] 作者: Conformist 時間: 2025-3-21 17:16
書目名稱Algorithms - ESA 2001影響因子(影響力)
書目名稱Algorithms - ESA 2001影響因子(影響力)學(xué)科排名
書目名稱Algorithms - ESA 2001網(wǎng)絡(luò)公開度
書目名稱Algorithms - ESA 2001網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Algorithms - ESA 2001被引頻次
書目名稱Algorithms - ESA 2001被引頻次學(xué)科排名
書目名稱Algorithms - ESA 2001年度引用
書目名稱Algorithms - ESA 2001年度引用學(xué)科排名
書目名稱Algorithms - ESA 2001讀者反饋
書目名稱Algorithms - ESA 2001讀者反饋學(xué)科排名
作者: 引起痛苦 時間: 2025-3-22 00:12
M. Hülse,W. L. Neuhuber,H. D. Wolffessors. For the offline case we show that an algorithm introduced in [.] is .. In the online case we give an algorithm which is within factor of 2 from the optimal in the set of online deterministic algorithms, for . access graph, and .≥1. Improved ratios are obtained for several important classes o作者: 招惹 時間: 2025-3-22 03:17
Die zentrale Rolle der Quantentheorie,itment. In this paper, we introduce several versions of the problem from a computational point of view. We show that the general SNPs Haplotyping Problem is NP-hard for mate-pairs assembly data, and design polynomial time algorithms for fragment assembly data. We give a network-flow based polynomial作者: achlorhydria 時間: 2025-3-22 06:32
Thomas G?rnitz,Brigitte G?rnitzesults can also be applied to the scheduling problem where the rejection of jobs is allowed. Each job has a penalty associated to it, and one is allowed to schedule any subset of jobs. In this case the goal is the minimization of the makespan of the scheduled jobs and the total penalty of the reject作者: peptic-ulcer 時間: 2025-3-22 12:37 作者: 整潔 時間: 2025-3-22 13:25
Strongly Competitive Algorithms for Caching with Pipelined Prefetchingessors. For the offline case we show that an algorithm introduced in [.] is .. In the online case we give an algorithm which is within factor of 2 from the optimal in the set of online deterministic algorithms, for . access graph, and .≥1. Improved ratios are obtained for several important classes o作者: inventory 時間: 2025-3-22 19:25 作者: Crohns-disease 時間: 2025-3-22 21:28
A FPTAS for Approximating the Unrelated Parallel Machines Scheduling Problem with Costsesults can also be applied to the scheduling problem where the rejection of jobs is allowed. Each job has a penalty associated to it, and one is allowed to schedule any subset of jobs. In this case the goal is the minimization of the makespan of the scheduled jobs and the total penalty of the reject作者: forbid 時間: 2025-3-23 03:55 作者: 表示問 時間: 2025-3-23 06:14
https://doi.org/10.1007/978-3-8349-4373-6The problem of computing tandem repetitions with . possible mismatches is studied. Two main definitions are considered, and for both of them an .(. log .) algorithm is proposed (. the size of the output). This improves, in particular, the bound obtained in [.].作者: constellation 時間: 2025-3-23 12:39
Exact and Approximate Distances in Graphs — A SurveyW survey recent and not so recent results related to the computation of exact and approximate distances, and corresponding shortest, or almost shortest, paths in graphs. We consider many different settings and models and try to identify some remaining open problems.作者: 類似思想 時間: 2025-3-23 15:21
Finding Approximate Repetitions under Hamming DistanceThe problem of computing tandem repetitions with . possible mismatches is studied. Two main definitions are considered, and for both of them an .(. log .) algorithm is proposed (. the size of the output). This improves, in particular, the bound obtained in [.].作者: Pruritus 時間: 2025-3-23 19:37
Cuckoo Hashing hashing scheme of Dietzfelbinger et al. The space usage is similar to that of binary search trees, i.e., three words per key on average. The practicality of the scheme is backed by extensive experiments and comparisons with known methods, showing it to be quite competitive also in the average case.作者: Rebate 時間: 2025-3-23 22:58
A Simple Shortest Path Algorithm with Linear Average Time-case running time of the algorithm is .(. + . log .), where . and . are the number of vertices and arcs of the input graph, respectively, and . is the ratio of the largest and the smallest nonzero arc length.作者: 集中營 時間: 2025-3-24 06:18 作者: 棲息地 時間: 2025-3-24 09:58 作者: Immunotherapy 時間: 2025-3-24 14:12 作者: 確定的事 時間: 2025-3-24 15:59
Der koreanische Anteil am Werden Japansing problems..: Caching is a very well-studied problem. Consider a two-level memory system consisting of a small fast memory, that can store up to . bits, and a large slow memory, that can store potentially infinitely many bits. The goal is to serve a sequence of memory accesses with low total cost.作者: PURG 時間: 2025-3-24 22:02 作者: FOLD 時間: 2025-3-25 02:41 作者: employor 時間: 2025-3-25 06:26
Das patientorientierte Denken als Leitliniecolored items into bins, such that the maximum number of different colors per bin is minimized. Each bin has size . ∈ ?. The packing process is subject to the constraint that at any moment in time at most . ∈ ? bins are partially filled. Moreover, bins may only be closed if they are filled completel作者: endoscopy 時間: 2025-3-25 07:44 作者: 表狀態(tài) 時間: 2025-3-25 13:50 作者: Postulate 時間: 2025-3-25 17:43 作者: Solace 時間: 2025-3-25 21:52 作者: mortuary 時間: 2025-3-26 02:12
Das Menschenbild des Hausarztest to the objective function and to the constraint structure of the problem. Relying on that specific structure, effective variable fixing algorithms (VFAs) are only suited for the problems they have been designed for. Frequently, new combinatorial optimization problems evolve as a combination of sim作者: PSA-velocity 時間: 2025-3-26 07:49 作者: engrossed 時間: 2025-3-26 09:31
,Kreativit?t im Entrepreneurshipkontext,tion . of . such that for every pair of elements (.) in . there exists a test in . that contains exactly one of . and .. It is well known that the greedy algorithm gives a 1 + 2lnn approximation for the test collection problem where ., the size of the ground set. In this paper, we show that this alg作者: 獨(dú)輪車 時間: 2025-3-26 13:43 作者: facetious 時間: 2025-3-26 20:52
Thomas G?rnitz,Brigitte G?rnitzssor jobs and . machines where each job is to be processed without preemptions. Executing job . on machine . requires time .. ≥ 0 and incurs cost ... Our objective is to find a schedule obtaining a tradeoff between the makespan and the total cost. We focus on the case where the number of machines is作者: 細(xì)菌等 時間: 2025-3-26 23:31 作者: exclusice 時間: 2025-3-27 02:28 作者: 準(zhǔn)則 時間: 2025-3-27 06:41 作者: 吹牛大王 時間: 2025-3-27 11:07
Algorithms - ESA 2001978-3-540-44676-7Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: conference 時間: 2025-3-27 13:42
https://doi.org/10.1007/978-3-642-71548-8 hashing scheme of Dietzfelbinger et al. The space usage is similar to that of binary search trees, i.e., three words per key on average. The practicality of the scheme is backed by extensive experiments and comparisons with known methods, showing it to be quite competitive also in the average case.作者: 赦免 時間: 2025-3-27 18:09 作者: Functional 時間: 2025-3-27 23:15 作者: cacophony 時間: 2025-3-28 02:14
978-3-540-42493-2Springer-Verlag Berlin Heidelberg 2001作者: conceal 時間: 2025-3-28 09:31
External Memory Data Structuresmically changing datasets often need to be stored in data structures on external storage devices, and in such cases the Input/Output (or I/O) communication between internal and external memory can become a major performance bottleneck. In this paper we survey recent advances in the development of wo作者: ungainly 時間: 2025-3-28 13:34
Some Algorithmic Problems in Large Networksing problems..: Caching is a very well-studied problem. Consider a two-level memory system consisting of a small fast memory, that can store up to . bits, and a large slow memory, that can store potentially infinitely many bits. The goal is to serve a sequence of memory accesses with low total cost.作者: 面包屑 時間: 2025-3-28 16:49
Strongly Competitive Algorithms for Caching with Pipelined Prefetching this model we consider the following problem. Suppose that a program makes a sequence of . accesses to data blocks. The cache can hold . blocks, where . < .. An access to a block in the cache incurs one time unit, and fetching a missing block incurs . time units. A fetch of a new block can be initi作者: 刺穿 時間: 2025-3-28 19:12 作者: arrhythmic 時間: 2025-3-29 00:10 作者: 憤慨點(diǎn)吧 時間: 2025-3-29 04:34
A General Decomposition Theorem for the ,-Server Problem. + 1 points, the theorem given here allows an arbitrary number of points in the underlying metric space. This theorem implies .(polylog(.))-competitive randomized algorithms for certain metric spaces consisting of a polylogarithmic number of widely separated sub-spaces, and takes a first step towar作者: genuine 時間: 2025-3-29 08:16 作者: 暫停,間歇 時間: 2025-3-29 11:39 作者: intercede 時間: 2025-3-29 16:16 作者: 有常識 時間: 2025-3-29 22:20 作者: Impugn 時間: 2025-3-30 03:13 作者: 共棲 時間: 2025-3-30 07:40
On the Approximability of the Minimum Test Collection Problemtion . of . such that for every pair of elements (.) in . there exists a test in . that contains exactly one of . and .. It is well known that the greedy algorithm gives a 1 + 2lnn approximation for the test collection problem where ., the size of the ground set. In this paper, we show that this alg作者: restrain 時間: 2025-3-30 09:48
SNPs Problems, Complexity, and Algorithmsications including medical diagnostic and drug design. They also provide the highest-resolution genomic fingerprint for tracking disease genes. This paper is devoted to algorithmic problems related to computational SNPs validation based on genome assembly of diploid organisms. In diploid genomes, th作者: abject 時間: 2025-3-30 15:13
A FPTAS for Approximating the Unrelated Parallel Machines Scheduling Problem with Costsssor jobs and . machines where each job is to be processed without preemptions. Executing job . on machine . requires time .. ≥ 0 and incurs cost ... Our objective is to find a schedule obtaining a tradeoff between the makespan and the total cost. We focus on the case where the number of machines is作者: 輕率看法 時間: 2025-3-30 17:06
Grouping Techniques for Scheduling Problems: Simpler and Fasterte the technique on two different scheduling problems: scheduling on unrelated parallel machines with costs and the job shop scheduling problem. The time complexity of the resulting approximation schemes is always linear in the number . of jobs, and the multiplicative constant hidden in the .(.) run作者: palpitate 時間: 2025-3-30 22:33
A 2-Approximation Algorithm for the Multi-vehicle Scheduling Problem on a Path with Release and Hand. = {{.., .. | . = 1, 2,..., .-1} is its set of edges. There are . identical vehicles (1 ≤ . ≤ .). The travel times .(.., ..) (= .(..,..)) are associated with edges {.., ... Each job . which is located at each vertex .. ∈ . has release time .. and handling time ... Any job must be served by exactly 作者: 擔(dān)心 時間: 2025-3-31 01:26 作者: 藥物 時間: 2025-3-31 09:02
0302-9743 , held in Aarhus, Denmark, in August 2001..The 41 revised full papers presented together with three invited contributions were carefully reviewed and selected from 102 submissions. The papers are organized in topical sections on caching and prefetching, online algorithms, data structures, optimizati作者: CLOT 時間: 2025-3-31 11:14 作者: 材料等 時間: 2025-3-31 13:23 作者: GREEN 時間: 2025-3-31 21:26
External Memory Data Structuresation between internal and external memory can become a major performance bottleneck. In this paper we survey recent advances in the development of worst-case I/O-efficient external memory data structures.作者: 散步 時間: 2025-4-1 01:41 作者: micturition 時間: 2025-4-1 04:51
A General Decomposition Theorem for the ,-Server Problemds a general .(polylog(.))-competitive algorithm. The only other cases for which polylogarithmic competitive randomized algorithms are known are the uniform metric space, and the weighted cache metric space with two weights.作者: 脆弱帶來 時間: 2025-4-1 06:10
Simple Minimal Perfect Hashing in Less Spaceion for . whose representation, besides a constant number of words, is a table of at most (2 + ε). integers in the range {0,..., .-1}, for arbitrary fixed ε > 0. Extending his method, we show how to replace the factor of 2 + . by 1 + ..作者: Occlusion 時間: 2025-4-1 11:39
Coupling Variable Fixing Algorithms for the Automatic Recording Problempler structured problems. For such combinations, we show how VFAs for linear optimization problems can be coupled via Lagrangian relaxation. The method is applied on a multimedia problem incorporating a knapsack and a maximum weighted stable set problem.作者: 和諧 時間: 2025-4-1 15:58 作者: Ataxia 時間: 2025-4-1 20:23
