標(biāo)題: Titlebook: Algorithmic Aspects in Information and Management; 4th International Co Rudolf Fleischer,Jinhui Xu Conference proceedings 2008 Springer-Ver [打印本頁] 作者: 雜技演員 時間: 2025-3-21 18:24
書目名稱Algorithmic Aspects in Information and Management影響因子(影響力)
書目名稱Algorithmic Aspects in Information and Management影響因子(影響力)學(xué)科排名
書目名稱Algorithmic Aspects in Information and Management網(wǎng)絡(luò)公開度
書目名稱Algorithmic Aspects in Information and Management網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Algorithmic Aspects in Information and Management被引頻次
書目名稱Algorithmic Aspects in Information and Management被引頻次學(xué)科排名
書目名稱Algorithmic Aspects in Information and Management年度引用
書目名稱Algorithmic Aspects in Information and Management年度引用學(xué)科排名
書目名稱Algorithmic Aspects in Information and Management讀者反饋
書目名稱Algorithmic Aspects in Information and Management讀者反饋學(xué)科排名
作者: 嚴重傷害 時間: 2025-3-21 20:41 作者: 迎合 時間: 2025-3-22 02:04
2 Saturated Monoesters, C19-C28,pes of tasks, this gives rise to a plethora of interesting and never studied scheduling problems..We focus on scheduling real-time jobs in a simplified model for cooling and thermal management. A collection of unit-length jobs is given, each job specified by its release time, deadline and heat contr作者: 合并 時間: 2025-3-22 06:30 作者: HAVOC 時間: 2025-3-22 12:33 作者: promote 時間: 2025-3-22 13:50 作者: PRO 時間: 2025-3-22 20:17 作者: GOAT 時間: 2025-3-22 22:32
Copeland Voting Fully Resists Constructive Control,how to exert the control) or we prove that Copeland. is computationally resistant to control in that scenario (i.e., we prove that control problem to be NP-hard). In particular, we prove that Copeland., the system commonly referred to as “Copeland voting,” provides full resistance to constructive co作者: 大炮 時間: 2025-3-23 02:55 作者: 證明無罪 時間: 2025-3-23 08:43 作者: MEN 時間: 2025-3-23 12:52
3 Saturated Monoethers, C10-C12,s roughly speaking the best approximation ratio that we can obtain since, by reducing . to the vertex cover problem, it implies that . cannot be approximated within 1.36 when .?=?2 and .???1???. when .?≥?3. It has to be noticed that the application of our algorithm in the case of the ..??. problem matches the best known approximation ratio.作者: CLOWN 時間: 2025-3-23 17:53
On the Minimum Hitting Set of Bundles Problem,s roughly speaking the best approximation ratio that we can obtain since, by reducing . to the vertex cover problem, it implies that . cannot be approximated within 1.36 when .?=?2 and .???1???. when .?≥?3. It has to be noticed that the application of our algorithm in the case of the ..??. problem matches the best known approximation ratio.作者: Genistein 時間: 2025-3-23 20:05
Engineering Label-Constrained Shortest-Path Algorithms,an extensive experimental study of their performance with various networks and language constraints. Our results show that depending on the network type, both goal-directed and bidirectional search speed up the search considerably, while combinations of these do not.作者: 冥想后 時間: 2025-3-23 23:17
New Upper Bounds on Continuous Tree Edge-Partition Problem, to the ratio search problem. Similar algorithmic technique, when applied to the min-max problem, results in an .(..log.)-time algorithm where .. is the height of the underlying tree network. The previous results for both max-min and min-max problems are .(..) [5].作者: 假 時間: 2025-3-24 06:01
A Meeting Scheduling Problem Respecting Time and Space,as two scheduled meetings separated by a free time interval. In [2], we presented an .(. log.) algorithm for . participants obtained by purely geometrical arguments. Our new approach uses the concept of LP-type problems and leads to a randomized algorithm with expected running time .(.).作者: 采納 時間: 2025-3-24 08:45
Fixed-Parameter Algorithms for Kemeny Scores,tation). Our fixed-parameter algorithms employ the parameters “score of the consensus”, “maximum distance between two input permutations”, and “number of candidates”. We extend our results to votes with ties and incomplete votes, thus, in both cases having no longer permutations as input.作者: 毛細血管 時間: 2025-3-24 11:31 作者: Hypopnea 時間: 2025-3-24 16:13 作者: 顛簸地移動 時間: 2025-3-24 22:53
3 Saturated Monoethers, C13-C22, to the ratio search problem. Similar algorithmic technique, when applied to the min-max problem, results in an .(..log.)-time algorithm where .. is the height of the underlying tree network. The previous results for both max-min and min-max problems are .(..) [5].作者: 消散 時間: 2025-3-25 01:11
3 Saturated Monoethers, C13-C22,as two scheduled meetings separated by a free time interval. In [2], we presented an .(. log.) algorithm for . participants obtained by purely geometrical arguments. Our new approach uses the concept of LP-type problems and leads to a randomized algorithm with expected running time .(.).作者: Climate 時間: 2025-3-25 07:10
2 Saturated Monoesters, C13-C15,tation). Our fixed-parameter algorithms employ the parameters “score of the consensus”, “maximum distance between two input permutations”, and “number of candidates”. We extend our results to votes with ties and incomplete votes, thus, in both cases having no longer permutations as input.作者: 品嘗你的人 時間: 2025-3-25 07:37 作者: conflate 時間: 2025-3-25 14:42 作者: endure 時間: 2025-3-25 16:26 作者: Flatter 時間: 2025-3-25 22:57 作者: construct 時間: 2025-3-26 01:32
0302-9743 M 2008, held in Shanghai, China, in June 2008. The 30 revised full papers presented together with abstracts of 2 invited talks were carefully reviewed and selected from 53 submissions. The papers cover original algorithmic research on immediate applications and/or fundamental problems pertinent to i作者: Insufficient 時間: 2025-3-26 06:59
2 Saturated Monoesters, C13-C15,xpressed as a polynomial sized convex program. We that using the KKT conditions, one can obtain an efficient algorithm to verify the optimality of a schedule. We show that the energy optimal YDS schedule, is 2-approximate with respect to the recharge rate. We show that the online algorithm BKP is .(1)-competitive with respect to recharge rate.作者: 冒失 時間: 2025-3-26 08:32 作者: FOR 時間: 2025-3-26 15:23 作者: 單調(diào)女 時間: 2025-3-26 16:46
2.5.4 Chloroiodo- and Fluoroiodoalkanes, some of these problems from a parametric point of view. Moreover, we exhibit some less obvious applications of these algorithms in the processing of semistructured documents and in computational biology.作者: 競選運動 時間: 2025-3-26 22:34
Speed Scaling with a Solar Cell,xpressed as a polynomial sized convex program. We that using the KKT conditions, one can obtain an efficient algorithm to verify the optimality of a schedule. We show that the energy optimal YDS schedule, is 2-approximate with respect to the recharge rate. We show that the online algorithm BKP is .(1)-competitive with respect to recharge rate.作者: Vertebra 時間: 2025-3-27 03:54
Line Facility Location in Weighted Regions,odel for many facility location problems that arise in practical applications. Our algorithms exploit an interesting property of the problem, that could possibly be used for solving other problems in weighted regions.作者: URN 時間: 2025-3-27 07:16 作者: tinnitus 時間: 2025-3-27 10:00 作者: disrupt 時間: 2025-3-27 17:31 作者: 過時 時間: 2025-3-27 20:51 作者: consolidate 時間: 2025-3-28 00:05 作者: 迎合 時間: 2025-3-28 05:54 作者: opprobrious 時間: 2025-3-28 08:57
Engineering Label-Constrained Shortest-Path Algorithms,ge .???.., the . consists of finding a shortest path . in . such that the concatenated labels along . form a word of .. This definition allows to model, e. g., many traffic-planning problems. We present extensions of well-known speed-up techniques for the standard shortest-path problem, and conduct 作者: 群島 時間: 2025-3-28 12:02 作者: 即席演說 時間: 2025-3-28 16:59 作者: 逢迎白雪 時間: 2025-3-28 22:20 作者: 積習(xí)難改 時間: 2025-3-29 02:35 作者: fabricate 時間: 2025-3-29 03:17 作者: Antarctic 時間: 2025-3-29 08:48
Line Facility Location in Weighted Regions,es, find a line . such that the sum of the weighted distances from the fixed points to . is minimized. The weighted region setup is a more realistic model for many facility location problems that arise in practical applications. Our algorithms exploit an interesting property of the problem, that cou作者: atopic 時間: 2025-3-29 11:57
Algorithms for Temperature-Aware Task Scheduling in Microprocessor Systems,ral scenario can be described as follows. The microprocessor temperature is controlled by the hardware thermal management system that continuously senses the chip temperature and automatically reduces the processor’s speed as soon as the thermal threshold is exceeded. Some tasks are more CPU-intensi作者: 凝視 時間: 2025-3-29 18:07 作者: Sleep-Paralysis 時間: 2025-3-29 23:31
On the Fast Searching Problem, this widely studied problem. Fast searching corresponds to an internal monotone search in which every edge is traversed exactly once and searchers are not allowed to jump. We present a linear time algorithm to compute the fast search number of trees. We investigate the fast search number of biparti作者: 可憎 時間: 2025-3-30 02:38
Copeland Voting Fully Resists Constructive Control,ting (which is here denoted by Copeland.) and a variant (here denoted by Copeland.) of Copeland voting are computationally resistant to many, yet not all, types of constructive control and that they also provide broad resistance to bribery. We study a parameterized version of Copeland voting, denote作者: Respond 時間: 2025-3-30 06:56
The Complexity of Power-Index Comparison,.’s power index value higher? We study this problem with respect to both the Shapley-Shubik power index [16] and the Banzhaf power index [3,6]. Our main result is that for both of these power indices the problem is complete for probabilistic polynomial time (i.e., is PP-complete). We apply our resul作者: CLEAR 時間: 2025-3-30 09:16 作者: 治愈 時間: 2025-3-30 12:28
Algorithmic Aspects in Information and Management978-3-540-68880-8Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 協(xié)議 時間: 2025-3-30 19:22
2 Saturated Monoesters, C11-C12, (.>?0) for the minimum weight dominating set problem in unit disk graphs, which improves a recent result of a 72-approximation given by Ambühl et al.?for solving a long-standing open problem. As a corollary, we obtain a (9.875?+?.)-approximation for the minimum weight connected dominating set problem in unit disk graphs.作者: 有偏見 時間: 2025-3-30 21:02 作者: Corporeal 時間: 2025-3-31 02:08
,Double Partition: (6?+?,)-Approximation for Minimum Weight Dominating Set in Unit Disk Graphs, (.>?0) for the minimum weight dominating set problem in unit disk graphs, which improves a recent result of a 72-approximation given by Ambühl et al.?for solving a long-standing open problem. As a corollary, we obtain a (9.875?+?.)-approximation for the minimum weight connected dominating set problem in unit disk graphs.作者: 松軟 時間: 2025-3-31 05:11 作者: 聯(lián)邦 時間: 2025-3-31 13:09
https://doi.org/10.1007/978-3-540-68880-8algorithm; algorithms; data structure; data structures; game theory; management; optimization; algorithm an作者: sphincter 時間: 2025-3-31 16:11 作者: Heart-Rate 時間: 2025-3-31 19:45 作者: MODE 時間: 2025-3-31 21:40 作者: arabesque 時間: 2025-4-1 02:08
3 Saturated Monoethers, C10-C12,ch element .. (.?=?1, ...,.) has a non negative cost ... A .. is a subset of .. We are also given a collection . of . sets of bundles. More precisely, each set .. (.?=?1, ..., .) is composed of .(.) distinct bundles .. A solution to . is a subset . such that for every . at least one bundle is covere作者: 虛情假意 時間: 2025-4-1 09:44
2 Saturated Monoesters, C13-C15,ge rate. This is the first theoretical investigation of speed scaling for devices with a regenerative energy source. We show that the problem can be expressed as a polynomial sized convex program. We that using the KKT conditions, one can obtain an efficient algorithm to verify the optimality of a s作者: 手工藝品 時間: 2025-4-1 10:40 作者: grovel 時間: 2025-4-1 17:39
3 Saturated Monoethers, C13-C22,trees by selecting .???1 cut points along the edges of the underlying tree. The objective is to maximize (minimize) the minimum (maximum) length of the subtrees. We present an .(.log..)-time algorithm for the max-min problem which is based on parametric search technique [7] and an efficient solution作者: 出處 時間: 2025-4-1 19:48 作者: Inexorable 時間: 2025-4-2 01:41
2 Saturated Monoesters, C13-C15,arches for a “consensus permutation” that is “closest” to the given set of permutations. Computing an optimal consensus permutation is NP-hard. We provide first, encouraging fixed-parameter tractability results for computing optimal scores (that is, the overall distance of an optimal consensus permu
