標題: Titlebook: Algorithms for Sensor Systems; 13th International S Antonio Fernández Anta,Tomasz Jurdzinski,Yanyong Z Conference proceedings 2017 Springer [打印本頁] 作者: Strategy 時間: 2025-3-21 16:31
書目名稱Algorithms for Sensor Systems影響因子(影響力)
書目名稱Algorithms for Sensor Systems影響因子(影響力)學科排名
書目名稱Algorithms for Sensor Systems網(wǎng)絡公開度
書目名稱Algorithms for Sensor Systems網(wǎng)絡公開度學科排名
書目名稱Algorithms for Sensor Systems被引頻次
書目名稱Algorithms for Sensor Systems被引頻次學科排名
書目名稱Algorithms for Sensor Systems年度引用
書目名稱Algorithms for Sensor Systems年度引用學科排名
書目名稱Algorithms for Sensor Systems讀者反饋
書目名稱Algorithms for Sensor Systems讀者反饋學科排名
作者: 彎彎曲曲 時間: 2025-3-21 22:58 作者: 充氣球 時間: 2025-3-22 01:02
Parameterized Algorithms for Power-Efficient Connected Symmetric Wireless Sensor Networks,n edge-weighted .-vertex graph, find a connected spanning subgraph of minimum cost, where the cost is determined by letting each vertex pay the most expensive edge incident to it in the subgraph. We provide an algorithm that works in polynomial time if one can find a set of obligatory edges that yie作者: FAST 時間: 2025-3-22 05:50
Fast Distributed Approximation for Max-Cut, been insufficiently studied in the classic distributed settings, where vertices communicate by synchronously sending messages to their neighbors according to the underlying graph, known as the . or . models. We amend this by obtaining almost optimal algorithms for Max-Cut on a wide class of graphs 作者: Synapse 時間: 2025-3-22 11:59 作者: voluble 時間: 2025-3-22 14:48 作者: Decibel 時間: 2025-3-22 18:06
Querying with Uncertainty,ifferent locations, each associated with a probability ., .. If the item is placed in location ., a query trial by any of the robots reveals the item with probability .. Each robot . is assigned a subset . of the locations, and is allowed to perform a random walk among them, each time step querying 作者: Tremor 時間: 2025-3-23 00:58
Energy-Optimal Broadcast in a Tree with Mobile Agents,esponding nodes along the edge. One node of the tree, the source ., possesses a piece of information which has to be communicated (broadcasted) to all other nodes using mobile agents. An agent visiting a node, which already possesses the information, automatically acquires it and communicates it to 作者: 進入 時間: 2025-3-23 01:22 作者: transdermal 時間: 2025-3-23 09:11
Improved Leader Election for Self-organizing Programmable Matter,llective goal without the need for central control or external intervention. We use the geometric amoebot model to describe such self-organizing particle systems, which defines how particles can actively move and communicate with one another. In this paper, we present an efficient local-control algo作者: Derogate 時間: 2025-3-23 12:47 作者: breadth 時間: 2025-3-23 17:20
Uniform Dispersal of Robots with Minimum Visibility Range, order to reach full coverage. The entry points are called doors. The area is decomposed into cells. The robots are autonomous, anonymous, they have a limited visibility range of one unit, and do not use explicit communication. Collision of the robots is not allowed. First we describe an algorithm s作者: canvass 時間: 2025-3-23 21:38 作者: ATOPY 時間: 2025-3-23 23:21
A Continuous Strategy for Collisionless Gathering,hood, and continuously adapts speed and direction following a local rule. We present two main results. The first defines a class of strategies, the contracting strategies, that perform gathering in time .(.), where . is a diameter of the initial configuration. Several well-known strategies belong to作者: SPER 時間: 2025-3-24 03:55
Maximizing Barrier Coverage Lifetime with Static Sensors,r as long as possible. The energy consumption of a sensor depends on its sensing radius: energy is drained in inverse proportion to the sensor radius raised to a constant exponent .. In the . (.) the radius of each sensor can be set once, and the sensor can be activated at any time. . and . are vari作者: corpuscle 時間: 2025-3-24 07:24
Independent Sets in Restricted Line of Sight Networks,ph . is a 2-dimensional LoS network if it can be embedded in an . rectangular point set such that a pair of vertices in . are adjacent if and only if the embedded vertices are placed on the same row or column and are at a distance less than .. We study the Maximum Independent Set (MIS) problem in re作者: 獨行者 時間: 2025-3-24 13:58 作者: 捏造 時間: 2025-3-24 15:19
https://doi.org/10.1007/978-3-531-91802-0that this problem is .-complete. In the second problem, the initial positions of the robots are not fixed but a subset of nodes . of the graph is given as input together with an integer ., and the question is as follows: is there a placement of . robots at nodes in . such that the delivery is possib作者: Desert 時間: 2025-3-24 20:21 作者: 相符 時間: 2025-3-25 03:03 作者: 不如樂死去 時間: 2025-3-25 07:08
https://doi.org/10.1007/978-3-531-91802-0 sets . are restricted to be either pairwise disjoint or identical. Our findings allow us to obtain optimal solutions, when sets . are exclusively pairwise disjoint, requiring time .. In our second contribution, we devise an optimal polynomial time algorithm for querying with . robots even when the 作者: agonist 時間: 2025-3-25 07:46 作者: 類似思想 時間: 2025-3-25 14:13
https://doi.org/10.1007/978-3-531-91802-0shown to be .. Moreover, for all . there exists a speed . such that any algorithm knowing neither the bus speed nor its direction will need time at least . to meet the bus..These results are also generalized to . robots and analogous tight upper and lower bounds are proved depending on the knowledge作者: braggadocio 時間: 2025-3-25 18:21
Informationssystem für Perspektivplanunglags” to communicate these states to neighbors in viewing range. They gather in time ...In this paper we contribute the (to the best of our knowledge) first gathering algorithm on the grid that works under the same simple local model as the above mentioned Euclidean plane strategy, i.e., without mem作者: Ascendancy 時間: 2025-3-25 23:51 作者: 曲解 時間: 2025-3-26 03:46
https://doi.org/10.1007/978-3-322-96236-2ions of the Maximum Weighted Independent Set (MWIS) problem and a scheduling problem which exhibits LoS properties in one dimension. We use the initial DP algorithm to develop an efficient polynomial time approximation scheme (EPTAS) for the MIS problem in restricted LoS networks. This has important作者: Abrade 時間: 2025-3-26 04:45 作者: 罵人有污點 時間: 2025-3-26 08:52
Collaborative Delivery by Energy-Sharing Low-Power Mobile Robots,that this problem is .-complete. In the second problem, the initial positions of the robots are not fixed but a subset of nodes . of the graph is given as input together with an integer ., and the question is as follows: is there a placement of . robots at nodes in . such that the delivery is possib作者: 恩惠 時間: 2025-3-26 15:02
Data Collection in Population Protocols with Non-uniformly Random Scheduler,ty (w.h.p.)..We further investigate the non-uniform model and address the important issue of energy consumption. The goal is to improve . in terms of energy complexity, while still keeping good time complexities (in expectation and w.h.p.). Namely, we propose a new parametrized protocol for data col作者: 華而不實 時間: 2025-3-26 19:47
Rendezvous on a Line by Location-Aware Robots Despite the Presence of Byzantine Faults,ed for such a rendezvous to occur under the assumption that the faulty robots are known at the start. We provide a bounded competitive ratio algorithm, where the central authority is informed only of the set of initial robot positions, without knowing which ones or how many of them are faulty. When 作者: 個人長篇演說 時間: 2025-3-27 00:33 作者: 內部 時間: 2025-3-27 04:30
Energy-Optimal Broadcast in a Tree with Mobile Agents,he number of leaves of .), then our approach results in an .(.) time algorithm..When the source of information . is initially at the root ., our algorithm solves the problem of searching the tree (exploring it) by a set of agents using minimal energy. It is known that, even if the tree is a line, th作者: induct 時間: 2025-3-27 09:12
Searching for a Non-adversarial, Uncooperative Agent on a Cycle,shown to be .. Moreover, for all . there exists a speed . such that any algorithm knowing neither the bus speed nor its direction will need time at least . to meet the bus..These results are also generalized to . robots and analogous tight upper and lower bounds are proved depending on the knowledge作者: 露天歷史劇 時間: 2025-3-27 12:39 作者: 生氣的邊緣 時間: 2025-3-27 14:18 作者: 拘留 時間: 2025-3-27 18:06
Independent Sets in Restricted Line of Sight Networks,ions of the Maximum Weighted Independent Set (MWIS) problem and a scheduling problem which exhibits LoS properties in one dimension. We use the initial DP algorithm to develop an efficient polynomial time approximation scheme (EPTAS) for the MIS problem in restricted LoS networks. This has important作者: grotto 時間: 2025-3-28 01:49
Braid Chain Radio Communication, braid chain of . layers the normalized delay due to anti-collision mechanism is . (while the expected time for a chain of single stations is .), where . stands for the time interval length of Cai-Lu-Wang scheme. We also show that the behavior of the braid chain rapidly converges to its stationary d作者: 孵卵器 時間: 2025-3-28 04:08
Der Weg zu Burnout-freien Arbeitsweltenrithm which solves the leader election problem in . asynchronous rounds with high probability, where . is the number of particles in the system. Our algorithm relies only on local information — particles do not have unique identifiers, any knowledge of ., or any sort of global coordinate system — and requires only constant memory per particle.作者: Communicate 時間: 2025-3-28 07:30
Gunter?R. K. Stahr Prof. Dr. Dr.edule, depending on .. We conducted a priori and a posteriori analysis of the accuracy of this algorithm for various . comparing either with the optimal length of the schedule, or with a lower bound, the value of which we improved.作者: Hangar 時間: 2025-3-28 13:50 作者: 蝕刻 時間: 2025-3-28 15:42
0302-9743 e, including sensor networks, sensor-actuator networks, autonomous robots. The focus is on the design and analysis of algorithms, models of computation, and experimental analysis..978-3-319-72750-9978-3-319-72751-6Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Ringworm 時間: 2025-3-28 21:16
Zur Theorie politischer Karrieren,we show that .-approximating the difference?. between the optimal solution cost and a natural lower bound is NP-hard and that there are presumably no exact algorithms running in .?time or in .?time for any computable function?..作者: ventilate 時間: 2025-3-28 23:39
https://doi.org/10.1007/978-3-531-91802-0r models, thus improving the best known (randomized) ratio of 1/4. Our algorithms make non-trivial use of the greedy approach of Buchbinder et al. (SIAM Journal Computing 44:1384–1402, 2015) for maximizing an unconstrained (non-monotone) submodular function, which may be of independent interest.作者: 巧思 時間: 2025-3-29 03:17
Gunter?R. K. Stahr Prof. Dr. Dr.we show that our algorithm solves the multiple door filling problem in .(.) time, as well. For the multiple door case, our algorithm is asymptotically worst-case optimal, and its running time is at most . times the running time of the optimal algorithm for any input, where . is the number of doors.作者: Inclement 時間: 2025-3-29 08:43
Parameterized Algorithms for Power-Efficient Connected Symmetric Wireless Sensor Networks,we show that .-approximating the difference?. between the optimal solution cost and a natural lower bound is NP-hard and that there are presumably no exact algorithms running in .?time or in .?time for any computable function?..作者: 一窩小鳥 時間: 2025-3-29 13:02
Fast Distributed Approximation for Max-Cut,r models, thus improving the best known (randomized) ratio of 1/4. Our algorithms make non-trivial use of the greedy approach of Buchbinder et al. (SIAM Journal Computing 44:1384–1402, 2015) for maximizing an unconstrained (non-monotone) submodular function, which may be of independent interest.作者: 技術 時間: 2025-3-29 19:15
Uniform Dispersal of Robots with Minimum Visibility Range,we show that our algorithm solves the multiple door filling problem in .(.) time, as well. For the multiple door case, our algorithm is asymptotically worst-case optimal, and its running time is at most . times the running time of the optimal algorithm for any input, where . is the number of doors.作者: 脊椎動物 時間: 2025-3-29 20:02
Conference proceedings 2017ENSORS 2017, held in Vienna, in September 2017..The 17 full papers presented in this volume were carefully reviewed and selected from 30 submissions. ALGOSENSORS is an international symposium dedicated to the algorithmic aspects of wireless networks. Originally focused on sensor networks, it now cov作者: nascent 時間: 2025-3-30 00:18
0302-9743 riments for Wireless Sensor Networks, ALGOSENSORS 2017, held in Vienna, in September 2017..The 17 full papers presented in this volume were carefully reviewed and selected from 30 submissions. ALGOSENSORS is an international symposium dedicated to the algorithmic aspects of wireless networks. Origin作者: 運氣 時間: 2025-3-30 07:07
Zur Theorie politischer Karrieren,r and all the sensors lie on . then the problem can be solved in . time. In 2D very little is known about the complexity of the problem..We consider the 2D setting and give a .-approximation algorithm when . contains a single barrier, or a set of parallel barriers. We also give an approximation algorithm for arbitrarily oriented disjoint barriers.作者: 愛管閑事 時間: 2025-3-30 10:31 作者: 滔滔不絕地說 時間: 2025-3-30 14:23
Improved Leader Election for Self-organizing Programmable Matter,rithm which solves the leader election problem in . asynchronous rounds with high probability, where . is the number of particles in the system. Our algorithm relies only on local information — particles do not have unique identifiers, any knowledge of ., or any sort of global coordinate system — and requires only constant memory per particle.作者: 后退 時間: 2025-3-30 18:48
Conflict-Free Data Aggregation on a Square Grid When Transmission Distance is Not Less Than 3,edule, depending on .. We conducted a priori and a posteriori analysis of the accuracy of this algorithm for various . comparing either with the optimal length of the schedule, or with a lower bound, the value of which we improved.作者: 褻瀆 時間: 2025-3-30 21:29
A Continuous Strategy for Collisionless Gathering, this class. Our second result is about collisions in such strategies. We present a contracting strategy which ensures that no collisions occur. This strategy needs the robots to have some additional capabilities.作者: 財主 時間: 2025-3-31 02:46 作者: VEN 時間: 2025-3-31 08:38 作者: 男學院 時間: 2025-3-31 12:47 作者: ORBIT 時間: 2025-3-31 16:25
Zur Theorie politischer Karrieren,n edge-weighted .-vertex graph, find a connected spanning subgraph of minimum cost, where the cost is determined by letting each vertex pay the most expensive edge incident to it in the subgraph. We provide an algorithm that works in polynomial time if one can find a set of obligatory edges that yie作者: 畸形 時間: 2025-3-31 18:29 作者: Deceit 時間: 2025-3-31 21:52 作者: rectum 時間: 2025-4-1 03:55 作者: cauda-equina 時間: 2025-4-1 08:47
