標(biāo)題: Titlebook: Algorithms and Computation; 13th International S Prosenjit Bose,Pat Morin Conference proceedings 2002 Springer-Verlag Berlin Heidelberg 200 [打印本頁] 作者: BULB 時間: 2025-3-21 16:07
書目名稱Algorithms and Computation影響因子(影響力)
書目名稱Algorithms and Computation影響因子(影響力)學(xué)科排名
書目名稱Algorithms and Computation網(wǎng)絡(luò)公開度
書目名稱Algorithms and Computation網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Algorithms and Computation被引頻次
書目名稱Algorithms and Computation被引頻次學(xué)科排名
書目名稱Algorithms and Computation年度引用
書目名稱Algorithms and Computation年度引用學(xué)科排名
書目名稱Algorithms and Computation讀者反饋
書目名稱Algorithms and Computation讀者反饋學(xué)科排名
作者: Excise 時間: 2025-3-22 00:10 作者: incontinence 時間: 2025-3-22 01:42 作者: 為寵愛 時間: 2025-3-22 05:34 作者: LIMIT 時間: 2025-3-22 11:09
Michael Wendler,Ernst-Ulrich Huster the time to access item . is . (1 + log W/..), where . = Σ.=1...; the data structure is dynamic. We present deterministic and randomized variations, which are nearly identical; the deterministic one simply ensures the balance condition that the randomized one achieves probabilistically. We use the same method to analyze both.作者: 草本植物 時間: 2025-3-22 13:55 作者: Limited 時間: 2025-3-22 19:24 作者: cluster 時間: 2025-3-22 21:39 作者: miniature 時間: 2025-3-23 05:18 作者: SCORE 時間: 2025-3-23 08:37
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/153124.jpg作者: 明智的人 時間: 2025-3-23 13:42 作者: etidronate 時間: 2025-3-23 16:30
Cutting a Country for Smallest Square Fit rotation — they have the minimum possible bounding square. If we cut with a single horizontal or vertical segment, then we can compute an optimal solution for a convex polygon with . vertices in .) time. For simple polygons we give an .(..g.(.) log .) time algorithm.作者: SEEK 時間: 2025-3-23 18:16 作者: 奇怪 時間: 2025-3-23 22:49
Improved Approximation Algorithms for Max-2SAT with Cardinality Constraint We present an approximation algorithm with polynomial running time for Max-2SAT-CC. This algorithm achieves, for any ε > 0, approximation ratio .. Furthermore, we present a greedy algorithm with running time . log . and approximation ratio 1/2. The latter algorithm even works for clauses of arbitrary length.作者: 蓋他為秘密 時間: 2025-3-24 03:34
Michael Wendler,Ernst-Ulrich Huster the time to access item . is . (1 + log W/..), where . = Σ.=1...; the data structure is dynamic. We present deterministic and randomized variations, which are nearly identical; the deterministic one simply ensures the balance condition that the randomized one achieves probabilistically. We use the 作者: thrombus 時間: 2025-3-24 07:15 作者: 帶傷害 時間: 2025-3-24 11:12 作者: 藕床生厭倦 時間: 2025-3-24 15:39 作者: 不如屎殼郎 時間: 2025-3-24 22:39
Der K?rper als soziales Ged?chtnisdezvous occurs if there are adjacent nodes . and . such that . chooses . and . chooses .. Métivier .. (2000) asked whether it is true that the probability for a rendezvous to occur in . is at least as large as the probability of a rendezvous if the same experiment is carried out in the complete grap作者: 虛構(gòu)的東西 時間: 2025-3-25 01:45 作者: Ambulatory 時間: 2025-3-25 05:44 作者: 聰明 時間: 2025-3-25 11:35
Scham, K?rper, Geheimnis und Ged?chtnistes between nondecreasing and nonincreasing modes a fixed number of times) operating on bounded languages (i.e., subsets of ... ...... for some nonnull words w.,..., ..) is decidable, settling an open problem in [.,.]. The proof is a rather involved reduction to the solution of a special class of Di作者: RENIN 時間: 2025-3-25 14:45 作者: 原告 時間: 2025-3-25 16:50 作者: 萬靈丹 時間: 2025-3-25 23:41
Minas Dimitriou,Susanne Ring-Dimitrioue graphs with each vertex and edge a number in [0,1] associated. These graphs model networks in which sites and links can fail, with a given probability, independently of whether other sites or links fail or not. The number in [0,1] associated to each element is the probability that this element doe作者: 爵士樂 時間: 2025-3-26 03:37 作者: 駕駛 時間: 2025-3-26 07:29 作者: gait-cycle 時間: 2025-3-26 09:19
Der Künstler im internationalen Steuerrecht that the number of bins that receive items of total size at least 1 is maximized. This is a dual problem to the classical bin packing problem. In this paper we present the first asymptotic fully polynomial-time approximation scheme (AFPTAS) for the bin covering problem.作者: goodwill 時間: 2025-3-26 16:08 作者: 四溢 時間: 2025-3-26 20:16 作者: Incise 時間: 2025-3-27 01:01 作者: Exclude 時間: 2025-3-27 05:10
978-3-540-00142-3Springer-Verlag Berlin Heidelberg 2002作者: 政府 時間: 2025-3-27 05:35
Scham, K?rper, Geheimnis und Ged?chtnisThe paper presents several results that can be helpful for deciding whether the clique-width of graphs in a certain class is bounded or not, and applies these results to a number of particular graph classes.作者: 值得 時間: 2025-3-27 13:27 作者: Diskectomy 時間: 2025-3-27 15:11
https://doi.org/10.1007/978-3-642-33874-8In this paper, we consider the two-stage assembly scheduling problem with two machines at the first stage. The problem has been known to be strongly NP-hard and a 1.5-approximation algorithm has been obtained. We give a 1.37781-approximation algorithm that runs in .(n. log .) time for an instance with . jobs.作者: 平庸的人或物 時間: 2025-3-27 20:42
On the Clique-Width of Graphs in Hereditary ClassesThe paper presents several results that can be helpful for deciding whether the clique-width of graphs in a certain class is bounded or not, and applies these results to a number of particular graph classes.作者: 存心 時間: 2025-3-28 00:57 作者: etiquette 時間: 2025-3-28 03:42
A Better Approximation for the Two-Stage Assembly Scheduling Problem with Two Machines at the First In this paper, we consider the two-stage assembly scheduling problem with two machines at the first stage. The problem has been known to be strongly NP-hard and a 1.5-approximation algorithm has been obtained. We give a 1.37781-approximation algorithm that runs in .(n. log .) time for an instance with . jobs.作者: 減震 時間: 2025-3-28 08:57
Scham, K?rper, Geheimnis und Ged?chtnise implementation, (b) efficiency — experimental performance compares favorably with Delaunay-based algorithms, (c) robustness — curves with multiple components and sharp corners are reconstructed satisfactorily, and (d) potential extension to surface reconstruction.作者: 膠水 時間: 2025-3-28 14:04
Der K?rper im biographischen Kontextng quantum multi-prover interactive proof systems is equal to NEXP. Related to these, it is shown that, if a prover does not have his private qubits, the class of languages having quantum single-prover interactive proof systems is also equal to NEXP.作者: Basal-Ganglia 時間: 2025-3-28 17:21
https://doi.org/10.1007/978-3-322-80424-2hich is a much weaker version of the .-conjecture. Since the .-conjecture differs from the trivial lower bound only at the coefficient, this result provides an interesting example where increasing the coefficient in a trivial lower bound of straight-line complexity is difficult and important.作者: 迅速飛過 時間: 2025-3-28 18:53 作者: mucous-membrane 時間: 2025-3-29 02:22
https://doi.org/10.1007/978-3-642-33874-8orking set property by demonstrating that it is impossible to create a queueish binary search tree, but that many search data structures can be made almost queueish with a O(log log .) amortized extra cost per operation.作者: bonnet 時間: 2025-3-29 07:02 作者: irreducible 時間: 2025-3-29 07:30 作者: glisten 時間: 2025-3-29 12:24 作者: synovium 時間: 2025-3-29 18:43
Quantum Multi-prover Interactive Proof Systems with Limited Prior Entanglementng quantum multi-prover interactive proof systems is equal to NEXP. Related to these, it is shown that, if a prover does not have his private qubits, the class of languages having quantum single-prover interactive proof systems is also equal to NEXP.作者: 修改 時間: 2025-3-29 21:55 作者: Encoding 時間: 2025-3-30 03:52
Michael Wendler,Ernst-Ulrich Hustery pattern efficiently while keeping the size of the data structures moderate. The size is comparable with the text size, which is an improvement from existing methods using .(. log .) bit space for a text collection of length ..作者: adulterant 時間: 2025-3-30 07:18 作者: 四目在模仿 時間: 2025-3-30 09:32 作者: 宣誓書 時間: 2025-3-30 15:23 作者: 我邪惡 時間: 2025-3-30 19:59
Ernst-Ulrich Huster,Johannes D. Schüttesequence where the key values are assigned arbitrarily to unordered data as fast as any offline binary search tree algorithm, within a multiplicative constant. Asymptotically tight upper and lower bounds are presented for key-independent optimality. Splay trees are shown to be key-independently optimal.作者: Repatriate 時間: 2025-3-31 00:19 作者: 嚙齒動物 時間: 2025-3-31 04:01 作者: Extricate 時間: 2025-3-31 08:00
Scham, K?rper, Geheimnis und Ged?chtnisl words w.,..., ..) is decidable, settling an open problem in [.,.]. The proof is a rather involved reduction to the solution of a special class of Diophantine systems of degree 2 via a class of programs called two-phase programs. The result has applications to verification of infinite state systems.作者: 細(xì)查 時間: 2025-3-31 12:44 作者: 確定的事 時間: 2025-3-31 15:49
On the Comparison-Addition Complexity of All-Pairs Shortest Pathsn approaches based on Dijkstra’s algorithm, and for graphs with .(.) edges our algorithm is within a tiny .(log .) factor of optimal. The algorithm can be implemented to run in polynomial time (though it is not a pleasing polynomial). We leave open the problem of providing an efficient implementation.作者: overrule 時間: 2025-3-31 19:13
The Probability of a Rendezvous Is Minimal in Complete Graphslity for a rendezvous to occur in . is at least as large as the probability of a rendezvous if the same experiment is carried out in the complete graph on the same number of nodes. In this paper we show that this is the case.作者: agitate 時間: 2025-3-31 21:45 作者: 瘋狂 時間: 2025-4-1 02:25
Biased Skip Lists the time to access item . is . (1 + log W/..), where . = Σ.=1...; the data structure is dynamic. We present deterministic and randomized variations, which are nearly identical; the deterministic one simply ensures the balance condition that the randomized one achieves probabilistically. We use the 作者: saturated-fat 時間: 2025-4-1 06:03 作者: objection 時間: 2025-4-1 13:22 作者: misanthrope 時間: 2025-4-1 17:33
On the Comparison-Addition Complexity of All-Pairs Shortest Pathse number of edges and vertices, resp., and . = .(.) is Tarjan’s inverse-Ackermann function. Our algorithm eliminates the sorting bottleneck inherent in approaches based on Dijkstra’s algorithm, and for graphs with .(.) edges our algorithm is within a tiny .(log .) factor of optimal. The algorithm ca作者: Seminar 時間: 2025-4-1 22:32 作者: Deference 時間: 2025-4-1 22:38
Non-Delaunay-Based Curve Reconstructioned on bounding curvature to determine monotone pieces of the curve. Theoretical guarantees are established. The implemented algorithm, based heuristically on the theory, proceeds by iteratively partitioning the sample points using an octree data structure. The strengths of the approach are (a) simpl作者: Incise 時間: 2025-4-2 06:26
Cutting a Country for Smallest Square Fit rotation — they have the minimum possible bounding square. If we cut with a single horizontal or vertical segment, then we can compute an optimal solution for a convex polygon with . vertices in .) time. For simple polygons we give an .(..g.(.) log .) time algorithm.
