派博傳思國(guó)際中心

標(biāo)題: Titlebook: Algorithms and Data Structures; 5th International Wo Frank Dehne,Andrew Rau-Chaplin,Roberto Tamassia Conference proceedings 1997 Springer-V [打印本頁(yè)]

作者: 相似    時(shí)間: 2025-3-21 17:48
書(shū)目名稱(chēng)Algorithms and Data Structures影響因子(影響力)




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




書(shū)目名稱(chēng)Algorithms and Data Structures網(wǎng)絡(luò)公開(kāi)度




書(shū)目名稱(chēng)Algorithms and Data Structures網(wǎng)絡(luò)公開(kāi)度學(xué)科排名




書(shū)目名稱(chēng)Algorithms and Data Structures被引頻次




書(shū)目名稱(chēng)Algorithms and Data Structures被引頻次學(xué)科排名




書(shū)目名稱(chēng)Algorithms and Data Structures年度引用




書(shū)目名稱(chēng)Algorithms and Data Structures年度引用學(xué)科排名




書(shū)目名稱(chēng)Algorithms and Data Structures讀者反饋




書(shū)目名稱(chēng)Algorithms and Data Structures讀者反饋學(xué)科排名





作者: ARCH    時(shí)間: 2025-3-21 21:43
Dynamic motion planning in low obstacle density environments,gh worst-case running times. The weak and realistic low obstacle density (L.O.D.) assumption results in linear complexity in the number of obstacles of the free space [1l]. In this paper we consider the dynamic version of the motion planning problem in which a robot moves among moving polygonal obst
作者: 上下倒置    時(shí)間: 2025-3-22 00:37

作者: 多骨    時(shí)間: 2025-3-22 05:05

作者: 失望未來(lái)    時(shí)間: 2025-3-22 09:09
Finding cores of limited length, nodes in the tree. This problem has been examined under different constraints on the tree and on the set of paths, from which the core can be chosen. For all cases, we present linear or almost linear time algorithms, which improves the previous results due to Lo and Peng, J. Algorithms Vol. 20, 199
作者: 徹底檢查    時(shí)間: 2025-3-22 13:31
Approximation algorithms for a genetic diagnostics problem,osis of a important class of chromosomal aberrations. An optimal solution to WDC would enable us to define a genetic assay that maximizes the diagnostic power for a specified cost of laboratory work. We develop approximation algorithms for WDC by making use of the well-known problem SET COVER for wh
作者: 檢查    時(shí)間: 2025-3-22 19:25
Cartographic line simplication and polygon CSG formulae in ,(, log,,) time,e, such as a coastline, on a map. A constructive solid geometry (CSG) conversion for a polygon takes a list of vertices and produces a formula representing the polygon as an intersection and union of primitive halfspaces. By using a data structure that supports splitting convex hulls and finding ext
作者: Synapse    時(shí)間: 2025-3-22 22:47

作者: misshapen    時(shí)間: 2025-3-23 02:05

作者: Offstage    時(shí)間: 2025-3-23 08:53
A linear-time algorithm for the 1-mismatch problem, run of consecutive columns, that have some particular property. The . is to locate all maximal regions in a given alignment for which there exists a (not necessarily unique) “center” sequence such that inside the region alignment rows are within Hamming distance 1 from the center. We first describe
作者: 不容置疑    時(shí)間: 2025-3-23 12:42
On some geometric optimization problems in layered manufacturing,el into layers and manufacturing the layers successively. The problems considered include minimizing the degree of stair-stepping on the surfaces of the manufactured object, minimizing the volume of the so-called support structures used, and minimizing the contact area between the supports and the m
作者: 壯觀的游行    時(shí)間: 2025-3-23 16:19

作者: arthrodesis    時(shí)間: 2025-3-23 18:04
Pattern matching in hypertext,has been done on the natural combination of pattern matching and hypertext. In contrast to regular text, hypertext has a nonlinear structure and the techniques of pattern matching for text cannot be directly applied to hypertext..Manber and Wu pioneered the study of pattern matching in hypertext and
作者: 認(rèn)為    時(shí)間: 2025-3-24 02:12
Multiple approximate string matching,attern. The single-pattern version of the first one is based on the simulation with bits of a non-deterministic finite automaton built from the pattern and using the text as input. To search for multiple patterns, we superimpose their automata, using the result as a filter. The second algorithm part
作者: Kindle    時(shí)間: 2025-3-24 06:11
,Applied computational geometry — Abstract,rking on a small set of problems to a full-blown research area with multiple conferences and journals and many hundreds of researchers. The initial motivation for the field was to develop algorithms that would find application in practice in other fields..In this talk, I will trace some of the origi
作者: 龍卷風(fēng)    時(shí)間: 2025-3-24 07:10

