標題: Titlebook: Combinatorial and Algorithmic Aspects of Networking; 4th Workshop, CAAN 2 Jeannette Janssen,Pawe? Pra?at Conference proceedings 2007 Spring [打印本頁] 作者: 手套 時間: 2025-3-21 20:04
書目名稱Combinatorial and Algorithmic Aspects of Networking影響因子(影響力)
書目名稱Combinatorial and Algorithmic Aspects of Networking影響因子(影響力)學(xué)科排名
書目名稱Combinatorial and Algorithmic Aspects of Networking網(wǎng)絡(luò)公開度
書目名稱Combinatorial and Algorithmic Aspects of Networking網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Combinatorial and Algorithmic Aspects of Networking被引頻次
書目名稱Combinatorial and Algorithmic Aspects of Networking被引頻次學(xué)科排名
書目名稱Combinatorial and Algorithmic Aspects of Networking年度引用
書目名稱Combinatorial and Algorithmic Aspects of Networking年度引用學(xué)科排名
書目名稱Combinatorial and Algorithmic Aspects of Networking讀者反饋
書目名稱Combinatorial and Algorithmic Aspects of Networking讀者反饋學(xué)科排名
作者: 恃強凌弱的人 時間: 2025-3-21 20:36 作者: 連鎖 時間: 2025-3-22 01:26 作者: 神圣不可 時間: 2025-3-22 04:34
Cleaning Random ,-Regular Graphs with Brushes Using a Degree-Greedy Algorithmeven). We then use a differential equations method to find the (asymptotic) number of brushes needed to clean a random .-regular graph using this algorithm. As well as the case for general ., interesting results for specific values of . are examined. We also state various open problems.作者: 在前面 時間: 2025-3-22 11:04 作者: 容易做 時間: 2025-3-22 14:07
Vertex Pursuit Games in Stochastic Network Models random power law graphs. We investigate asymptotic results for the game of Cops and Robber played on .(.) and .(.,.). Under mild conditions on the degree sequence ., an asymptotic lower bound for the cop number of .(.) is given. We prove that the cop number of random power law graphs with . vertice作者: 容易做 時間: 2025-3-22 17:47
Preemptive Scheduling on Selfish Machines agents. Our goal is to minimize the makespan, whereas the goal of the agents is to maximize their profit. We show that a known algorithm is monotone and can therefore be used to create a truthful mechanism for this problem which achieves the optimal makespan. We extend this result for additional co作者: CRAMP 時間: 2025-3-23 00:24
Selfish Routing and Path Coloring in All-Optical Networks is, functions that charge a player according to her own strategy only..We first strengthen a known relation between such games and online routing and path coloring. In particular, we show that the price of anarchy of such games is lower-bounded by, and in several cases precisely equal to, the compe作者: Veneer 時間: 2025-3-23 03:01
A Worst-Case Time Upper Bound for Counting the Number of Independent Setsr. Exploiting the strong relation between .(.) and Fibonacci numbers, we show that if the depth-first graph of . does not contain a pair of basic cycles with common edges, then .(.) can be computed in linear time (in the size of the graph). This determines new classes of instances of graphs without 作者: NUL 時間: 2025-3-23 07:28 作者: 賞錢 時間: 2025-3-23 12:58
Combinatorial Algorithms for Listing Paths in Minimal Change Orderinimal change ordering, successive elements differ in some pre-specified small way. In this paper, we deal with the generation of paths in a special type of minimal change ordering, the revolving door ordering. We propose a simple algorithm to list all paths in a complete graph, .., with . vertices 作者: AUGUR 時間: 2025-3-23 15:52
Improving Topological Routing in N2R Networksy been satisfactorily proposed for some regular structures such as Grid or Honeycomb. An initial proposal has also been developed for the N2R structures. This paper proposes a modification of this previous algorithm, and in addition two other alternatives. The three options are systematically analyz作者: dominant 時間: 2025-3-23 21:47 作者: 是限制 時間: 2025-3-24 01:45 作者: Cumbersome 時間: 2025-3-24 04:09 作者: 聯(lián)合 時間: 2025-3-24 08:56
Combinatorial Algorithms for Listing Paths in Minimal Change Orderin revolving door order such that each path is generated exactly once. The algorithm is built using space and time efficient schemes that list all spanning paths and “path sets” in revolving door order. Our algorithm is optimal in the sense that it operates in constant amortized time (CAT) and uses linear space.作者: jettison 時間: 2025-3-24 14:21
Improving Topological Routing in N2R Networksed in terms of executing time and path distances, showing that trade-offs are needed in order to determine which algorithm is best for a given case. Also, the possible practical applications the methods could have, are discussed for different traffic scenarios.作者: 最低點 時間: 2025-3-24 18:41
Yuzuru Tanaka,Hajime Imura,Jonas Sj?berghorks: in Selfish Routing and Path Coloring a player must determine both a routing and a coloring for her request, while in Selfish Path Coloring the routing is predetermined and only a coloring of requests needs to be specified. We prove specific upper and lower bounds on the price of anarchy of these games under various payment functions.作者: Optic-Disk 時間: 2025-3-24 20:51 作者: 聾子 時間: 2025-3-24 23:24
Moi-Tin Chew,Serge Demidenko,Yoke-Fei Ngnumber of players. In particular, for nonatomic players and affine latency functions we show that the competitive ratio is at most .. Finally, we present improved upper bounds for the special case of two nodes connected by parallel arcs.作者: 輕快走過 時間: 2025-3-25 06:19 作者: 貨物 時間: 2025-3-25 10:24 作者: 嚴重傷害 時間: 2025-3-25 15:06
P. G. Datskos,N. V. Lavrik,M. J. Sepaniakd variance due to skill differences are equal..We then look at tournament results for championship-level duplicate bridge, PGA golf, and duplicate poker, as well as some simulated toy games, to see how their skill indices compare.作者: 沒花的是打擾 時間: 2025-3-25 18:03 作者: 提煉 時間: 2025-3-26 00:03
Luck vs. Skilld variance due to skill differences are equal..We then look at tournament results for championship-level duplicate bridge, PGA golf, and duplicate poker, as well as some simulated toy games, to see how their skill indices compare.作者: Cleave 時間: 2025-3-26 02:38
Vertex Pursuit Games in Stochastic Network Modelsgree sequence ., an asymptotic lower bound for the cop number of .(.) is given. We prove that the cop number of random power law graphs with . vertices is asymptotically almost surely .(.). We derive concentration results for the cop number of .(.,.) for . as a function of ..作者: insecticide 時間: 2025-3-26 05:17
Kazuhiko Takahashi,Iwao Sugimotoce and reliabilibility of the network for mission critical data has brought the need for backbone capacity that can support all traffic matrices. In this talk we give an overview of the state of the art on networks and routing schemes with this property.作者: GRAIN 時間: 2025-3-26 10:53
https://doi.org/10.1007/978-3-319-14711-6th implementation details by all of which we guide the search process instead of Helsgaun’s .-values. Our computational results are competitive and lead to improved solutions for some of the VLSI instances announced at the TSP homepage.作者: flammable 時間: 2025-3-26 13:48 作者: Introvert 時間: 2025-3-26 20:34
Ho Won Jang,You Rim Choi,Yeon Hoo Kimed in terms of executing time and path distances, showing that trade-offs are needed in order to determine which algorithm is best for a given case. Also, the possible practical applications the methods could have, are discussed for different traffic scenarios.作者: 移植 時間: 2025-3-26 22:29
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/230031.jpg作者: 一再煩擾 時間: 2025-3-27 01:12
Combinatorial and Algorithmic Aspects of Networking978-3-540-77294-1Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 放牧 時間: 2025-3-27 06:44
Moi-Tin Chew,Serge Demidenko,Yoke-Fei Ngeven). We then use a differential equations method to find the (asymptotic) number of brushes needed to clean a random .-regular graph using this algorithm. As well as the case for general ., interesting results for specific values of . are examined. We also state various open problems.作者: Constitution 時間: 2025-3-27 10:42 作者: bacteria 時間: 2025-3-27 13:45 作者: 痛苦一生 時間: 2025-3-27 19:15 作者: 預(yù)示 時間: 2025-3-28 00:28
https://doi.org/10.1007/978-3-540-79590-2these alternatives the implicit (and sometimes explicit) message is that ideally, QoS issues should be dealt with by means of sophisticated admission control (AC) algorithms, and only because of their complexity providers fall on the simpler, perhaps more cost-effective, yet “wasteful” solution of c作者: PLUMP 時間: 2025-3-28 04:47 作者: 意見一致 時間: 2025-3-28 06:39
Moi-Tin Chew,Serge Demidenko,Yoke-Fei Ng possibly all players reroute their flow and form a new equilibrium upon arrival of a new demand..In our model, demands arrive in . sequential games. In each game, the new demands form a Nash equilibrium and their routings remain unchanged afterwards. We study the problem both with nonatomic and ato作者: neolith 時間: 2025-3-28 12:24
David G. Johnson,Graham M. Brooker random power law graphs. We investigate asymptotic results for the game of Cops and Robber played on .(.) and .(.,.). Under mild conditions on the degree sequence ., an asymptotic lower bound for the cop number of .(.) is given. We prove that the cop number of random power law graphs with . vertice作者: DEVIL 時間: 2025-3-28 17:29 作者: HILAR 時間: 2025-3-28 21:27
Yuzuru Tanaka,Hajime Imura,Jonas Sj?bergh is, functions that charge a player according to her own strategy only..We first strengthen a known relation between such games and online routing and path coloring. In particular, we show that the price of anarchy of such games is lower-bounded by, and in several cases precisely equal to, the compe作者: 不要嚴酷 時間: 2025-3-29 00:10 作者: OGLE 時間: 2025-3-29 06:30 作者: 脫毛 時間: 2025-3-29 10:29 作者: 斷言 時間: 2025-3-29 15:05 作者: 發(fā)酵劑 時間: 2025-3-29 15:49
https://doi.org/10.1007/978-3-540-77294-1Online; Routing; algorithms; approximation algorithms; combinatorial algorithms; communication networks; c作者: 刀鋒 時間: 2025-3-29 20:50
978-3-540-77293-4Springer-Verlag Berlin Heidelberg 2007作者: 津貼 時間: 2025-3-30 03:50
Cleaning Random ,-Regular Graphs with Brushes Using a Degree-Greedy Algorithmeven). We then use a differential equations method to find the (asymptotic) number of brushes needed to clean a random .-regular graph using this algorithm. As well as the case for general ., interesting results for specific values of . are examined. We also state various open problems.
