派博傳思國際中心

標(biāo)題: Titlebook: Algorithms and Data Structures; 6th International Wo Frank Dehne,J?rg-Rüdiger Sack,Roberto Tamassia Conference proceedings 1999 Springer-Ve [打印本頁]

作者: Abeyance 時(shí)間: 2025-3-21 16:55
書目名稱Algorithms and Data Structures影響因子(影響力)

書目名稱Algorithms and Data Structures影響因子(影響力)學(xué)科排名

書目名稱Algorithms and Data Structures網(wǎng)絡(luò)公開度

書目名稱Algorithms and Data Structures網(wǎng)絡(luò)公開度學(xué)科排名

書目名稱Algorithms and Data Structures被引頻次

書目名稱Algorithms and Data Structures被引頻次學(xué)科排名

書目名稱Algorithms and Data Structures年度引用

書目名稱Algorithms and Data Structures年度引用學(xué)科排名

書目名稱Algorithms and Data Structures讀者反饋

書目名稱Algorithms and Data Structures讀者反饋學(xué)科排名

作者: 克制 時(shí)間: 2025-3-21 21:34

作者: 按時(shí)間順序 時(shí)間: 2025-3-22 04:23
Robot Map Verification of a Graph World, .(|..| × |..|) edge traversals (.) with the help of a single vertex marker which can be dropped and picked up at vertices of the graph world [.],[.]. In this paper, we show a strategy that verifies a map in O(|..|) edge traversals only, using a single edge marker, when . is a plane embedded graph,

作者: 實(shí)施生效 時(shí)間: 2025-3-22 05:36

作者: enlist 時(shí)間: 2025-3-22 09:30

作者: 人類學(xué)家 時(shí)間: 2025-3-22 13:12

作者: 幻影 時(shí)間: 2025-3-22 19:45

作者: notion 時(shí)間: 2025-3-22 22:32
Aufbereitung von Kies und Sand, we search for a “.-oriented” polygonal chain . consisting of the minimum number of line segments that has distance at most . to . in the Fréechet metric. A polygonal chain is .-oriented if the line segments are parallel to orientations in .. We restrict our attention to the version of the problem w

作者: Aqueous-Humor 時(shí)間: 2025-3-23 02:36
https://doi.org/10.1007/978-3-540-49695-3o an odd number of edges of . iff . ∈ .. We describe the applications of the .-join problem in sparse graphs to the phase assignment problem in VLSI mask layout and to conformal refinement of finite element meshes. We suggest a practical algorithm for the Tjoin problem. In sparse graphs, this algori

作者: ATOPY 時(shí)間: 2025-3-23 08:46
https://doi.org/10.1007/978-3-540-49695-3.], of fixed-size elements, as elements are added to or removed from one or both ends. Our structures also support access to the element in position .. All operations are performed in constant time. The extra space (i.e., the space used past storing the n current elements) is .(√.) at any point in t

作者: BRIBE 時(shí)間: 2025-3-23 13:32
Aufbereitung von Kies und Sand,kets in two-level hashing schemes. Two memory probes suffice for evaluation of the function. This improves the probe performance of previous minimal perfect hashing schemes, and is shown to be optimal.

作者: 異端邪說2 時(shí)間: 2025-3-23 15:35

作者: 改變立場 時(shí)間: 2025-3-23 20:19
https://doi.org/10.1007/978-3-540-49695-3ntly, the current authors defined in companion papers a distance function based on the same offsetting function for convex polygons. In particular, we explored the nearest- and furthest- neighbor Voronoi diagrams of this function and presented algorithms for constructing them. In this paper we give

作者: 焦慮 時(shí)間: 2025-3-24 01:18

作者: 有法律效應(yīng) 時(shí)間: 2025-3-24 06:00

作者: defile 時(shí)間: 2025-3-24 09:57
Im Garten, auf Wiese, Terrasse oder Balkon,The task is to find out whether this map, for the given robot position and orientation in the map, is correct for the world G. We consider the world model with a graph . = (..,..) in which, for each vertex, edges incident to the vertex are ordered cyclically around that vertex. This holds similarly

