標(biāo)題: Titlebook: Algorithm Theory – SWAT 2008; 11th Scandinavian Wo Joachim Gudmundsson Conference proceedings 2008 The Editor(s) (if applicable) and The Au [打印本頁(yè)] 作者: 大破壞 時(shí)間: 2025-3-21 18:48
書目名稱Algorithm Theory – SWAT 2008影響因子(影響力)
書目名稱Algorithm Theory – SWAT 2008影響因子(影響力)學(xué)科排名
書目名稱Algorithm Theory – SWAT 2008網(wǎng)絡(luò)公開(kāi)度
書目名稱Algorithm Theory – SWAT 2008網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書目名稱Algorithm Theory – SWAT 2008被引頻次
書目名稱Algorithm Theory – SWAT 2008被引頻次學(xué)科排名
書目名稱Algorithm Theory – SWAT 2008年度引用
書目名稱Algorithm Theory – SWAT 2008年度引用學(xué)科排名
書目名稱Algorithm Theory – SWAT 2008讀者反饋
書目名稱Algorithm Theory – SWAT 2008讀者反饋學(xué)科排名
作者: Decimate 時(shí)間: 2025-3-21 22:38 作者: Benzodiazepines 時(shí)間: 2025-3-22 00:33 作者: Valves 時(shí)間: 2025-3-22 06:28 作者: 本能 時(shí)間: 2025-3-22 10:39 作者: 輕浮思想 時(shí)間: 2025-3-22 16:44 作者: hysterectomy 時(shí)間: 2025-3-22 17:16
Vision-Based Pursuit-Evasion in a Gridr . with the maximum speed of 1 who moves (in a continuous way) on the streets and avenues of an . ×. grid ... The cunning evader is to be captured by a group of pursuers, possibly only one. The maximum speed of the pursuers is .?≥?1 (. is a constant for each pursuit-evasion problem considered, but 作者: HACK 時(shí)間: 2025-3-22 21:29
Angle Optimization in Target Tracking (modeled as a point) sees a target point in a certain direction, ideally with unlimited precision, and thus two cameras (not collinear with the target) unambiguously determine the position of the target. In reality, due to the imprecision of the cameras, instead of a single viewing direction a targ作者: 消瘦 時(shí)間: 2025-3-23 04:48
Improved Bounds for Wireless Localizationroadcasts a unique key within a fixed angular range. Broadcasts are not blocked by the edges of .. The interior of the polygon must be described by a monotone Boolean formula composed from the keys. We improve both upper and lower bounds for the general setting by showing that the maximum number of 作者: Granular 時(shí)間: 2025-3-23 06:11 作者: 經(jīng)典 時(shí)間: 2025-3-23 11:36 作者: 公豬 時(shí)間: 2025-3-23 15:40 作者: flaggy 時(shí)間: 2025-3-23 21:27
Bounded Unpopularity Matchingsle to jobs? Here we consider the notion of .. A matching . is popular if there is no matching .′ such that more people prefer .′ to . than the other way around. Determining whether a given instance admits a popular matching and, if so, finding one, was studied in [2]. If there is no popular matching作者: 約會(huì) 時(shí)間: 2025-3-24 01:09 作者: 粘土 時(shí)間: 2025-3-24 06:01
On the Redundancy of Succinct Data Structuresproblem of representing binary sequences and strings succinctly using small redundancy. We improve the redundancy required to support the important operations of . and . efficiently for binary sequences and for strings over small alphabets. We also show optimal . upper and lower bounds on the redund作者: 裁決 時(shí)間: 2025-3-24 09:02 作者: 凹槽 時(shí)間: 2025-3-24 11:29 作者: GILD 時(shí)間: 2025-3-24 16:45 作者: 粗糙 時(shí)間: 2025-3-24 21:24
Batch Coloring Flat Graphs and Thintraints or conflicts between the jobs, we need to ensure that jobs in the same batch be non-conflicting. That is, we seek a coloring of the conflict graph. The two most common objectives of schedules and colorings are the makespan, or the maximum job completion time, and the sum of job completion ti作者: 變量 時(shí)間: 2025-3-25 01:08
https://doi.org/10.1007/978-3-531-19833-0 of complex parallel computations, by ensuring that two runs of a program that reach the same logical state reach the same physical state, even if various parallel processes executed in different orders during the two runs.作者: 棲息地 時(shí)間: 2025-3-25 04:47 作者: Reservation 時(shí)間: 2025-3-25 09:09 作者: Irremediable 時(shí)間: 2025-3-25 15:11
The Maximum Energy-Constrained Dynamic Flow Problemusing edge flow values may not exist; and finding an integral solution is NP-hard. On the positive side, we show that the problem can be solved polynomially for uniform transit times for a limited time limit; we give an FPTAS for finding a fractional flow; and, most notably, there is a distributed FPTAS that can be run directly on the network.作者: Affable 時(shí)間: 2025-3-25 17:01
Verfassungsgerichte in der Demokratieguards to describe any simple polygon on . vertices is between roughly .n and .n. For the natural setting where guards may be placed aligned to one edge or two consecutive edges of . only, we prove that .???2 guards are always sufficient and sometimes necessary.作者: fluoroscopy 時(shí)間: 2025-3-25 22:35 作者: Regurgitation 時(shí)間: 2025-3-26 03:44 作者: 痛打 時(shí)間: 2025-3-26 05:37
Ahmet Cavuldak,Oliver Hidalgo,Holger Zapfs the size of a disk block. It also supports an insertion and a deletion of a string . with the same number of I/O’s. The size of the data structure is linear in the size of the database and the running time of each operation is .(log(.)?+?|.|).作者: apropos 時(shí)間: 2025-3-26 11:04
Politische Ungleichheit beim W?hlen a group of pursuers, possibly only one. The maximum speed of the pursuers is .?≥?1 (. is a constant for each pursuit-evasion problem considered, but several values for . are studied). We prove several new results; no such algorithms were available for capture using one, two or three pursuers having a constant maximum speed limit:作者: clarify 時(shí)間: 2025-3-26 16:13
Parteien, h?rt Ihr die Signale?nteed a (2,.(log.)) bicriteria approximation, i.e. the solution’s profit is at least a fraction of . of an optimum solution respecting the budget, while its cost is at most twice the given budget. We improve these results and present a bicriteria tradeoff that, given any .?∈?(0,1], guarantees a .-approximation.作者: 祖先 時(shí)間: 2025-3-26 20:18 作者: 雪白 時(shí)間: 2025-3-26 23:18 作者: Diatribe 時(shí)間: 2025-3-27 02:40 作者: majestic 時(shí)間: 2025-3-27 05:45
Bicriteria Approximation Tradeoff for the Node-Cost Budget Problemnteed a (2,.(log.)) bicriteria approximation, i.e. the solution’s profit is at least a fraction of . of an optimum solution respecting the budget, while its cost is at most twice the given budget. We improve these results and present a bicriteria tradeoff that, given any .?∈?(0,1], guarantees a .-approximation.作者: 悲痛 時(shí)間: 2025-3-27 12:44 作者: follicular-unit 時(shí)間: 2025-3-27 16:34
Pola Lehmann,Sven Regel,Sara Schlote algorithms that give good approximations for the general case nonetheless. For networks of bounded treewidth greater than two, we show that the problem is . NP-complete and provide pseudo-polynomial time algorithms. For a special case of graphs with treewidth two, we give a polynomial time algorithm.作者: Nausea 時(shí)間: 2025-3-27 21:49
Die Struktur des Planungssystems=?.?+?1 is also sufficient for a tree . with ., which leads a linear time algorithm for computing .(.) under this condition. We then show that .(.) can be computed in . time for any tree .. Combining these, we finally obtain an . time algorithm, which substantially improves upon previously known results.作者: 確定的事 時(shí)間: 2025-3-27 21:55 作者: 影響帶來(lái) 時(shí)間: 2025-3-28 05:40
Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint algorithms that give good approximations for the general case nonetheless. For networks of bounded treewidth greater than two, we show that the problem is . NP-complete and provide pseudo-polynomial time algorithms. For a special case of graphs with treewidth two, we give a polynomial time algorithm.作者: 蛛絲 時(shí)間: 2025-3-28 10:02 作者: Delectable 時(shí)間: 2025-3-28 13:09 作者: Abominate 時(shí)間: 2025-3-28 15:51
Batch Coloring Flat Graphs and Thinmes. This gives rise to two types of .: . and ., respectively..We give the first . for batch sum coloring on several classes of ”non-thick” graphs that arise in applications. This includes paths, trees, partial .-trees, and planar graphs. Also, we give an improved .(...) exact algorithm for the max-coloring problem on paths.作者: 字的誤用 時(shí)間: 2025-3-28 19:56
https://doi.org/10.1007/978-3-531-19833-0 the years, a fascinating theory has started forming around a convex program given by Eisenberg and Gale in 1959. Besides market equilibria, this theory touches on such disparate topics as TCP congestion control and efficient solvability of nonlinear programs by combinatorial means. Our work shows t作者: 永久 時(shí)間: 2025-3-29 01:41
Die Herausforderungen der Demokratie,In particular, we show that the problem of deciding whether each of . given targets can be tracked with 90° is NP-complete. For the special case where the cameras are placed along a single line while the targets are located anywhere in the plane, we show a 2-approximation both for the sum of trackin作者: 新鮮 時(shí)間: 2025-3-29 03:37 作者: 甜食 時(shí)間: 2025-3-29 07:15 作者: affluent 時(shí)間: 2025-3-29 14:30
https://doi.org/10.1007/978-3-663-09580-4ality-sensitive version of the standard practice—path copying—costing . time and space for modification of a node at depth?., which is expensive when performing many deep but nearby updates. Our second data structure supporting finger movement in . time and no space, while modifications take . time 作者: 柔軟 時(shí)間: 2025-3-29 17:48 作者: 補(bǔ)角 時(shí)間: 2025-3-29 21:24
Nash Bargaining Via Flexible Budget Markets the years, a fascinating theory has started forming around a convex program given by Eisenberg and Gale in 1959. Besides market equilibria, this theory touches on such disparate topics as TCP congestion control and efficient solvability of nonlinear programs by combinatorial means. Our work shows t作者: 強(qiáng)制性 時(shí)間: 2025-3-30 02:21 作者: cruise 時(shí)間: 2025-3-30 07:47
Bounded Unpopularity Matchingsf edges in . and . is the number of nodes) provided a certain graph . admits a matching that matches all people. We also describe a sequence of graphs: .?=?.., ..,...,.. such that if .. admits a matching that matches all people, then we can compute in . time a matching . such that .(.)?≤?.???1 and .作者: 皮薩 時(shí)間: 2025-3-30 11:19 作者: 河潭 時(shí)間: 2025-3-30 16:06 作者: crescendo 時(shí)間: 2025-3-30 19:08
A Uniform Approach Towards Succinct Representation of Treesions [2,19]..We demonstrate how the approach can be applied to obtain a space-optimal succinct representation for the family of free trees where the order of children is insignificant. Furthermore, we show that our approach can be used to obtain entropy-based succinct representations. We show that o作者: 闡釋 時(shí)間: 2025-3-30 22:51
Algorithm Theory – SWAT 2008978-3-540-69903-3Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 擔(dān)心 時(shí)間: 2025-3-31 02:07
0302-9743 Overview: 978-3-540-69900-2978-3-540-69903-3Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 休戰(zhàn) 時(shí)間: 2025-3-31 07:10 作者: Reservation 時(shí)間: 2025-3-31 10:18 作者: 懲罰 時(shí)間: 2025-3-31 14:18
Demokratie — ?digitaly remastered‘?erased with probability p, enjoy a long and rich history. Shannon developed the fundamental results on the capacity of such channels in the 1940’s [19], and in recent years, through the development and analysis of low-density parity-check codes and related families of codes, we understand how to ach作者: probate 時(shí)間: 2025-3-31 19:25
https://doi.org/10.1007/978-3-531-19833-0work, we initiate an algorithmic study of Nash bargaining problems..We consider a class of Nash bargaining problems whose solution can be stated as a convex program. For these problems, we show that there corresponds a market whose equilibrium allocations yield the solution to the convex program and作者: 割讓 時(shí)間: 2025-3-31 22:57 作者: intention 時(shí)間: 2025-4-1 04:55
https://doi.org/10.1007/978-3-531-19833-0ted data structures for orthogonal range queries, line intersection tests, point location, and 2-D dynamic convex hull. Uniquely represented data structures represent each logical state with a unique machine state. Such data structures are .. This eliminates the possibility of privacy violations cau作者: 肉體 時(shí)間: 2025-4-1 06:14
Ahmet Cavuldak,Oliver Hidalgo,Holger Zapfdresses then this is the IP-lookup problem. Our data structure is I/O efficient. It supports a query with a string . using . I/O operations, where . is the size of a disk block. It also supports an insertion and a deletion of a string . with the same number of I/O’s. The size of the data structure i作者: Vulvodynia 時(shí)間: 2025-4-1 12:52 作者: 仔細(xì)閱讀 時(shí)間: 2025-4-1 16:08
Politische Ungleichheit beim W?hlenr . with the maximum speed of 1 who moves (in a continuous way) on the streets and avenues of an . ×. grid ... The cunning evader is to be captured by a group of pursuers, possibly only one. The maximum speed of the pursuers is .?≥?1 (. is a constant for each pursuit-evasion problem considered, but
