標題: Titlebook: Algorithms - ESA 2007; 15th Annual European Lars Arge,Michael Hoffmann,Emo Welzl Conference proceedings 2007 Springer-Verlag Berlin Heidelb [打印本頁] 作者: magnify 時間: 2025-3-21 18:07
書目名稱Algorithms - ESA 2007影響因子(影響力)
書目名稱Algorithms - ESA 2007影響因子(影響力)學(xué)科排名
書目名稱Algorithms - ESA 2007網(wǎng)絡(luò)公開度
書目名稱Algorithms - ESA 2007網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Algorithms - ESA 2007被引頻次
書目名稱Algorithms - ESA 2007被引頻次學(xué)科排名
書目名稱Algorithms - ESA 2007年度引用
書目名稱Algorithms - ESA 2007年度引用學(xué)科排名
書目名稱Algorithms - ESA 2007讀者反饋
書目名稱Algorithms - ESA 2007讀者反饋學(xué)科排名
作者: 新字 時間: 2025-3-21 22:49 作者: 漂亮 時間: 2025-3-22 01:21
Nash Equilibria in Voronoi Games on Graphsned to closest facilities and a player’s payoff is the number of customers assigned to it. We show that deciding the existence of a Nash equilibrium for a given graph is .-hard. We also introduce a new measure, the ., defined as the ratio of the costs between the worst and the best Nash equilibria. 作者: 本能 時間: 2025-3-22 06:23
Evolutionary Equilibrium in Bayesian Routing Games: Specialization and Niche Formationccess . parallel links with different speeds. In this model, a player can use a mixed strategy (where he uses different links with a positive probability); then he is indifferent between the different link choices. This means that the player may well deviate to a different strategy over time. We pro作者: 起皺紋 時間: 2025-3-22 08:51
Convergence to Equilibria in Distributed, Selfish Reallocation Processes with Weighted Tasks selfish agents). We assume an arbitrary initial placement of tasks, and we study the performance of distributed, natural reallocation algorithms. We are interested in the time it takes the system to converge to an equilibrium (or get close to an equilibrium)..Our main contributions are . a modifica作者: 粘 時間: 2025-3-22 16:13
Finding Frequent Elements in Non-bursty Streamsam our algorithm detects elements with frequency at least . with space between . and . where .. and .. are the first and the second frequency moments of the stream respectively. The latter space complexity is achieved when the stream is completely bursty; i.e., most elements arrive in contiguous gro作者: Incompetent 時間: 2025-3-22 18:44
Tradeoffs and Average-Case Equilibria in Selfish Routingsage with a certain length by choosing one of several parallel links that have transmission speeds. A player desires to minimize his own transmission time (latency). We study the quality of Nash equilibria of the game, in which no player can decrease his latency by unilaterally changing his link. We作者: 雜色 時間: 2025-3-22 22:32 作者: 薄膜 時間: 2025-3-23 02:59
On Minimum Power Connectivity Problemsaph is the sum of the powers of its nodes. Motivated by applications for wireless networks, we present improved approximation algorithms and inapproximability results for some classic network design problems under the power minimization criteria. In particular, we give a logarithmic approximation al作者: 不在灌木叢中 時間: 2025-3-23 06:18 作者: 設(shè)想 時間: 2025-3-23 12:19 作者: 拍下盜公款 時間: 2025-3-23 14:00 作者: 創(chuàng)造性 時間: 2025-3-23 20:35
Polynomial Time Algorithms for Minimum Energy Schedulinge. One common method for saving energy is to simply suspend the system during the idle times. No energy is consumed in the suspend mode. However, the process of waking up the system itself requires a certain fixed amount of energy, and thus suspending the system is beneficial only if the idle time i作者: 潛移默化 時間: 2025-3-24 01:30 作者: 擋泥板 時間: 2025-3-24 04:07
Finding Branch-Decompositions and Rank-Decompositions an input matroid represented over a fixed finite field, outputs its branch-decomposition of width at most . if such exists. This algorithm works also for partitioned matroids. Both these algorithms are fixed-parameter tractable, that is, they run in time .(..) for each fixed value of . where . is t作者: BRUNT 時間: 2025-3-24 08:04
Fast Algorithms for Maximum Subset Matching and All-Pairs Shortest Paths in Graphs with a (Not So) Sr of vertices of . that can be matched in a matching of .. Our first result is a new randomized algorithm for the Maximum Subset Matching problem that improves upon the fastest known algorithms for this problem. Our algorithm runs in . time if .?≥?.. and in . time if .?≤?.., where .
作者: –FER 時間: 2025-3-24 13:35
Radix Sorting with No Extra Spacerange [1,.] can be sorted in . time [5]. However, these algorithms use .(.) words of extra memory. Is this necessary?.We present a simple, stable, integer sorting algorithm for words of size .(log.), which works in .(.) time and uses only .(1) words of extra memory on a RAM model. This is the intege作者: GUILE 時間: 2025-3-24 16:53 作者: 蘆筍 時間: 2025-3-24 21:32
978-3-540-75519-7Springer-Verlag Berlin Heidelberg 2007作者: 冰雹 時間: 2025-3-25 02:28
https://doi.org/10.1007/978-3-642-76317-5or small enough (additive) . — and hence, presumably, an intractable problem. This solved a long-standing open problem in Algorithmic Game Theory, but created many open questions. For example, it is known that inverse polynomial . is enough to make the problem intractable, while, for two player game作者: 匍匐前進 時間: 2025-3-25 05:57 作者: extrovert 時間: 2025-3-25 07:42 作者: characteristic 時間: 2025-3-25 15:05 作者: 擴張 時間: 2025-3-25 19:27 作者: 乳白光 時間: 2025-3-25 23:11 作者: 屈尊 時間: 2025-3-26 02:20
,Das Lernumfeld – der betriebliche Kontext,sage with a certain length by choosing one of several parallel links that have transmission speeds. A player desires to minimize his own transmission time (latency). We study the quality of Nash equilibria of the game, in which no player can decrease his latency by unilaterally changing his link. We作者: 獸群 時間: 2025-3-26 06:14
https://doi.org/10.1007/978-3-531-94359-6 We are dealing with a possibly heavy-tailed set of weighted items. We address the question: .We present a simple theorem on the variance of subset sum estimation and use it to prove optimality and near-optimality of different known sampling schemes. The performance measure suggested in this paper i作者: dapper 時間: 2025-3-26 11:52
https://doi.org/10.1007/978-3-663-04573-1aph is the sum of the powers of its nodes. Motivated by applications for wireless networks, we present improved approximation algorithms and inapproximability results for some classic network design problems under the power minimization criteria. In particular, we give a logarithmic approximation al作者: 傀儡 時間: 2025-3-26 16:23
https://doi.org/10.1007/978-3-663-04573-1risons are used to determine the order of elements, while the sorting is done by interchanging elements. In the closely related interchange rearrangement problem, final positions of elements are already given, and the cost of the rearrangement is the cost of the interchanges. This problem was studie作者: Digest 時間: 2025-3-26 17:52
https://doi.org/10.1007/978-3-663-04573-1find the token in at most .?≤?. rounds by opening as few boxes as possible, where in each round any set of boxes may be opened. We design and analyze strategies for a searcher who does not know the exact values of the probabilities associated with the locked boxes. Instead, the searcher might know o作者: olfction 時間: 2025-3-26 23:51 作者: 凌辱 時間: 2025-3-27 03:32
Zur Theorie der Interessengruppen,e. One common method for saving energy is to simply suspend the system during the idle times. No energy is consumed in the suspend mode. However, the process of waking up the system itself requires a certain fixed amount of energy, and thus suspending the system is beneficial only if the idle time i作者: 谷物 時間: 2025-3-27 09:00
Warum entstehen Emotionseskalationen?,ength . with don’t care symbols and a bound ., our algorithms find all the places that the pattern matches the text with at most . mismatches. We first give an .(.(.?+?log.loglog.)log.) time randomised solution which finds the correct answer with high probability. We then present a new deterministic作者: 柳樹；枯黃 時間: 2025-3-27 09:55 作者: Osteoarthritis 時間: 2025-3-27 14:49
Die gleislosen Ger?te und ihre Anwendungr of vertices of . that can be matched in a matching of .. Our first result is a new randomized algorithm for the Maximum Subset Matching problem that improves upon the fastest known algorithms for this problem. Our algorithm runs in . time if .?≥?.. and in . time if .?≤?.., where .
作者: Guaff豪情痛飲 時間: 2025-3-27 21:37
Ausl?nderpolitik und ihre sozialen Folgenrange [1,.] can be sorted in . time [5]. However, these algorithms use .(.) words of extra memory. Is this necessary?.We present a simple, stable, integer sorting algorithm for words of size .(log.), which works in .(.) time and uses only .(1) words of extra memory on a RAM model. This is the intege作者: FLASK 時間: 2025-3-27 23:18
Algorithms - ESA 2007978-3-540-75520-3Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 吼叫 時間: 2025-3-28 02:27 作者: 浮夸 時間: 2025-3-28 09:14 作者: 形容詞 時間: 2025-3-28 10:38
Klaus Ackern,Michael Albrecht,Werner F. ListWe review recent progress in the study of arrangements in computational and combinatorial geometry, and discuss several open problems and areas for further research.作者: Incompetent 時間: 2025-3-28 14:59
Organisation und Leitung der BaustellenA?. for the set of all permutations of . ordered symbols translates permutations to their ranks in the lexicographic order of all permutations. This is frequently used for indexing data structures by permutations. We present algorithms for computing both the ranking function and its inverse using .(.) arithmetic operations.作者: 歡樂中國 時間: 2025-3-28 21:47 作者: milligram 時間: 2025-3-28 23:57
Linear-Time Ranking of PermutationsA?. for the set of all permutations of . ordered symbols translates permutations to their ranks in the lexicographic order of all permutations. This is frequently used for indexing data structures by permutations. We present algorithms for computing both the ranking function and its inverse using .(.) arithmetic operations.作者: 符合你規(guī)定 時間: 2025-3-29 05:23
https://doi.org/10.1007/978-3-663-02157-5or a given graph is .-hard. We also introduce a new measure, the ., defined as the ratio of the costs between the worst and the best Nash equilibria. We show that the social cost discrepancy in our game is . and ., where . is the number of vertices and . the number of players.作者: Aggressive 時間: 2025-3-29 11:10 作者: Incorporate 時間: 2025-3-29 14:19 作者: 召集 時間: 2025-3-29 17:36
Convergence to Equilibria in Distributed, Selfish Reallocation Processes with Weighted Tasksare interested in the time it takes the system to converge to an equilibrium (or get close to an equilibrium)..Our main contributions are . a modification of the protocol in [2] that yields faster convergence to equilibrium, together with a matching lower bound, and . a non-trivial extension to weighted tasks.作者: 進入 時間: 2025-3-29 20:11
https://doi.org/10.1007/978-3-658-07826-3tream and lies between 1 and ../... A major advantage of our algorithm is that even if the relative frequencies of the different elements is fixed, the space complexity decreases with the length of the stream if the stream is not bursty.作者: 恃強凌弱 時間: 2025-3-30 02:35 作者: Spinous-Process 時間: 2025-3-30 04:29 作者: Lymphocyte 時間: 2025-3-30 11:29 作者: FELON 時間: 2025-3-30 13:33
Finding Mobile Data: Efficiency vs. Location Inaccuracy searcher can find the token without opening significantly more boxes compared to a searcher who has full knowledge. This problem is equivalent to finding mobile users (tokens) in cellular networks (boxes) and finding data (tokens) in sensor networks (boxes).作者: floaters 時間: 2025-3-30 19:22 作者: 使服水土 時間: 2025-3-30 22:11
Small Worlds as Navigable Augmented Networks: Model, Analysis, and Validationility, Jon Kleinberg modeled this phenomenon in the framework of augmented networks, and analyzed the performances of greedy routing in augmented multi-dimensional meshes. This paper objective is to survey the results that followed up Kleinberg seminal work, including results about:作者: 忘恩負義的人 時間: 2025-3-31 02:33
On Minimum Power Connectivity Problemsgorithm for the problem of finding a min-power subgraph that contains . internally-disjoint paths from a given node . to every other node, and show that several other problems are unlikely to admit a polylogarithmic approximation.作者: Bureaucracy 時間: 2025-3-31 07:18 作者: 庇護 時間: 2025-3-31 12:41 作者: SAGE 時間: 2025-3-31 15:18
Finding Branch-Decompositions and Rank-Decompositionshe number of vertices / elements of the input. (The previous best algorithm for construction of a branch-decomposition or a rank-decomposition of optimal width due to Oum and Seymour [Testing branch-width. J. Combin. Theory Ser. B, .(3) (2007) 385–393] is not fixed-parameter tractable).作者: HILAR 時間: 2025-3-31 20:56
,Die Narkoseführung in der HNO-Chirurgie,ility, Jon Kleinberg modeled this phenomenon in the framework of augmented networks, and analyzed the performances of greedy routing in augmented multi-dimensional meshes. This paper objective is to survey the results that followed up Kleinberg seminal work, including results about:作者: affinity 時間: 2025-4-1 00:02
https://doi.org/10.1007/978-3-663-04573-1gorithm for the problem of finding a min-power subgraph that contains . internally-disjoint paths from a given node . to every other node, and show that several other problems are unlikely to admit a polylogarithmic approximation.作者: theta-waves 時間: 2025-4-1 02:37
https://doi.org/10.1007/978-3-663-04573-1d only for the limited case of permutation strings, where every element appears once. This paper studies a generalization of the classical and well-studied problem on permutations by considering general strings input, thus solving an open problem of Cayley from 1849, and examining various cost models.作者: ingenue 時間: 2025-4-1 10:04 作者: MAUVE 時間: 2025-4-1 11:25
Warum entstehen Emotionseskalationen?,he number of vertices / elements of the input. (The previous best algorithm for construction of a branch-decomposition or a rank-decomposition of optimal width due to Oum and Seymour [Testing branch-width. J. Combin. Theory Ser. B, .(3) (2007) 385–393] is not fixed-parameter tractable).作者: Handedness 時間: 2025-4-1 14:53
https://doi.org/10.1007/978-3-663-02157-5spread over time. The concept has been used widely in biology and economics to analyze the dynamics of strategic interactions. We establish that the ESS is . for a symmetric Bayesian parallel links game (when it exists). Thus evolutionary stability places strong constraints on the assignment of tasks to links.
