標(biāo)題: Titlebook: Structural Information and Communication Complexity; 14th International C Giuseppe Prencipe,Shmuel Zaks Conference proceedings 2007 Springe [打印本頁] 作者: necrosis 時(shí)間: 2025-3-21 19:41
書目名稱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é)科排名
作者: Congestion 時(shí)間: 2025-3-21 20:46 作者: 分開如此和諧 時(shí)間: 2025-3-22 01:16
Why Robots Need Maps, we prove the lower bound of .(log. /loglog.) for competitive ratio of any deterministic algorithm (using global communication). This significantly improves the best known constant lower bound. For the cost being the maximal number of edges traversed by a robot (the energy) we present an improved (4???2/.)-competitive online algorithm for trees.作者: CRAFT 時(shí)間: 2025-3-22 05:41
A New Self-stabilizing Maximal Matching Algorithmon, the algorithm improves the previous best moves complexities for the distributed adversarial daemon from .(..) and .(.) to .(.) where n is the number of processes, m is the number of edges, and . is the maximum degree in the graph.作者: 新陳代謝 時(shí)間: 2025-3-22 09:34 作者: Ischemic-Stroke 時(shí)間: 2025-3-22 15:19 作者: itinerary 時(shí)間: 2025-3-22 18:28
Distributed Algorithms for Partitioning a Swarm of Autonomous Mobile Robotsext, the role of common orientation shared by the robots is examined. Necessary and sufficient conditions for the partitioning problem to be solvable are given in the different timing models. Finally, the problem is proved to be unsolvable in the no-compass asynchronous model.作者: Asymptomatic 時(shí)間: 2025-3-23 00:06 作者: Incise 時(shí)間: 2025-3-23 02:58
Fast Distributed Algorithms Via Primal-Dual (Extended Abstract)he primal-dual schema. The kind of problems we have in mind are of the following type. We have a synchronous, message-passing network that is to compute a global function of its own topology. Examples of such functions are maximal independent sets, vertex and edge colorings, small dominating sets, v作者: 切碎 時(shí)間: 2025-3-23 07:29
Time Optimal Gathering in Sensor Networksthroughout the network must be collected at a sink node; the aim is to minimize the time needed to complete the process. The emphasis is on some algorithmic and graph theoretical problems arising in the area.作者: braggadocio 時(shí)間: 2025-3-23 13:11
Fast Periodic Graph Exploration with Constant Memory a constant number of states (memory bits), must be able to explore any unknown anonymous graph. The nodes in the graph are neither labelled nor colored. However, while visiting a node . the robot can distinguish between edges incident to it. The edges are ordered and labelled by consecutive integer作者: 冷淡一切 時(shí)間: 2025-3-23 14:36 作者: 使人煩燥 時(shí)間: 2025-3-23 21:29
Graph Searching with Advicet number of bits of information that has to be available to nodes in order to accomplish the task efficiently. Our paper deals with the number of bits of advice required to perform efficiently the graph searching problem in a distributed setting. In this variant of the problem, all searchers are ini作者: 原諒 時(shí)間: 2025-3-24 00:32
From Renaming to Set Agreementthe size . depends on the number of processes that want to acquire a new name (and not on the total number . of processes). Assuming each process proposes a value, the .-set agreement problem allows each process to decide a proposed value in such a way that at most . different values are decided. In作者: 禍害隱伏 時(shí)間: 2025-3-24 03:07 作者: assail 時(shí)間: 2025-3-24 07:18 作者: corn732 時(shí)間: 2025-3-24 11:54
Labeling Schemes with Queriesven to any two vertices . and . for some function . (e.g. “distance(.,.)”) one can compute the function (e.g. the graph distance between . and .). Some very involved lower bounds for the sizes of the labels were proven..In this paper, we demonstrate that such lower bounds are very sensitive to the n作者: BACLE 時(shí)間: 2025-3-24 15:53 作者: Truculent 時(shí)間: 2025-3-24 22:49
Data Aggregation in Sensor Networks: Balancing Communication and Delay Costsare highly energy constrained. Data aggregation can be used to combine data of several sensors into a single message, thus reducing sensor communication costs at the expense of message delays. Thus, the main problem of data aggregation is to balance the communication and delay costs..In this paper w作者: 解凍 時(shí)間: 2025-3-25 00:44
Optimal Moves for Gossiping Among Mobile Agentsd system and carry out a task at each node. In such mobile-agent-based systems, . is the most fundamental scheme supporting cooperation among mobile agents. It requires to accomplish all-to-all information exchange over all agents so that each agent can obtain the all information each agent initiall作者: 連接 時(shí)間: 2025-3-25 05:32
Swing Words to Make Circle Formation Quiescent in the semi-synchronous model (SSM)—no two robots are supposed to be at the same position in the initial configuration. The proposed protocol is .— all the robots are eventually . in the desired configuration, which remains true thereafter. In SSM, the improvement of the latest recent work for this作者: gratify 時(shí)間: 2025-3-25 09:10 作者: 濕潤 時(shí)間: 2025-3-25 15:25 作者: 膽大 時(shí)間: 2025-3-25 18:59 作者: Arthropathy 時(shí)間: 2025-3-25 21:43
Location Oblivious Distributed Unit Disk Graph Coloringf colors used by the algorithm is at most three times the chromatic number of the graph). This is an improvement over the standard sequential coloring algorithm since we present a new lower bound of 10/3 for the worst-case performance ratio of the sequential coloring algorithm. The previous greatest作者: Formidable 時(shí)間: 2025-3-26 03:49
Edge Fault-Diameter of Cartesian Product of Graphs connected, ..-edge connected,..., ..-edge connected graphs and 0?≤?..?
作者: 起波瀾 時(shí)間: 2025-3-26 04:54
978-3-540-72918-1Springer-Verlag Berlin Heidelberg 2007作者: FIN 時(shí)間: 2025-3-26 10:50
Structural Information and Communication Complexity978-3-540-72951-8Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 一夫一妻制 時(shí)間: 2025-3-26 16:25 作者: 進(jìn)入 時(shí)間: 2025-3-26 19:44
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/s/image/879949.jpg作者: uncertain 時(shí)間: 2025-3-26 22:11
https://doi.org/10.1007/978-3-540-72951-8Selfish Routing; algorithm; algorithms; complexity; data structure; data structures; distributed computing作者: AVID 時(shí)間: 2025-3-27 03:31 作者: 龍卷風(fēng) 時(shí)間: 2025-3-27 07:14
Edge Fault-Diameter of Cartesian Product of Graphs connected, ..-edge connected,..., ..-edge connected graphs and 0?≤?..?
作者: 絆住 時(shí)間: 2025-3-27 11:01
Treewidth: Structure and AlgorithmsThis paper surveys some aspects of the graph theoretic notion of treewidth. In particular, we look at the interaction between different characterizations of the notion, and algorithms and algorithmic applications.作者: Maximize 時(shí)間: 2025-3-27 17:40 作者: 行乞 時(shí)間: 2025-3-27 18:30 作者: Limited 時(shí)間: 2025-3-28 00:16
Luisa Garganoscience requiring advanced mathematical approaches for analyzing and solving spatial and temporal multidimensional partial differential equations such as Time-Dependent Schroedinger Equations (TDSE) and?Time-Dependent Dirac equations (TDDEs for relativistic phenomena). These equations are also coupl作者: 沐浴 時(shí)間: 2025-3-28 02:17
Hans L. Bodlaenderscience requiring advanced mathematical approaches for analyzing and solving spatial and temporal multidimensional partial differential equations such as Time-Dependent Schroedinger Equations (TDSE) and?Time-Dependent Dirac equations (TDDEs for relativistic phenomena). These equations are also coupl作者: Terminal 時(shí)間: 2025-3-28 09:09
Leszek G?sieniec,Ralf Klasing,Russell Martin,Alfredo Navarra,Xiaohui Zhangscience requiring advanced mathematical approaches for analyzing and solving spatial and temporal multidimensional partial differential equations such as Time-Dependent Schroedinger Equations (TDSE) and?Time-Dependent Dirac equations (TDDEs for relativistic phenomena). These equations are also coupl作者: 使入迷 時(shí)間: 2025-3-28 12:09 作者: 收養(yǎng) 時(shí)間: 2025-3-28 16:49 作者: Indent 時(shí)間: 2025-3-28 21:24
Maurice Herlihy,Yossi Lev,Victor Luchangco,Nir Shavitscience requiring advanced mathematical approaches for analyzing and solving spatial and temporal multidimensional partial differential equations such as Time-Dependent Schroedinger Equations (TDSE) and?Time-Dependent Dirac equations (TDDEs for relativistic phenomena). These equations are also coupl作者: Tractable 時(shí)間: 2025-3-29 00:00 作者: elastic 時(shí)間: 2025-3-29 03:58
Yoann Dieudonné,Franck Petitscience requiring advanced mathematical approaches for analyzing and solving spatial and temporal multidimensional partial differential equations such as Time-Dependent Schroedinger Equations (TDSE) and?Time-Dependent Dirac equations (TDDEs for relativistic phenomena). These equations are also coupl作者: antidote 時(shí)間: 2025-3-29 08:43
Asaf Efrima,David Pelegness. In this context, quality/QoL assessment becomes an essential contributor to ethical practice, a critical step towards improving the nature of social interactions. The author considers linear, non-linear, and complexity-based models in analyzing key methodology and content issues in health-rela作者: Carcinogenesis 時(shí)間: 2025-3-29 13:19
Iztok Bani?,Janez ?erovnikness. In this context, quality/QoL assessment becomes an essential contributor to ethical practice, a critical step towards improving the nature of social interactions. The author considers linear, non-linear, and complexity-based models in analyzing key methodology and content issues in health-rela作者: BAN 時(shí)間: 2025-3-29 17:47
Fast Distributed Algorithms Via Primal-Dual (Extended Abstract) own color, whether or not to be part of the dominating set etc. In many situations of interest the cost of communication is orders of magnitude larger than local computation cost, and the model provides a rough, but quite useful, quantitative framework to develop and analyze interesting algorithms.作者: Middle-Ear 時(shí)間: 2025-3-29 22:41 作者: 建筑師 時(shí)間: 2025-3-30 00:16 作者: Adrenaline 時(shí)間: 2025-3-30 05:52 作者: gastritis 時(shí)間: 2025-3-30 09:51 作者: characteristic 時(shí)間: 2025-3-30 15:34
A Simple Optimistic Skiplist Algorithm acquiring locks, requiring only a short lock-based validation before adding or removing nodes. Experimental evidence shows that this simpler algorithm performs as well as the best previously known lock-free algorithm under the most common search patterns.作者: 綠州 時(shí)間: 2025-3-30 19:54 作者: 無法取消 時(shí)間: 2025-3-31 00:45 作者: 是比賽 時(shí)間: 2025-3-31 02:16
Miroslaw Dynia,Jakub ?opuszański,Christian Schindelhaueremporal multidimensional partial differential equations such as Time-Dependent Schroedinger Equations (TDSE) and?Time-Dependent Dirac equations (TDDEs for relativistic phenomena). These equations are also coupl978-1-4939-4083-7978-1-4419-9491-2Series ISSN 2627-7654 Series E-ISSN 2627-7662 作者: 推遲 時(shí)間: 2025-3-31 08:38 作者: photophobia 時(shí)間: 2025-3-31 12:21
Fredrik Manne,Morten Mjelde,Laurence Pilard,Sébastien Tixeuilemporal multidimensional partial differential equations such as Time-Dependent Schroedinger Equations (TDSE) and?Time-Dependent Dirac equations (TDDEs for relativistic phenomena). These equations are also coupl978-1-4939-4083-7978-1-4419-9491-2Series ISSN 2627-7654 Series E-ISSN 2627-7662 作者: 大方一點(diǎn) 時(shí)間: 2025-3-31 16:28
Amos Korman,Shay Kuttenemporal multidimensional partial differential equations such as Time-Dependent Schroedinger Equations (TDSE) and?Time-Dependent Dirac equations (TDDEs for relativistic phenomena). These equations are also coupl978-1-4939-4083-7978-1-4419-9491-2Series ISSN 2627-7654 Series E-ISSN 2627-7662 作者: 大雨 時(shí)間: 2025-3-31 20:25
Tomoko Suzuki,Taisuke Izumi,Fukuhito Ooshita,Hirotsugu Kakugawa,Toshimitsu Masuzawaemporal multidimensional partial differential equations such as Time-Dependent Schroedinger Equations (TDSE) and?Time-Dependent Dirac equations (TDDEs for relativistic phenomena). These equations are also coupl978-1-4939-4083-7978-1-4419-9491-2Series ISSN 2627-7654 Series E-ISSN 2627-7662 作者: Allodynia 時(shí)間: 2025-4-1 00:31