作者: prolate    時(shí)間: 2025-3-24 14:35
Voronoi diagrams for polygon-offset distance functions,int sites in the plane. We provide optimal deterministic .(.(log . + log .) + .)-time algorithms, where . is the number of points and . is the complexity of the underlying polygon, for computing compact representations of both diagrams.
作者: Substance-Abuse    時(shí)間: 2025-3-24 16:23

作者: 玩忽職守    時(shí)間: 2025-3-24 22:02

作者: 磨坊    時(shí)間: 2025-3-25 00:47

作者: 恫嚇    時(shí)間: 2025-3-25 05:14
On-line load balancing for related machines,e ratio of 3 + √8 ≈ 5.828 for the deterministic version, and 3.31/ln 2.155 ≈ 4.311 for its randomized variant, improving the previous competitive ratios of 8 and 2. ≈ 5.436. We also prove lower bounds of 2.4380 on the competitive ratio of deterministic algorithms and 1.8372 on the competitive ratio of randomized algorithms for this problem.
作者: crease    時(shí)間: 2025-3-25 09:58
Checking the convexity of polytopes and the planarity of subdivisions (extended abstract), dimensions, and for various types of planar subdivisions, such as triangulations, Delaunay triangulations, and convex subdivisions. Our checkers are simpler and more general than the ones previously described in the literature. Their performance is studied also in terms of the degree, which characterizes the arithmetic precision required.
作者: mediocrity    時(shí)間: 2025-3-25 13:27
Voronoi diagrams for polygon-offset distance functions,int sites in the plane. We provide optimal deterministic .(.(log . + log .) + .)-time algorithms, where . is the number of points and . is the complexity of the underlying polygon, for computing compact representations of both diagrams.
作者: tooth-decay    時(shí)間: 2025-3-25 17:54

作者: 搖曳的微光    時(shí)間: 2025-3-25 23:20

作者: 詞根詞綴法    時(shí)間: 2025-3-26 01:04

作者: Tortuous    時(shí)間: 2025-3-26 04:47

作者: Mechanics    時(shí)間: 2025-3-26 09:23

作者: amyloid    時(shí)間: 2025-3-26 15:20

作者: Biomarker    時(shí)間: 2025-3-26 17:28

作者: 遍及    時(shí)間: 2025-3-26 22:34
https://doi.org/10.1007/978-3-642-86153-6e, such as a coastline, on a map. A constructive solid geometry (CSG) conversion for a polygon takes a list of vertices and produces a formula representing the polygon as an intersection and union of primitive halfspaces. By using a data structure that supports splitting convex hulls and finding ext
作者: Ligneous    時(shí)間: 2025-3-27 02:01
https://doi.org/10.1007/978-3-8349-8611-5nt with the precedence constraints that minimizes the total cost of the corresponding path in the metric space. We give negative results on approximability by relating the problem to the Shortest Common Supersequence problem, helping to explain why there has been very little success in approximation
作者: 易于交談    時(shí)間: 2025-3-27 08:39

作者: 分發(fā)    時(shí)間: 2025-3-27 12:07

作者: Aviary    時(shí)間: 2025-3-27 16:18

作者: 改革運(yùn)動(dòng)    時(shí)間: 2025-3-27 19:10
https://doi.org/10.1007/978-3-531-91867-9ths and computation times. In this study, the “2-Opt dependency,” which indicates how the performance of the 2-Opt depends on the initial tours built by the construction heuristics, is analyzed. In accordance with the analysis, we devise a new construction heuristic, the . (RSL) method, which runs f
作者: 圓木可阻礙    時(shí)間: 2025-3-27 23:13
Gruppe als moralisches Subjekt,has been done on the natural combination of pattern matching and hypertext. In contrast to regular text, hypertext has a nonlinear structure and the techniques of pattern matching for text cannot be directly applied to hypertext..Manber and Wu pioneered the study of pattern matching in hypertext and
作者: ALOFT    時(shí)間: 2025-3-28 02:22

作者: Ophthalmologist    時(shí)間: 2025-3-28 08:04

作者: intelligible    時(shí)間: 2025-3-28 13:28

作者: CHECK    時(shí)間: 2025-3-28 15:47

作者: 托運(yùn)    時(shí)間: 2025-3-28 22:00
Michael Haller,Martin Niggeschmidtof this problem has been studied extensively, little work has been done on the randomized case. For . = 2 an algorithm achieving a competitive ratio of 4/3 was found by Bartal, Fiat, Karloff and Vohra. These same authors show a matching lower bound. Chen, van Vliet and Woeginger, and independently S
作者: 捏造    時(shí)間: 2025-3-28 23:07

