Titlebook: Algorithms - ESA 2007; 15th Annual European Lars Arge,Michael Hoffmann,Emo Welzl Conference proceedings 2007 Springer-Verlag Berlin Heidelb

magnify

書(shū)目名稱(chēng)Algorithms - ESA 2007影響因子(影響力)




書(shū)目名稱(chēng)Algorithms - ESA 2007影響因子(影響力)學(xué)科排名




書(shū)目名稱(chēng)Algorithms - ESA 2007網(wǎng)絡(luò)公開(kāi)度




書(shū)目名稱(chēng)Algorithms - ESA 2007網(wǎng)絡(luò)公開(kāi)度學(xué)科排名




書(shū)目名稱(chēng)Algorithms - ESA 2007被引頻次




書(shū)目名稱(chēng)Algorithms - ESA 2007被引頻次學(xué)科排名




書(shū)目名稱(chēng)Algorithms - ESA 2007年度引用




書(shū)目名稱(chēng)Algorithms - ESA 2007年度引用學(xué)科排名




書(shū)目名稱(chēng)Algorithms - ESA 2007讀者反饋




書(shū)目名稱(chēng)Algorithms - ESA 2007讀者反饋學(xué)科排名

新字

漂亮

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.

本能

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

起皺紋

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

粘

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

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

雜色

薄膜

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

不在灌木叢中