標(biāo)題: Titlebook: Structural Information and Communication Complexity; 11th International C Ratislav Královic?,Ondrej Sykora Conference proceedings 2004 Spri [打印本頁] 作者: 變成小松鼠 時間: 2025-3-21 16:28
書目名稱Structural Information and Communication Complexity影響因子(影響力)
書目名稱Structural Information and Communication Complexity影響因子(影響力)學(xué)科排名
書目名稱Structural Information and Communication Complexity網(wǎng)絡(luò)公開度
書目名稱Structural Information and Communication Complexity網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Structural Information and Communication Complexity被引頻次
書目名稱Structural Information and Communication Complexity被引頻次學(xué)科排名
書目名稱Structural Information and Communication Complexity年度引用
書目名稱Structural Information and Communication Complexity年度引用學(xué)科排名
書目名稱Structural Information and Communication Complexity讀者反饋
書目名稱Structural Information and Communication Complexity讀者反饋學(xué)科排名
作者: 使成整體 時間: 2025-3-22 00:15 作者: 內(nèi)疚 時間: 2025-3-22 02:40 作者: Myelin 時間: 2025-3-22 06:11
Two-Hop Virtual Path Layout in Tori,ion (the congestion is the maximum load of a physical link). Here we propose a method to solve this problem when the diameter is 2. We use this method to give an asymptotically optimal solution for the 2-hop virtual path layout problem for all-to-all traffic when the physical network is a mesh, a torus or a chordal ring.作者: aneurysm 時間: 2025-3-22 11:22
Sparse Additive Spanners for Bounded Tree-Length Graphs,dges. This provides new upper bounds for chordal graphs for which .=1. We also show a lower bound, and prove that there are graphs of tree-length . for which every multiplicative .-spanner (and thus every additive (.–1)-spanner) requires Ω(. .) edges.作者: 不可侵犯 時間: 2025-3-22 15:40 作者: 主講人 時間: 2025-3-22 21:06 作者: ERUPT 時間: 2025-3-23 00:52 作者: defray 時間: 2025-3-23 04:19
Morelia Test: Improving the Efficiency of the Gabriel Test and Face Routing in Ad-Hoc Networks,of the network. Face routing guarantees message delivery in networks that contains large holes, where greedy algorithms fail. Existing techniques for constructing a suitable planar subgraph involve local tests that eliminate crossings between existing links by deleting some links. They do not test w作者: 樣式 時間: 2025-3-23 06:02
Path Layout on Tree Networks: Bounds in Different Label Switching Models,col and MPLS which is a new label switching protocol standardized recently by the IETF. Path layout is essentially the problem of reducing the size of the label-table in a router. The size is equivalent to the number of different paths that pass through the router, or start from it. A reduction in t作者: Melanoma 時間: 2025-3-23 11:56
On Approximability of the Independent Set Problem for Low Degree Graphs, .≥ 3. The degree-three case plays a role of the central problem, as many of the results for the other problems use reductions to it. Our careful analysis of approximation algorithms of Berman and Fujito for 3-. shows that one can achieve approximation ratio arbitrarily close to .. Improvements of a作者: Accord 時間: 2025-3-23 17:38
Asynchronous Broadcast in Radio Networks,d by the source node. The timing of arrivals of messages is controlled by adversaries. We consider three different adversaries. The edge adversary can have a transmitted message delivered at different times to different recipients. The crash adversary is the edge one augmented by the ability to cras作者: 使成波狀 時間: 2025-3-23 21:13
Two-Hop Virtual Path Layout in Tori,pattern, the problem consists of designing a virtual network with a given diameter ., which can be embedded in the physical one with a minimum congestion (the congestion is the maximum load of a physical link). Here we propose a method to solve this problem when the diameter is 2. We use this method作者: 寬大 時間: 2025-3-23 22:52
Robot Convergence via Center-of-Gravity Algorithms,ors. A natural algorithm for the problem is based on requiring each robot to move towards the robots’ center of gravity. The paper proves the correctness of the center-of-gravity algorithm in the semi-synchronous model for any number of robots, and its correctness in the fully asynchronous model for作者: 啜泣 時間: 2025-3-24 04:24 作者: 表兩個 時間: 2025-3-24 07:27 作者: Picks-Disease 時間: 2025-3-24 11:43
Sparse Additive Spanners for Bounded Tree-Length Graphs,t most ., i.e., the tree-length . graphs. For such graphs we construct additive 2.-spanners with .(.log .) edges, and additive 4.-spanners with .(.) edges. This provides new upper bounds for chordal graphs for which .=1. We also show a lower bound, and prove that there are graphs of tree-length . fo作者: 凈禮 時間: 2025-3-24 16:41 作者: Bravado 時間: 2025-3-24 20:52 作者: 魯莽 時間: 2025-3-25 01:32
Mobile Agents Rendezvous When Tokens Fail,. Tokens and markers have been used successfully to achieve rendezvous when the problem is symmetric, e.g., the network is an anonymous ring and the mobile agents are identical and run the same deterministic algorithm. In this paper, we explore how token failure affects the time required for mobile 作者: FLASK 時間: 2025-3-25 05:11 作者: Armory 時間: 2025-3-25 09:22
Long-Lived Rambo: Trading Knowledge for Communication,ining linearizability with efficiency in practical algorithms is difficult. A reconfigurable linearizable data service, called ., was developed by Lynch and Shvartsman. This service guarantees consistency under dynamic conditions involving asynchrony, message loss, node crashes, and new node arrival作者: Femish 時間: 2025-3-25 14:47 作者: 使高興 時間: 2025-3-25 18:46
Tighter Bounds on Feedback Vertex Sets in Mesh-Based Networks,, whose removal makes a graph acyclic. The problem is .-hard for general topologies, but optimal and near-optimal solutions have been provided for particular networks. We improve the upper bounds of [11] both for the two-dimensional mesh of trees, and for the pyramid networks. We also present upper 作者: 惡心 時間: 2025-3-25 20:12 作者: 提煉 時間: 2025-3-26 01:07 作者: esthetician 時間: 2025-3-26 04:19
Time Efficient Gossiping in Known Radio Networks,her values of . we propose a solution admitting gossiping in time ?log(.???1)??+?2. Finally we study asymptotically optimal .(.)-time gossiping (where . is a diameter of the network) in graphs with max-degree . for any integer constant .≥ 0 and . large enough.作者: Lignans 時間: 2025-3-26 09:14
The Price of Anarchy in All-Optical Networks,t of paths to the requests so that no request can lower its cost by choosing a different path in the network. For such strategies, we bound the loss of performance of the network (price of anarchy) by comparing the number of wavelengths used by the worst pure Nash equilibrium with that of a centralized optimal solution.作者: 合唱團(tuán) 時間: 2025-3-26 12:42 作者: Axillary 時間: 2025-3-26 17:53
Mobile Agents Rendezvous When Tokens Fail,agent rendezvous under symmetric conditions with different types of knowledge. Our results suggest that knowledge of . is better than knowledge of . in terms of achieving rendezvous as quickly as possible in the faulty token setting.作者: MOAT 時間: 2025-3-27 00:54 作者: 芳香一點 時間: 2025-3-27 04:22 作者: 魔鬼在游行 時間: 2025-3-27 07:22
Structural Information and Communication Complexity978-3-540-27796-5Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 社團(tuán) 時間: 2025-3-27 13:08
0302-9743 Overview: 978-3-540-22230-9978-3-540-27796-5Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 痛恨 時間: 2025-3-27 14:14 作者: Resection 時間: 2025-3-27 20:50
https://doi.org/10.1007/b98251Broadcast; Routing; Selfish Routing; Switching; ad-hoc networking; algorithms; broadcasting; combinatorial 作者: 修飾 時間: 2025-3-27 23:01
F-Chord: Improved Uniform Routing on Chord,We propose a family of novel schemes based on Chord retaining all positive aspects that made Chord a popular topology for routing in P2P networks. The schemes, based on the Fibonacci number system, allow to improve on the maximum/average number of hops for lookups and the routing table size per node.作者: Paradox 時間: 2025-3-28 04:39
Paul Boone,Edgar Chavez,Lev Gleitzky,Evangelos Kranakis,Jaroslav Opatrny,Gelasio Salazar,Jorge Urrut作者: resuscitation 時間: 2025-3-28 10:03 作者: landfill 時間: 2025-3-28 14:20 作者: ITCH 時間: 2025-3-28 18:07
Eric Angel,Evripidis Bampis,Fanny Pascualegitimatize the parton model and provide a well- defined procedure for calculating corrections (some of which are sizable) to the parton model. It is important to recall that in the late 1960’s and early 1970’s no field theory was understood which could lead both to the essentially free parton model作者: 畸形 時間: 2025-3-28 21:44 作者: 專心 時間: 2025-3-28 23:16
Miroslav Chlebík,Janka Chlebíkovánsidered point from its strict lower level set. This observation enables us in Subsection 5.2.2 to show that implementing the separation oracle can be done by solving an optimization problem and so it is in principle possible to construct separating hyperplanes if the cone of strict descent directio作者: Adherent 時間: 2025-3-29 07:08 作者: MOTIF 時間: 2025-3-29 08:43 作者: Affiliation 時間: 2025-3-29 13:53
Reuven Cohen,David Pelege on the same subject, written by one of us (H.A.B.) about 25 years ago for the Geiger-Scheel .Handbuch der Physik.. To the article written last year we have added some Addenda and Errata. These Addenda and Errata refer back to some of the 79 sections of the main text and contain some misprint corre作者: 取回 時間: 2025-3-29 17:59 作者: Tartar 時間: 2025-3-29 22:54 作者: MARS 時間: 2025-3-30 00:23 作者: 提升 時間: 2025-3-30 04:52
Yon Dourisboure,Cyril Gavoillecan be formalized. Especially if, as in an organization, the implementation of a plan requires the cooperation of several individuals or groups of individuals, the plan must be so specified that every person concerned can read from it what he is expected to do in order that the total activities shal作者: 從容 時間: 2025-3-30 11:14
Guillaume Fertin,André Raspaud,Ondrej Sykoraeme assumption served to eliminate the minimum in the relative surface tension .. concentration curve obtained originally by Jones and Ray. Furthermore, our formulae predict no difference in the magnitude of the correction between the two extreme cases for most 1-1 electrolytes.作者: POLYP 時間: 2025-3-30 12:35
Alessandro Ferrante,Mimmo Parentehematical techniques for the equilibrium aspects of the ice problem,. it is unlikely that the more complicated semiconductor work would have been done..Disordered solids present severe problems to theoreticians, not the least of which is how to characterize the disorder. Much effort has gone into th作者: Aphorism 時間: 2025-3-30 19:51
Paola Flocchini,Evangelos Kranakis,Danny Krizanc,Flaminia L. Luccio,Nicola Santoro,Cindy Sawchuk on an initially specified . model to search for better qualitative and quantitative models. In contrast, we have developed a program, TETRAD II, that searches for and evaluates alternative . with fast graph algorithms that entirely bypass parameter estimation. We discuss the two approaches to model作者: meretricious 時間: 2025-3-30 20:58
Leszek G?sieniec,Igor Potapov,Qin Xin applied, such that it can be seen visually, physically, and mathematically simultaneously and in a recognizable way. The application of algebraic topology in this field makes it possible to design a dual system from a certain original system. Finally, some rigorous conclusions are drawn and recomme作者: 昏迷狀態(tài) 時間: 2025-3-31 04:47 作者: albuminuria 時間: 2025-3-31 08:39 作者: 神刊 時間: 2025-3-31 09:56 作者: 失望昨天 時間: 2025-3-31 14:52
Asynchronous Broadcast in Radio Networks,d algorithm. An aim of the algorithm could be either to find a broadcast protocol, possibly with additional properties, or to verify correctness of a given protocol. We give an algorithm to find a protocol correct against the edge adversary. The obtained protocol is work-exponential in general. This作者: Schlemms-Canal 時間: 2025-3-31 18:46
Improved Bounds for Optimal Black Hole Search with a Network Map,hole in at most .(. log .) moves. Thus, this protocol has both . and .. We show that this result, far from closing the research quest, can be significantly improved..In this paper we present a . protocol that allows a team of . agents with a network map to locate the black hole using at most .(. + .作者: ticlopidine 時間: 2025-3-31 23:24 作者: LAY 時間: 2025-4-1 02:11 作者: 上下連貫 時間: 2025-4-1 07:42 作者: 含糊 時間: 2025-4-1 13:57
few lectures will constitute a review of the simple concepts which were in vogue in the “old days,” i.e., prior to the advent of quantum chromodynamics (QCD), and which are loosely referred to as the parton model.This procedure is relevant, even though I personally believe QCD is probably the corre作者: 去世 時間: 2025-4-1 15:01
Eric Angel,Evripidis Bampis,Fanny Pascual few lectures will constitute a review of the simple concepts which were in vogue in the “old days,” i.e., prior to the advent of quantum chromodynamics (QCD), and which are loosely referred to as the parton model.This procedure is relevant, even though I personally believe QCD is probably the corre作者: 閃光你我 時間: 2025-4-1 19:57 作者: PUT 時間: 2025-4-1 23:16
Miroslav Chlebík,Janka Chlebíková possible to construct a hyperplane separating a given point from its corresponding strict lower level set. In spite of the convexity of this set such a “computable” separation is not a trivial matter for a quasiconvex function. Therefore, Section 5.2, based on Ref. [39], is devoted to this topic. T作者: 諷刺滑稽戲劇 時間: 2025-4-2 06:36 作者: flimsy 時間: 2025-4-2 08:58 作者: 出生 時間: 2025-4-2 11:50
Reuven Cohen,David Pelegened that any change would require very major rewriting. On the other hand, no other book on the subject seems to have appeared and we hope this paperback edition will be of some use to a younger generation - if not for another twenty years, at least until someone else has the patience to write a ne