作者: malign 時(shí)間: 2025-3-24 11:28
,Am Teich, Tümpel, Weiher oder See,al point and it is equipped with on-board cameras through which it can get the visibility map of its immediate surroundings. It is known that if . is a . with respect to two points . and . then starting at . the robot can find t with a constant competitive ratio. In this paper we consider the case w

作者: MELD 時(shí)間: 2025-3-24 17:43
Unternehmerisches Personalmanagementtion of the subset of processors assigned to the task. We propose a fully polynomial approximation scheme that for any fixed . > 0 finds a preemptive schedule of length at most (1 + .) times the optimum in .(.) time.We also discuss the non-preemptive variant of the problem, and present a polynomial

作者: 禁止,切斷 時(shí)間: 2025-3-24 22:48

作者: 發(fā)出眩目光芒 時(shí)間: 2025-3-25 00:33

作者: beta-carotene 時(shí)間: 2025-3-25 06:33

作者: 地牢 時(shí)間: 2025-3-25 10:04

作者: 作嘔 時(shí)間: 2025-3-25 13:34
,Ergebnisse und abschlie?ende Bemerkungen,sed on binary trees, we turn our attention to trees of higher degree. We consider both cardinal trees (rooted trees where each node has . positions each of which may have a reference to a child) and ordinal trees (the children of each node are simply ordered). Our representations use a number of bit

作者: concise 時(shí)間: 2025-3-25 17:21
Zusammenfassung der wichtigsten Ergebnisse, proportional to the length of the query and the number of occurrences. In the . a set of patterns is preprocessed and subsequent queries of the form: “Find all occurrences of dictionary patterns in text .” are answered in time proportional to the length of the text and the number of occurrences..In

作者: 生氣地 時(shí)間: 2025-3-25 21:32
Optimization over k-set Polytopes and Efficient k-set Enumeration,e the notion of a .-set polytope and the optimization of a linear function over a .-set polytope. In addition, we obtain several results related to the k-set polytopes. Among others, we show that the 1-skeleton of a .-set polytope restricted to vertices corresponding to the affine .-sets is not always connected.

作者: 有害 時(shí)間: 2025-3-26 01:43
Hash and Displace: Efficient Evaluation of Minimal Perfect Hash Functions,kets in two-level hashing schemes. Two memory probes suffice for evaluation of the function. This improves the probe performance of previous minimal perfect hashing schemes, and is shown to be optimal.

作者: 羽飾 時(shí)間: 2025-3-26 07:40
Performance Guarantees for the TSP with a Parameterized Triangle Inequality,me parameter . ≥ 1, the distances satisfy the inequality dist(.) ≤τ. (dist(.)+ dist(.)) for every triple of vertices ., and .. We obtain a 4τ approximation and also show that for some . > 0 it is NP-hard to obtain a (1 + .) approximation. Our upper bound improves upon the earlier known ratio of (3../2/+./2)[.] for all values of . > 7/3.

作者: 和藹 時(shí)間: 2025-3-26 12:01
Frank Dehne,J?rg-Rüdiger Sack,Roberto TamassiaIncludes supplementary material:

作者: 逗留 時(shí)間: 2025-3-26 14:43

作者: ostracize 時(shí)間: 2025-3-26 17:52

作者: Injunction 時(shí)間: 2025-3-26 23:37

作者: SMART 時(shí)間: 2025-3-27 04:17
Aufbereitung von Kies und Sand,kets in two-level hashing schemes. Two memory probes suffice for evaluation of the function. This improves the probe performance of previous minimal perfect hashing schemes, and is shown to be optimal.

作者: FEAT 時(shí)間: 2025-3-27 06:41
,?All-Deutschland in Frankreich hinein!“,me parameter . ≥ 1, the distances satisfy the inequality dist(.) ≤τ. (dist(.)+ dist(.)) for every triple of vertices ., and .. We obtain a 4τ approximation and also show that for some . > 0 it is NP-hard to obtain a (1 + .) approximation. Our upper bound improves upon the earlier known ratio of (3../2/+./2)[.] for all values of . > 7/3.

