標(biāo)題: Titlebook: Algorithms and Data Structures; 4th International Wo Selim G. Akl,Frank Dehne,Nicola Santoro Conference proceedings 1995 Springer-Verlag Be [打印本頁] 作者: polysomnography 時(shí)間: 2025-3-21 18:48
書目名稱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 23:10 作者: Original 時(shí)間: 2025-3-22 01:22 作者: 劇毒 時(shí)間: 2025-3-22 06:41
978-3-540-60220-0Springer-Verlag Berlin Heidelberg 1995作者: Blood-Vessels 時(shí)間: 2025-3-22 09:17 作者: anthropologist 時(shí)間: 2025-3-22 13:16
Stabsfunktionen im Unternehmen,We show that several well-known computational geometry problems involving 3-dimensional convex polyhedra are NP-hard or NP-complete. One of the techniques we employ is a linear-time method for realizing a planar 3-connected triangulation as a convex polyhedron.作者: 玩笑 時(shí)間: 2025-3-22 19:03 作者: 合唱隊(duì) 時(shí)間: 2025-3-23 00:19
Load balancing in quorum systems,This paper introduces and studies the question of balancing the load on processors participating in a given quorum system. Our proposed measure for the degree of balancing is the ratio between the load on the most frequently referenced element, and on the least frequently used one.作者: 使糾纏 時(shí)間: 2025-3-23 04:38
On the complexity of approximating and illuminating three-dimensional convex polyhedra,We show that several well-known computational geometry problems involving 3-dimensional convex polyhedra are NP-hard or NP-complete. One of the techniques we employ is a linear-time method for realizing a planar 3-connected triangulation as a convex polyhedron.作者: Forehead-Lift 時(shí)間: 2025-3-23 06:54
Computing common tangents without a separating line,Given two disjoint convex polygons in standard representations, one can compute outer common tangents in logarithmic time without first obtaining a separating line. If the polygons are not disjoint, there is an additional factor of the logarithm of the intersection or convex hull, whichever is smaller.作者: bronchodilator 時(shí)間: 2025-3-23 13:15 作者: 全等 時(shí)間: 2025-3-23 17:47
https://doi.org/10.1007/978-3-658-06464-8plane, find two closed strips whose union contains all of the points and such that the width of the wider strip is minimized.” An almost quadratic .. log..) solution is given. The previously best known algorithm for this problem has time complexity ..log..) and uses a parametric search methodology. 作者: Abominate 時(shí)間: 2025-3-23 20:29
https://doi.org/10.1007/978-3-642-97445-8s, some of which have previously been solved by parametric search, and provide efficient and simple algorithms. Our technique improves the solutions obtained by parametric search by a log . factor. For example, we apply the technique to the two-line-center problem, where we want to find two strips t作者: 拱墻 時(shí)間: 2025-3-23 23:25 作者: Munificent 時(shí)間: 2025-3-24 05:01
https://doi.org/10.1007/978-3-642-97447-2using floodlights. We give an ..) time algorithm to find an optimal pair of floodlights to illuminate a convex polygon . with . vertices; that is a pair of floodlights to illuminate a convex polygon in such a way that the sum of their sizes is minimized. When our polygon is cocircular (i.e. all of t作者: decode 時(shí)間: 2025-3-24 06:36 作者: 似少年 時(shí)間: 2025-3-24 11:47 作者: PLE 時(shí)間: 2025-3-24 17:30 作者: corporate 時(shí)間: 2025-3-24 21:07 作者: 入會 時(shí)間: 2025-3-25 01:01 作者: BARB 時(shí)間: 2025-3-25 06:53
https://doi.org/10.1007/978-3-642-97446-5per we study the migration problem under the realistic assumption that the local memories have limited capacities. We assume that the memories are ., i.e., the processors use a hash function in order to locate pages in their memory. We show that, for a number of important network topologies, on-line作者: invulnerable 時(shí)間: 2025-3-25 10:13
https://doi.org/10.1007/978-3-642-97446-5tive ratio of 2.?1 for any metrical task system with . states. We present a randomized algorithm which achieves a competitive ratio of ./(.?1).?1/(.?1)≈1.5820.?0.5820 for any metrical task system of . states. For the uniform metric space, Borodin, Linial, and Saks present an algorithm which achieves作者: 輕浮思想 時(shí)間: 2025-3-25 15:31
https://doi.org/10.1007/978-3-642-79240-3 considerable in comparison to the actual machining time. The problem of minimizing the number of setups is NP-hard. Efficient algorithms are given for a greedy heuristic which finds an orientation maximizing the number of faces that can be machined in a single setup. These results are based on geom作者: 哀悼 時(shí)間: 2025-3-25 16:25 作者: 慢慢流出 時(shí)間: 2025-3-25 20:25
https://doi.org/10.1007/978-3-658-01451-3back to the departure point is considered. The problem is the on-line version of a variant of the Traveling Salesman Problem (namely the Vehicle Routing Problem with release times), and we call it the On-Line Traveling Salesman Problem (OLTSP). It has a variety of relevant applications in logistics 作者: cogent 時(shí)間: 2025-3-26 01:53
https://doi.org/10.1007/978-3-658-01451-3the convex hull of ., if . is a set of points, into quadrangles (quadrilaterals) obtained by inserting edges between pairs of points (diagonals between vertices of the polygon) such that the edges intersect each other only at their end points. Not all polygons or sets of points admit quadrangulation作者: 固執(zhí)點(diǎn)好 時(shí)間: 2025-3-26 05:03 作者: 構(gòu)成 時(shí)間: 2025-3-26 09:23
Conference proceedings 1995August 1995..The book presents 40 full refereed papers selected from a total of 121 submissions together with invited papers by Preparata and Bilardi, Sharir, Toussaint, and Vitanyi and Li. The book addresses various aspects of algorithms, data structures, computational geometry, scheduling, computational graph theory, and searching.作者: 含沙射影 時(shí)間: 2025-3-26 12:48 作者: 廢除 時(shí)間: 2025-3-26 17:21 作者: 讓你明白 時(shí)間: 2025-3-26 23:40
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/153162.jpg作者: 原告 時(shí)間: 2025-3-27 04:43
Lower bounds to processor-time tradeoffs under bounded-speed message propagation,e physical limitation on speed propagation of messages. It is shown that, under this limitation, parallelism and locality combined may yield speedups superlinear in the number of processors. The results are obtained by means of on a novel technique, called the “closed-dichotomy-size technique”, desi作者: 嫻熟 時(shí)間: 2025-3-27 08:42
The two-line center problem from a polar view: a new algorithm and data structure,plane, find two closed strips whose union contains all of the points and such that the width of the wider strip is minimized.” An almost quadratic .. log..) solution is given. The previously best known algorithm for this problem has time complexity ..log..) and uses a parametric search methodology. 作者: 織布機(jī) 時(shí)間: 2025-3-27 12:18
On some geometric selection and optimization problems via sorted matrices,s, some of which have previously been solved by parametric search, and provide efficient and simple algorithms. Our technique improves the solutions obtained by parametric search by a log . factor. For example, we apply the technique to the two-line-center problem, where we want to find two strips t作者: 眼界 時(shí)間: 2025-3-27 17:18
Balanced distributed search trees do not exist,ch trees that is based on few natural assumptions. We prove that any class of trees within our model satisfies a lower bound of . on the worst case height of distributed search trees for . keys. That is, unlike in the single site case, balance in the sense that the tree height satisfies a logarithmi作者: Cleave 時(shí)間: 2025-3-27 20:28 作者: Indebted 時(shí)間: 2025-3-28 01:28 作者: accessory 時(shí)間: 2025-3-28 03:43
Dynamic algorithms for the Dyck languages,blem for the free group. We present deterministic algorithms and data structures which maintain a string under replacements of symbols, insertions, and deletions of symbols, and language membership queries. Updates and queries are handled in polylogarithmic time. We also give both Las Vegas- and Mon作者: needle 時(shí)間: 2025-3-28 10:04
Arrangements in higher dimensions: Voronoi diagrams, motion planning, and other applications,plexity of lower envelopes, single cells, zones, and other substructures in such arrangements, and the design of efficient algorithms (near optimal in the worst case) for constructing and manipulating these structures. We then present applications of the new results to motion planning, Voronoi diagr作者: exclusice 時(shí)間: 2025-3-28 14:01 作者: Habituate 時(shí)間: 2025-3-28 16:39
Going home through an unknown street,nt . to a target point .. We provide upper and lower bounds on the ratio of the distance traveled by the robot in comparison to the length of a shortest path..We consider two problems in this context. First we assume that the location of the target . is known to the robot. We prove a lower bound of 作者: 甜食 時(shí)間: 2025-3-28 20:30
Page migration with limited local memory capacity,per we study the migration problem under the realistic assumption that the local memories have limited capacities. We assume that the memories are ., i.e., the processors use a hash function in order to locate pages in their memory. We show that, for a number of important network topologies, on-line作者: drusen 時(shí)間: 2025-3-28 23:55
Randomized algorithms for metrical task systems,tive ratio of 2.?1 for any metrical task system with . states. We present a randomized algorithm which achieves a competitive ratio of ./(.?1).?1/(.?1)≈1.5820.?0.5820 for any metrical task system of . states. For the uniform metric space, Borodin, Linial, and Saks present an algorithm which achieves作者: Platelet 時(shí)間: 2025-3-29 05:35
Efficient geometric algorithms for workpiece orientation in 4- and 5-axis NC-machining, considerable in comparison to the actual machining time. The problem of minimizing the number of setups is NP-hard. Efficient algorithms are given for a greedy heuristic which finds an orientation maximizing the number of faces that can be machined in a single setup. These results are based on geom作者: Invigorate 時(shí)間: 2025-3-29 07:25
Online perfect matching and mobile computing,ally, and each customer has an associated set of stations to which it may connect. Each station has a capacity limit. We allow the network to preemptively switch a customer between allowed stations to make room for a new arrival. We wish to minimize the total number of switches required to provide s作者: convulsion 時(shí)間: 2025-3-29 13:04
Competitive algorithms for the on-line traveling salesman,back to the departure point is considered. The problem is the on-line version of a variant of the Traveling Salesman Problem (namely the Vehicle Routing Problem with release times), and we call it the On-Line Traveling Salesman Problem (OLTSP). It has a variety of relevant applications in logistics 作者: Vertebra 時(shí)間: 2025-3-29 19:27 作者: ureter 時(shí)間: 2025-3-29 22:27
0302-9743 Canada in August 1995..The book presents 40 full refereed papers selected from a total of 121 submissions together with invited papers by Preparata and Bilardi, Sharir, Toussaint, and Vitanyi and Li. The book addresses various aspects of algorithms, data structures, computational geometry, schedulin作者: 失望昨天 時(shí)間: 2025-3-30 00:07 作者: BINGE 時(shí)間: 2025-3-30 04:28
https://doi.org/10.1007/978-3-642-97445-8btained by parametric search by a log . factor. For example, we apply the technique to the two-line-center problem, where we want to find two strips that cover a given set . of . points in the plane, so as to minimize the width of the largest of the two strips.作者: 豐富 時(shí)間: 2025-3-30 11:32
https://doi.org/10.1007/978-3-642-97447-2ir of floodlights to illuminate a convex polygon in such a way that the sum of their sizes is minimized. When our polygon is cocircular (i.e. all of the vertices of . lie on a circle) such a pair of floodlights can be found in linear time.作者: milligram 時(shí)間: 2025-3-30 13:02 作者: 難管 時(shí)間: 2025-3-30 19:49
https://doi.org/10.1007/978-3-642-79241-0f the polygon. In proving this result we also give polynomial time algorithms for finding the shortest aquarium-keeper‘s path that visits all edges of the polygon, and for finding the shortest postman path that visits all vertices of a polygon.作者: 使激動 時(shí)間: 2025-3-30 23:08
Lower bounds to processor-time tradeoffs under bounded-speed message propagation,superlinear in the number of processors. The results are obtained by means of on a novel technique, called the “closed-dichotomy-size technique”, designed to obtain lower bounds to the computation time for networks of processors, each of which is equipped with a local hierarchical memory.作者: kindred 時(shí)間: 2025-3-31 04:20 作者: 蜿蜒而流 時(shí)間: 2025-3-31 06:09 作者: NATTY 時(shí)間: 2025-3-31 12:00
Dynamic algorithms for the Dyck languages,d deletions of symbols, and language membership queries. Updates and queries are handled in polylogarithmic time. We also give both Las Vegas- and Monte Carlo-type randomised algorithms to achieve better running times, and present lower bounds on the complexity for variants of the problems.作者: 收到 時(shí)間: 2025-3-31 17:16
Computing a shortest watchman path in a simple polygon in polynomial-time,f the polygon. In proving this result we also give polynomial time algorithms for finding the shortest aquarium-keeper‘s path that visits all edges of the polygon, and for finding the shortest postman path that visits all vertices of a polygon.作者: Humble 時(shí)間: 2025-3-31 19:00 作者: fixed-joint 時(shí)間: 2025-4-1 00:31 作者: incubus 時(shí)間: 2025-4-1 02:10
https://doi.org/10.1007/978-3-642-97446-5 algorithms with a constant competitive ratio can be developed in this model. We also study distributed paging. We examine the . of this problem in which there exists only one copy of each page. We develop efficient deterministic and randomized on-line algorithms for this problem.作者: laxative 時(shí)間: 2025-4-1 06:47 作者: 咆哮 時(shí)間: 2025-4-1 12:45
https://doi.org/10.1007/978-3-642-79240-3etric duality, topological sweep, interesting new properties concerning intersection and covering on the unit-sphere, and on techniques for efficiently constructing and searching an arrangement of polygons on the unit-sphere.作者: Evolve 時(shí)間: 2025-4-1 15:16 作者: ordain 時(shí)間: 2025-4-1 22:31
https://doi.org/10.1007/978-3-658-01451-3and robotics..After proving a ≈ 1.64 lower bound on the competitive ratio that can be achieved by on-line algorithms for OLTSP, two competitive algorithms are shown, one of which is 2-competitive and works for any metric space. The second one allows to achieve a nearly optimal competitive ratio of 1.75 on the real line.作者: kindred 時(shí)間: 2025-4-2 01:01 作者: 彎彎曲曲 時(shí)間: 2025-4-2 03:18
Balanced distributed search trees do not exist,c upper bound cannot be achieved. This is true although each node is allowed to have arbitrary degree (note that in this case, the height of a single site search tree is trivially bounded by one). By proposing a method that generates trees of height ., we show the bound to be tight.
