標(biāo)題: Titlebook: Algorithm Theory - SWAT‘98; 6th Scandinavian Wor Stefan Arnborg,Lars Ivansson Conference proceedings 1998 Springer-Verlag Berlin Heidelberg [打印本頁(yè)] 作者: Gullet 時(shí)間: 2025-3-21 17:40
書目名稱Algorithm Theory - SWAT‘98影響因子(影響力)
書目名稱Algorithm Theory - SWAT‘98影響因子(影響力)學(xué)科排名
書目名稱Algorithm Theory - SWAT‘98網(wǎng)絡(luò)公開(kāi)度
書目名稱Algorithm Theory - SWAT‘98網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書目名稱Algorithm Theory - SWAT‘98被引頻次
書目名稱Algorithm Theory - SWAT‘98被引頻次學(xué)科排名
書目名稱Algorithm Theory - SWAT‘98年度引用
書目名稱Algorithm Theory - SWAT‘98年度引用學(xué)科排名
書目名稱Algorithm Theory - SWAT‘98讀者反饋
書目名稱Algorithm Theory - SWAT‘98讀者反饋學(xué)科排名
作者: 擦試不掉 時(shí)間: 2025-3-21 22:32 作者: 蜈蚣 時(shí)間: 2025-3-22 01:32
Improved upper bounds for time-space tradeoffs for selection with limited storage,We give new algorithms for various ranges of extra space. Our upper bounds improve the previously known bounds in the range of space . such that . is .(lg. .) and . ≥ .lg lg ./lg lg lg . for some constant .. We also give faster algorithms to find small ranks.作者: 輕彈 時(shí)間: 2025-3-22 05:00 作者: 上下倒置 時(shí)間: 2025-3-22 10:00 作者: 紅潤(rùn) 時(shí)間: 2025-3-22 15:25 作者: 地名表 時(shí)間: 2025-3-22 20:18 作者: Dungeon 時(shí)間: 2025-3-22 22:40 作者: deadlock 時(shí)間: 2025-3-23 03:40 作者: Ganglion-Cyst 時(shí)間: 2025-3-23 08:27 作者: 極微小 時(shí)間: 2025-3-23 12:09
Michael Oswald,Isabelle Boruckiderlying network could be used to model a city street network for emergency facility location/hospitals, or an electronic network for locating information centers. In any case, it is clear that due to traffic congestion the traversal time on links . with time. Very often, we have estimates as to how作者: 眼界 時(shí)間: 2025-3-23 17:50
Europas pragmatische Netz?ffentlichkeitonflict graph .=., we consider the problem to find a packing for the items into bins of size one such that adjacent items . ? . are assigned to different bins. The goal is to find an assignment with a minimum number of bins..This problem is a natural generalization of the classical bin packing probl作者: 聲音刺耳 時(shí)間: 2025-3-23 20:09 作者: Coordinate 時(shí)間: 2025-3-23 22:55
Europas pragmatische Netz?ffentlichkeitt colors. A line segment . is a . of . if . is a nearest foreign neighbor of . in ., i.e. . and no segment with a color different from . is closer to . than ., and if there exist points . and . realizing the distance between . and . that are . for each other, i.e. the open segment connecting . and .作者: neologism 時(shí)間: 2025-3-24 03:40 作者: hermetic 時(shí)間: 2025-3-24 09:11
https://doi.org/10.1007/978-3-322-99587-2or the motion planning problem. We show that the complexity of the free space of a bounded-reach robot with . degrees of freedom is . .) in the plane, and . .) in three dimensions, for both uncluttered environments and environments of small simple-cover complexity. We also give an example showing th作者: 異端邪說(shuō)2 時(shí)間: 2025-3-24 14:35
Demokratietheorie in Lateinamerika is minimal. We present efficient algorithms for three variants of this problem: In the first the squares axe axis parallel, in the second they are free to rotate but must remain parallel to each other, and in the third they are free to rotate independently.作者: Blanch 時(shí)間: 2025-3-24 17:37
https://doi.org/10.1007/978-3-322-80506-5d universe, under the operations ., which inserts an element into ., and ., which deletes an element with the minimum priority from .. In this paper a priority-queue implementation is given which is efficient with respect to the number of block transfers or I/Os performed between the internal and ex作者: MAUVE 時(shí)間: 2025-3-24 19:35
https://doi.org/10.1007/978-3-658-11221-9 data structure are nondestructive-each operation produces a new list incorporating the change while keeping intact the list or lists to which it applies. Although general techniques exist for making data structures persistent, these techniques fail for structures that are subject to operations, suc作者: 顯赫的人 時(shí)間: 2025-3-25 01:06 作者: 最低點(diǎn) 時(shí)間: 2025-3-25 05:58
Defizite marxistischer Politik-Theorieheap (SBSH), supporting insert in .(1) expected time and delete, delete minimum, decrease key and meld in .(log .) time with high probability. An extension of SBSH called BSH1, supporting insert and meld in .(1) worst case time is presented. This data structure uses a novel “buffering technique” to 作者: 煩躁的女人 時(shí)間: 2025-3-25 07:33
https://doi.org/10.1007/978-3-322-99307-6g . — .(.) for the size of any heap construction network is also proven, implying that the networks presented are within a constant factor of optimal. We give a tight relation between the leading constants in the size of selection networks and in the size of heap construction networks.作者: Ambiguous 時(shí)間: 2025-3-25 13:27 作者: Nonporous 時(shí)間: 2025-3-25 19:51
Defizite marxistischer Politik-Theorielong the aisles, in order to visit disjoint sets of locations. The movement of the robots must comply with the following constraints: (1) no two robots can collide at a grid node or traverse an edge at the same time; (2) a robot‘s sensory capability is limited to detecting the presence of another ro作者: Charitable 時(shí)間: 2025-3-25 21:39
https://doi.org/10.1007/978-3-531-90008-7n: Each source node . needs to multicast a block of data . to the set of destinations. We are interested in protocols for this problem which have minimum communication cost. We consider both the classical case in which any transmitted message can consist of an arbitrary number of data blocks and the作者: CHYME 時(shí)間: 2025-3-26 03:50 作者: euphoria 時(shí)間: 2025-3-26 06:42 作者: annexation 時(shí)間: 2025-3-26 09:43
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/152842.jpg作者: 彎曲的人 時(shí)間: 2025-3-26 16:23 作者: 巧辦法 時(shí)間: 2025-3-26 18:15 作者: 體貼 時(shí)間: 2025-3-26 22:47 作者: committed 時(shí)間: 2025-3-27 03:12
Demokratietheorie und PartizipationspraxisWe give new algorithms for various ranges of extra space. Our upper bounds improve the previously known bounds in the range of space . such that . is .(lg. .) and . ≥ .lg lg ./lg lg lg . for some constant .. We also give faster algorithms to find small ranks.作者: conduct 時(shí)間: 2025-3-27 06:09 作者: 雜役 時(shí)間: 2025-3-27 12:55 作者: MINT 時(shí)間: 2025-3-27 15:34
0302-9743 8, held in Stockholm, Sweden, in July 1998..The volume presents 28 revised full papers selected from 56 submissions; also included are three invited contributions. The papers present original research on algorithms and data structures in various areas including computational geometry, parallel and d作者: 陳腐的人 時(shí)間: 2025-3-27 21:23 作者: 并排上下 時(shí)間: 2025-3-28 01:08
Models and motion planning, and . .) in three dimensions, for both uncluttered environments and environments of small simple-cover complexity. We also give an example showing that these bounds are tight in the worst case. Our bounds fit nicely between the . bound for the maximum free-space complexity in the general case, and the . bound for low-density environments.作者: coalition 時(shí)間: 2025-3-28 05:01 作者: 蝕刻 時(shí)間: 2025-3-28 07:27
Europas pragmatische Netz?ffentlichkeitaph class contains trees, grid graphs, planar graphs and graphs with constant treewidth. The algorithm finds an assignment for the items such that the generated number of bins is within a factor of (1 + .) of optimal, and has a running time polynomial both in . and 1/ε.作者: HALL 時(shí)間: 2025-3-28 14:14
https://doi.org/10.1007/978-3-322-99307-6s use of new geometric observations which can be viewed as generalizations of those used by Megiddo and Dyer‘s sequential algorithms. Our parallel prune-and-search technique also leads to efficient EREW PRAM algorithms for other problems, and is likely to be useful in solving more problems.作者: 溫順 時(shí)間: 2025-3-28 16:01
Defizite marxistischer Politik-Theorieh robot visits at most . ≤ . targets in any order. We also prove a lower bound that shows that our protocol is optimal. Prior to this paper, no optimal protocols were known for . > 1. For .=1 optimal protocols were known only for ., while for . only a randomized suboptimal protocol was known.作者: Leaven 時(shí)間: 2025-3-28 20:39
Facility location with dynamic distance functions,as a center close to it (clearly, the center close to a vertex may change over time). We also provide approximation algorithms as well as hardness results for the .-center problem under this model. This is the first comprehensive study regarding approximation algorithms for facility location for good time-invariant solutions.作者: Digitalis 時(shí)間: 2025-3-29 02:32 作者: 爵士樂(lè) 時(shí)間: 2025-3-29 06:13
Two-variable linear programming in parallel,s use of new geometric observations which can be viewed as generalizations of those used by Megiddo and Dyer‘s sequential algorithms. Our parallel prune-and-search technique also leads to efficient EREW PRAM algorithms for other problems, and is likely to be useful in solving more problems.作者: enfeeble 時(shí)間: 2025-3-29 10:03 作者: Duodenitis 時(shí)間: 2025-3-29 15:10
An optimal algorithm for computing visible nearest foreign neighbors among colored line segments, is not intersected by an open line segment in . We present the first optimal θ(. log .) algorithm that computes for each line segment . all its visible nearest foreign neighbors. The algorithm finds applications in polygon arrangement analysis, VLSI design rule checking and GIS.作者: euphoria 時(shí)間: 2025-3-29 19:24
Simple confluently persistent catenable lists,h as catenation, that combine two or more versions. In this paper we develop a simple implementation of persistent double-ended queues with catenation that supports all deque operations in constant amortized time.作者: persistence 時(shí)間: 2025-3-29 20:15
Concurrent multicast in weighted networks, case in which each message must consist of exactly one block of data. We show that the problem of determining the minimum cost to perform concurrent multicast is NP-hard under both assumptions. We also give approximation algorithms to efficiently perform concurrent multicast in arbitrary networks.作者: Indict 時(shí)間: 2025-3-30 00:56
0302-9743 istributed systems, graph theory, approximation, computational biology, queueing, Voronoi diagrams, and combinatorics in general.978-3-540-64682-2978-3-540-69106-8Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 地殼 時(shí)間: 2025-3-30 05:32 作者: 涂掉 時(shí)間: 2025-3-30 10:20
Europas pragmatische Netz?ffentlichkeit is not intersected by an open line segment in . We present the first optimal θ(. log .) algorithm that computes for each line segment . all its visible nearest foreign neighbors. The algorithm finds applications in polygon arrangement analysis, VLSI design rule checking and GIS.作者: 歪曲道理 時(shí)間: 2025-3-30 16:14
https://doi.org/10.1007/978-3-658-11221-9h as catenation, that combine two or more versions. In this paper we develop a simple implementation of persistent double-ended queues with catenation that supports all deque operations in constant amortized time.作者: GRE 時(shí)間: 2025-3-30 19:33 作者: 禁止,切斷 時(shí)間: 2025-3-31 00:34
Conference proceedings 1998.The volume presents 28 revised full papers selected from 56 submissions; also included are three invited contributions. The papers present original research on algorithms and data structures in various areas including computational geometry, parallel and distributed systems, graph theory, approxima作者: Notify 時(shí)間: 2025-3-31 04:40 作者: 顯赫的人 時(shí)間: 2025-3-31 08:53 作者: cloture 時(shí)間: 2025-3-31 10:10
,An ε — Approximation algorithm for weighted shortest paths on polyhedral surfaces, weight. The cost of travel through each face is the distance traveled multiplied by the face‘s weight. We present an ε-approximation algorithm for computing a weighted shortest path on ., i.e. the ratio of the length of the computed path with respect to the length of an optimal path is bounded by (作者: VOK 時(shí)間: 2025-3-31 14:25
Facility location with dynamic distance functions,derlying network could be used to model a city street network for emergency facility location/hospitals, or an electronic network for locating information centers. In any case, it is clear that due to traffic congestion the traversal time on links . with time. Very often, we have estimates as to how作者: 空洞 時(shí)間: 2025-3-31 18:15
An approximation scheme for bin packing with conflicts,onflict graph .=., we consider the problem to find a packing for the items into bins of size one such that adjacent items . ? . are assigned to different bins. The goal is to find an assignment with a minimum number of bins..This problem is a natural generalization of the classical bin packing probl作者: 現(xiàn)任者 時(shí)間: 2025-4-1 01:28 作者: harrow 時(shí)間: 2025-4-1 04:12
An optimal algorithm for computing visible nearest foreign neighbors among colored line segments,t colors. A line segment . is a . of . if . is a nearest foreign neighbor of . in ., i.e. . and no segment with a color different from . is closer to . than ., and if there exist points . and . realizing the distance between . and . that are . for each other, i.e. the open segment connecting . and .
