標(biāo)題: Titlebook: Structural Information and Communication Complexity; 19th International C Guy Even,Magnús M. Halldórsson Conference proceedings 2012 Spring [打印本頁(yè)] 作者: HEIR 時(shí)間: 2025-3-21 18:25
書目名稱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é)科排名
作者: Debark 時(shí)間: 2025-3-22 00:09 作者: committed 時(shí)間: 2025-3-22 02:16 作者: 腐蝕 時(shí)間: 2025-3-22 07:40 作者: 強(qiáng)制性 時(shí)間: 2025-3-22 11:09
Amotz Bar-Noy,Ben Baumer,Dror Rawitz for the creation of a strategic global UrbanPedia and sheds? ?This?book can be seen as the third part of an unofficial trilogy on Sustainable Cities of the Future with the author‘s previous books ‘Sustainable Development, Energy and the City‘ and ‘Sustainable Cities for the third millennium:?The Od作者: Eeg332 時(shí)間: 2025-3-22 13:44 作者: MAUVE 時(shí)間: 2025-3-22 19:11
Peter Kling,Friedhelm Meyer auf der Heide,Peter Pietrzyk for the creation of a strategic global UrbanPedia and sheds? ?This?book can be seen as the third part of an unofficial trilogy on Sustainable Cities of the Future with the author‘s previous books ‘Sustainable Development, Energy and the City‘ and ‘Sustainable Cities for the third millennium:?The Od作者: GEN 時(shí)間: 2025-3-22 21:37
Martin Biely,Peter Robinson,Ulrich SchmidDevelopment, Energy and the City‘ and ‘Sustainable Cities for the third millennium:?The Odyssey of urban excellence‘, both prefaced by Prof. Sir Peter Hall. All three books?follow the evolving forefront of innovations towards Sustainable Cities. They collectively try to respond to the questions: Wha作者: gangrene 時(shí)間: 2025-3-23 05:02
Majid Khabbazian,Stephane Durocher,Alireza HaghnegahdarDevelopment, Energy and the City‘ and ‘Sustainable Cities for the third millennium:?The Odyssey of urban excellence‘, both prefaced by Prof. Sir Peter Hall. All three books?follow the evolving forefront of innovations towards Sustainable Cities. They collectively try to respond to the questions: Wha作者: 動(dòng)機(jī) 時(shí)間: 2025-3-23 08:16 作者: 使聲音降低 時(shí)間: 2025-3-23 10:25
Dongxiao Yu,Qiang-Sheng Hua,Yuexuan Wang,Haisheng Tan,Francis C. M. Lau for the creation of a strategic global UrbanPedia and sheds? ?This?book can be seen as the third part of an unofficial trilogy on Sustainable Cities of the Future with the author‘s previous books ‘Sustainable Development, Energy and the City‘ and ‘Sustainable Cities for the third millennium:?The Od作者: 現(xiàn)存 時(shí)間: 2025-3-23 15:39
Eyjólfur Ingi ásgeirsson,Magnús M. Halldórsson,Pradipta Mitra for the creation of a strategic global UrbanPedia and sheds? ?This?book can be seen as the third part of an unofficial trilogy on Sustainable Cities of the Future with the author‘s previous books ‘Sustainable Development, Energy and the City‘ and ‘Sustainable Cities for the third millennium:?The Od作者: murmur 時(shí)間: 2025-3-23 20:53
Heger Arfaoui,Pierre Fraigniaudferences on these topics held in 2009, two at the University of Florida and one at the Arizona Winter School. The volume also includes papers from the two focused weeks on quadratic forms and integral lattices at the University of Florida in 2010.Topics discussed include the links between quadratic 作者: sulcus 時(shí)間: 2025-3-24 01:18 作者: 書法 時(shí)間: 2025-3-24 04:08 作者: 種子 時(shí)間: 2025-3-24 06:33
Carole Delporte-Gallet,Hugues Fauconnier,Hung Tran-Theand techniques.Connects fundamental physical properties with.A quantum dot molecule (QDM) is composed of two or more closely spaced quantum dots or “artificial atoms.” In recent years, QDMs have received much attention as an emerging new artificial quantum system. The interesting and unique coupling作者: 激勵(lì) 時(shí)間: 2025-3-24 14:21 作者: rheumatology 時(shí)間: 2025-3-24 17:50
Dan Alistarh,Hagit Attiya,Rachid Guerraoui,Corentin Travers layers by carrying out a systematic set of multi-million atom simulations. The atomistic modeling and simulations allow us to include correct symmetry properties in the calculations of the electronic and optical spectra: a factor critical to explain the experimental evidence. The values of the degr作者: 加花粗鄙人 時(shí)間: 2025-3-24 20:25 作者: 吼叫 時(shí)間: 2025-3-24 23:28
Andreas Larsson,Philippas Tsigasonic devices. However, the emission efficiency of .-plane InGaN/GaN quantum wells (QWs) drops significantly when going to longer wavelengths due to the strong electrostatic built-in fields in such heterostructures. We present a surface integral method to show and explain why the polarization potenti作者: 肥料 時(shí)間: 2025-3-25 03:48 作者: 使服水土 時(shí)間: 2025-3-25 09:52
https://doi.org/10.1007/978-3-642-31104-8anonymous networks; distributed algorithms; graph theory; mobile networks; wireless networks; algorithm a作者: Spinous-Process 時(shí)間: 2025-3-25 15:22 作者: 敲詐 時(shí)間: 2025-3-25 15:58 作者: Commonwealth 時(shí)間: 2025-3-25 21:41 作者: penance 時(shí)間: 2025-3-26 02:08 作者: harbinger 時(shí)間: 2025-3-26 05:51 作者: 允許 時(shí)間: 2025-3-26 11:12
The Fault Tolerant Capacitated ,-Center Problem,ers, where each service center has a limited service capacity and thus may be assigned at most . clients, so as to minimize the maximum distance from a vertex to its assigned service center. This paper studies the fault tolerant version of this problem, where one or more service centers might fail s作者: AUGER 時(shí)間: 2025-3-26 13:16 作者: GROSS 時(shí)間: 2025-3-26 19:52
Changing of the Guards: Strip Cover with Duty Cycling, into . that take turns covering the region in question, and each sensor can belong to at most one shift. We consider the imposition of the duty cycling model upon the . problem, where we are given . sensors on a one-dimensional region, and each shift can contain at most .?≤?. sensors. We call the p作者: 音樂(lè)學(xué)者 時(shí)間: 2025-3-26 21:37 作者: Thyroxine 時(shí)間: 2025-3-27 04:26
An Algorithm for Online Facility Leasing, the clients to opened facilities. When opening a facility we must choose one of . different lease types to use. A lease type . has a certain lease length ... Opening a facility . using lease type . causes a cost of . and ensures that . is open for the next .. time steps. In addition to costs for op作者: amyloid 時(shí)間: 2025-3-27 05:56 作者: adipose-tissue 時(shí)間: 2025-3-27 10:21 作者: 厭倦嗎你 時(shí)間: 2025-3-27 15:18 作者: Externalize 時(shí)間: 2025-3-27 19:16
Distributed Multiple-Message Broadcast in Wireless Ad-Hoc Networks under the SINR Model,seminate all these messages to the whole network. This paper gives the first randomized distributed multiple-message broadcast algorithm with worst-case performance guarantee in wireless ad-hoc networks employing the SINR interference model which takes interferences from all the nodes in the network作者: 治愈 時(shí)間: 2025-3-28 01:13
Wireless Network Stability in the SINR Model,tability in the SINR (Signal to Interference and Noise Ratio) interference model..Specifically, we make the following contributions. We give a distributed algorithm that achieves .-efficiency on all networks (where . is the number of links in the network), for all length monotone, sub-linear power a作者: 施魔法 時(shí)間: 2025-3-28 03:09 作者: Obliterate 時(shí)間: 2025-3-28 09:21 作者: 侵略者 時(shí)間: 2025-3-28 11:24
Mobile Network Creation Games,ordinated interaction of . selfish mobile devices. Each device is owned by a player able to select a node in an underlying positions graph so as to minimize a cost function taking into account two components: the distance from her home position, and the number of players she is not connected to, wit作者: Iatrogenic 時(shí)間: 2025-3-28 15:54
Homonyms with Forgeable Identifiers,y, the . processes share a set of . (1?≤?.?≤?.) identifiers. Assuming that at most . processes may be Byzantine and at most . (.?≤?.?≤?.) of these identifiers are forgeable in the sense that any Byzantine process can falsely use them, we prove that Byzantine Agreement problem is solvable if and only作者: 為敵 時(shí)間: 2025-3-28 21:49 作者: 陶瓷 時(shí)間: 2025-3-29 01:47
Early Deciding Synchronous Renaming in ,( log, ) Rounds or Less,In this paper, we present the first . upper bounds for synchronous renaming, in which the running time adapts to the actual number of failures . in the execution. We show that, surprisingly, renaming can be solved in . time if the number of failures . is limited to ., while for general .?≤?.???1 ren作者: SLAG 時(shí)間: 2025-3-29 03:27 作者: 思想 時(shí)間: 2025-3-29 07:15 作者: 無(wú)能力之人 時(shí)間: 2025-3-29 11:24 作者: dysphagia 時(shí)間: 2025-3-29 19:24
Conference proceedings 2012rks, game theory, parallel computing, social networks, mobile computing (including autonomous robots), peer to peer systems, communication complexity, fault tolerant graph theories, and randomized/probabilistic issues in networks.作者: PACK 時(shí)間: 2025-3-29 20:51 作者: 嘮叨 時(shí)間: 2025-3-30 02:57
Changing of the Guards: Strip Cover with Duty Cycling,.-.. We also give two lower bounds: ., for .?≥?4, and ., for .?=?3, and provide experimental evidence suggesting that these lower bounds are tight. Finally, we propose a fault tolerance model and find thresholds on the sensor failure rate, over which our algorithm has the highest expected performance.作者: 擴(kuò)音器 時(shí)間: 2025-3-30 05:09 作者: ODIUM 時(shí)間: 2025-3-30 08:45
Wireless Network Stability in the SINR Model,uted algorithm that achieves .-efficiency on all networks (where . is the number of links in the network), for all length monotone, sub-linear power assignments. For the power control version of the problem, we give a distributed algorithm with .-efficiency (where Δ is the length diversity of the link set).作者: generic 時(shí)間: 2025-3-30 15:05
Early Deciding Synchronous Renaming in ,( log, ) Rounds or Less,e execution. We show that, surprisingly, renaming can be solved in . time if the number of failures . is limited to ., while for general .?≤?.???1 renaming can always be solved in .( log. ) communication rounds. In the wait-free case, i.e. for .?=?.???1, our upper bounds match the Ω( log. ) lower bound of Chaudhuri et al. [13].作者: EPT 時(shí)間: 2025-3-30 18:54
Homonyms with Forgeable Identifiers, if .?>?2.?+?...Moreover we extend this result to systems with authentication by signatures in which at most . signatures are forgeable and we prove that Byzantine Agreement problem is solvable if and only if .?>?.?+?..作者: mechanical 時(shí)間: 2025-3-30 21:31 作者: 弄皺 時(shí)間: 2025-3-31 04:39
0302-9743 national Colloquium on Structural Information and Communication Complexity, SIROCCO 2012, held in Reykjavik, Iceland for 3 days starting June 30, 2012. The 28 revised full papers presented were carefully reviewed and selected from 54 submissions. SIROCCO is devoted to the study of communication and 作者: 在駕駛 時(shí)間: 2025-3-31 07:25
Space Lower Bounds for Low-Stretch Greedy Embeddings,hs..In this paper, we show that greedy embeddings in low-dimensional Euclidean spaces necessarily have high stretch. In particular, greedy embeddings of .-node graphs with optimal stretch requires at least Ω(.) dimensions for distance ?.. This result disproves a conjecture by Maymounkov (2006) stati作者: 抓住他投降 時(shí)間: 2025-3-31 11:31 作者: 無(wú)畏 時(shí)間: 2025-3-31 13:35
Deterministic Local Algorithms, Unique Identifiers, and Fractional Graph Colouring,istributed algorithms for scheduling problems, we can choose virtually any trade-off between the following three parameters: ., the running time of the algorithm, ?, the length of the schedule, and ., the maximum number of periods of activity for a any single node. Here ? is the objective function o作者: 極微小 時(shí)間: 2025-3-31 19:20
An Algorithm for Online Facility Leasing,n algorithm for the offline problem and an . (.log.)-competitive algorithm for the online variant. Here, . denotes the total number of clients arriving over time. We extend their result by removing the dependency on . (and thereby on the time). In general, our algorithm is .-competitive. Here . deno作者: 運(yùn)動(dòng)的我 時(shí)間: 2025-3-31 23:07 作者: 滲透 時(shí)間: 2025-4-1 05:06
Bounding Interference in Wireless Ad Hoc Networks with Nodes in Random Position,m spanning tree of . has maximum interference .(log.) with high probability. We extend this bound to a general class of communication graphs over a broad set of probability distributions. We present a local algorithm that constructs a graph from this class; this is the first local algorithm to provi作者: 連接 時(shí)間: 2025-4-1 09:46 作者: 放逐 時(shí)間: 2025-4-1 13:40
Distributed Multiple-Message Broadcast in Wireless Ad-Hoc Networks under the SINR Model,lity, where . is the network diameter, . is the number of messages whose broadcasts overlap with ., and . is the number of nodes in the network. We also study the lower bound for randomized distributed multiple-message broadcast protocols. In particular, we prove that any uniform randomized algorith