作者: Cholagogue    時(shí)間: 2025-3-29 03:35
https://doi.org/10.1007/978-3-322-98843-0of some of the most outstanding problems in the field. Much of this development owes to the interplay between computational geometry and discrepancy theory. This talk will discuss some intriguing aspects of this development, including the use of data structuring ideas to prove theorems in discrepancy theory.
作者: Chronic    時(shí)間: 2025-3-29 08:56
https://doi.org/10.1007/978-3-662-60282-9 nodes in the tree. This problem has been examined under different constraints on the tree and on the set of paths, from which the core can be chosen. For all cases, we present linear or almost linear time algorithms, which improves the previous results due to Lo and Peng, J. Algorithms Vol. 20, 1996 and Minieka, Networks Vol. 15, 1985.
作者: 抓住他投降    時(shí)間: 2025-3-29 13:14
https://doi.org/10.1007/978-3-8349-8611-5e ratio of 3 + √8 ≈ 5.828 for the deterministic version, and 3.31/ln 2.155 ≈ 4.311 for its randomized variant, improving the previous competitive ratios of 8 and 2. ≈ 5.436. We also prove lower bounds of 2.4380 on the competitive ratio of deterministic algorithms and 1.8372 on the competitive ratio of randomized algorithms for this problem.
作者: 友好    時(shí)間: 2025-3-29 17:40
Ein Ausflug in die Sozialpsychologie, dimensions, and for various types of planar subdivisions, such as triangulations, Delaunay triangulations, and convex subdivisions. Our checkers are simpler and more general than the ones previously described in the literature. Their performance is studied also in terms of the degree, which characterizes the arithmetic precision required.
作者: packet    時(shí)間: 2025-3-29 20:01

作者: Inexorable    時(shí)間: 2025-3-30 02:14
https://doi.org/10.1007/3-540-63307-3Algorithms; algorithm; computational geometry; data structure; data structures; load balancing; optimizati
作者: Motilin    時(shí)間: 2025-3-30 05:04
978-3-540-63307-5Springer-Verlag Berlin Heidelberg 1997
作者: Pedagogy    時(shí)間: 2025-3-30 10:49
Das hei?e Herz des alten Mondese a linear number of recontaminations is shown. The complete algorithm searches a finite cell complex that is constructed on the basis of critical information changes. It has been implemented and computed examples are shown.
作者: 緯度    時(shí)間: 2025-3-30 15:21
https://doi.org/10.1007/978-3-8349-8611-5ch include algorithms proposed and used in empirical studies of this problem). We briefly summarize results of experiments with several algorithms on a standard set of compiler benchmarks, comparing several known and new algorithms.
作者: vascular    時(shí)間: 2025-3-30 19:11
Gruppe als moralisches Subjekt, a . whether the errors occur in the hypertext or the pattern. The approximate pattern matching problem in hypertext with errors in the hypertext turns out to be .-Complete and the approximate pattern matching problem in hypertext with errors in the pattern has a polynomial time solution.
作者: invade    時(shí)間: 2025-3-30 23:45

作者: 指數(shù)    時(shí)間: 2025-3-31 04:28
Visibility-based pursuit-evasion in a polygonal environment,e a linear number of recontaminations is shown. The complete algorithm searches a finite cell complex that is constructed on the basis of critical information changes. It has been implemented and computed examples are shown.
作者: VALID    時(shí)間: 2025-3-31 05:35
Constrained TSP and low-power computing,ch include algorithms proposed and used in empirical studies of this problem). We briefly summarize results of experiments with several algorithms on a standard set of compiler benchmarks, comparing several known and new algorithms.
作者: forestry    時(shí)間: 2025-3-31 13:14

作者: 擦掉    時(shí)間: 2025-3-31 13:23
,Applied computational geometry — Abstract,with a problem for which solution techniques need to be developed. Others begin with a technique and problems are found to which the technique applies. In each case, there is an underlying implementation that justifies the work. Difficulties of the implementation will also be discussed.
作者: 尊嚴(yán)    時(shí)間: 2025-3-31 17:53

作者: 等級(jí)的上升    時(shí)間: 2025-4-1 00:25
https://doi.org/10.1007/978-3-642-86153-6reme points, both were known to have .(. log .) time solutions in the worst-case. This paper shows that both are easier than sorting by presenting an .(. log..) algorithm for maintaining convex hulls under splitting at extreme points. It opens the question of whether there is a practical, linear-time solution.




歡迎光臨 派博傳思國(guó)際中心 (http://www.pjsxioz.cn/) Powered by Discuz! X3.5
临夏市| 车致| 成都市| 澄江县| 合阳县| 桑植县| 虹口区| 秭归县| 蒙自县| 瑞昌市| 泊头市| 三门峡市| 临沂市| 万荣县| 共和县| 类乌齐县| 综艺| SHOW| 连江县| 临沧市| 瑞安市| 日喀则市| 惠水县| 安图县| 苏尼特右旗| 开原市| 察雅县| 枞阳县| 孝义市| 镇平县| 区。| 华容县| 乌兰察布市| 和静县| 和静县| 丁青县| 枣强县| 阜平县| 高淳县| 扎鲁特旗| 富蕴县|