作者: contrast-medium 時(shí)間: 2025-3-27 12:33

作者: 捕鯨魚叉 時(shí)間: 2025-3-27 16:58

作者: 輕快來事 時(shí)間: 2025-3-27 19:05
General Multiprocessor Task Scheduling: Approximate Solutions in Linear Time,approximation scheme that computes an approximate solution of any fixed accuracy in linear time. In terms of the running time, this linear complexity bound gives a substantial improvement of the best previously known polynomial bound [.].

作者: 公司 時(shí)間: 2025-3-28 01:36
On an Optimal Split Tree Problem,atio. We construct an example for which this algorithm achieves .. approximation ratio. We show that if all weights are equal and the optimal split tree is of depth O(log n), then the greedy algorithm guarantees .. approximation ratio. We also extend our approximation algorithm to the construction of a search tree for partially ordered sets.

作者: 拒絕 時(shí)間: 2025-3-28 03:15
Aufbereitung von Kies und Sand,lem constructively by using dynamic programming together with a nice data structure. For usual cases of . our algorithm solves the problem in time .(..log(.)) where . is the minimum number of line segments of . and uses .(..) space.

作者: BRAVE 時(shí)間: 2025-3-28 08:43
https://doi.org/10.1007/978-3-540-49695-3to have size 2. ? . for a specified constant ., and hence the scheme works effectively with the buddy system. The data structures can be used to solve a variety of problems with optimal bounds on time and extra storage. These include stacks, queues, randomized queues, priority queues, and deques.

作者: forager 時(shí)間: 2025-3-28 13:13
,K?nig Wilhelm I. und seine Paladine, it had had the amount of resources αn. The accommodating functions for two specific on-line problems are investigated: a variant of bin-packing in which the goal is to maximize the number of objects put in n bins and the seat reservation problem.

作者: 有雜色 時(shí)間: 2025-3-28 17:35

作者: 單調(diào)性 時(shí)間: 2025-3-28 22:05

作者: 美學(xué) 時(shí)間: 2025-3-29 00:23
Resizable Arrays in Optimal Time and Space,to have size 2. ? . for a specified constant ., and hence the scheme works effectively with the buddy system. The data structures can be used to solve a variety of problems with optimal bounds on time and extra storage. These include stacks, queues, randomized queues, priority queues, and deques.

作者: prolate 時(shí)間: 2025-3-29 03:27
,The Accomodating Function — A Generalization of the Competitive Ratio, it had had the amount of resources αn. The accommodating functions for two specific on-line problems are investigated: a variant of bin-packing in which the goal is to maximize the number of objects put in n bins and the seat reservation problem.

作者: 量被毀壞 時(shí)間: 2025-3-29 09:32

作者: 颶風(fēng) 時(shí)間: 2025-3-29 13:31
Conference proceedings 1999999, in Vancouver, Canada. The workshop alternates with the Scandinavian Workshop on Algorithms Theory (SWAT), continuing the tradition of SWAT and WADS starting with SWAT‘88 and WADS‘89. In response to the program committee‘s call for papers, 71 papers were submitted. From these submissions, the pr

作者: 炸壞 時(shí)間: 2025-3-29 16:24
0302-9743 . The workshop took place August 11 - 14, 1999, in Vancouver, Canada. The workshop alternates with the Scandinavian Workshop on Algorithms Theory (SWAT), continuing the tradition of SWAT and WADS starting with SWAT‘88 and WADS‘89. In response to the program committee‘s call for papers, 71 papers wer

作者: 隨意 時(shí)間: 2025-3-29 22:13

作者: Dysarthria 時(shí)間: 2025-3-30 00:30

作者: tenuous 時(shí)間: 2025-3-30 05:25
https://doi.org/10.1007/978-3-658-26554-0n the center of the object is not known, the procedure requires .(..) probes and .(..) computation time. We also give lower bounds that show that the number of probes used by these procedures is optimal.

作者: LANCE 時(shí)間: 2025-3-30 09:28