国家科技图书文献中心 杭州服务站
首页
资源导航
特色服务
知识发现
关于我们
检索
代查代借

检索历史
浏览历史

订阅
收藏
0 申请单

个人中心
账号设置
充值
全部 |
  • 全部
  • 题名
  • 作者
  • 机构
  • 关键词
  • NSTL主题词
  • 摘要
检索 二次检索 AI检索
高级检索
外文文献 中文文献
筛选条件：

共搜索到35条信息
?

1. On the Min-Max Star Partitioning Number NSTL国家科技图书文献中心

Sarah Feldmann |  Torben Schurenberg -  《Algorithmics of Wireless Networks》 -  International Symposium on Algorithmics of Wireless Networks - 2025, - 61～75 - 共15页

摘要：In this paper, we introduce a novel star |  partitioning problem for simple connected graphs G = (V, E | ). The goal is to find a partition of the edges into |  stars that minimizes the maximum number of stars a |  node is contained in while simultaneously satisfying
关键词： Edge coloring |  Edge orientation |  Max-flow |  Min-max objective |  Star partitioning
文献传递获取全文
文献传递
收藏

2. Decreasing Verification Radius in Local Certification NSTL国家科技图书文献中心

Laurent Feuilloley |  Jan Janousek... -  《Algorithmics of Wireless Networks》 -  International Symposium on Algorithmics of Wireless Networks - 2025, - 188～201 - 共14页

摘要：This paper deals with local certification | , specifically locally checkable proofs: given a graph property | , the task is to certify whether a graph satisfies the |  property. The verification of this certification needs to |  be done locally without the knowledge of the whole
关键词： Local certification |  Locally checkable proofs |  Proof-labeling schemes |  Graphs |  Distributed computing |  Self-stabilization
文献传递获取全文
文献传递
收藏

3. The Threshold of Existence of δ-Temporal Cliques in Random Simple Temporal Graphs NSTL国家科技图书文献中心

George B. Mertzios |  Sotiris Nikoletseas... -  《Algorithmics of Wireless Networks》 -  International Symposium on Algorithmics of Wireless Networks - 2025, - 131～143 - 共13页

摘要：We consider random simple temporal graphs in |  which every edge of the complete graph K_n appears |  once within the time interval [0, 1] independently |  and uniformly at random. Our main result is a sharp |  threshold on the size of any maximum δ-clique (namely a
关键词： Simple random temporal graph |  δ-temporal clique |  Probabilistic method
文献传递获取全文
文献传递
收藏

4. The Exact Spanning Ratio of the Parallelogram Delaunay Graph NSTL国家科技图书文献中心

Prosenjit Bose |  Jean-Lou De Carufel... -  《Algorithmics of Wireless Networks》 -  International Symposium on Algorithmics of Wireless Networks - 2025, - 144～158 - 共15页

摘要：Finding the exact spanning ratio of a Delaunay |  graph has been one of the longstanding open problems |  in Computational Geometry. Currently there are only |  four convex shapes for which the exact spanning ratio |  of their Delaunay graph is known: the equilateral
关键词： Geometric spanner |  Delaunay graph |  Spanning ratio
文献传递获取全文
文献传递
收藏

5. Optimizing Robot Dispersion on Unoriented Grids: With and Without Fault Tolerance NSTL国家科技图书文献中心

Rik Banerjee |  Manish Kumar... -  《Algorithmics of Wireless Networks》 -  International Symposium on Algorithmics of Wireless Networks - 2025, - 31～45 - 共15页

摘要：The introduction and study of dispersing |  mobile robots across the nodes of an anonymous graph |  have recently gained traction and have been explored |  within various graph classes and settings. While |  optimal dispersion solution was established for oriented
关键词： Mobile agents |  Mobile robots |  Grid graph |  Mess network |  Crash-fault robots |  Robot's dispersion |  Distributed algorithm
文献传递获取全文
文献传递
收藏

6. Collision Detection for Modular Robots - It Is Easy to Cause Collisions and Hard to Avoid Them NSTL国家科技图书文献中心

Siddharth Gupta |  Marc van Kreveld... -  《Algorithmics of Wireless Networks》 -  International Symposium on Algorithmics of Wireless Networks - 2025, - 76～90 - 共15页

摘要：We consider geometric collision-detection |  problems for modular reconfigurable robots. Assuming the |  nodes (modules) are connected squares on a grid, we |  investigate the complexity of deciding whether collisions |  may occur, or can be avoided, if a set of expansion
关键词： Modular robots |  Collision detection |  Computational geometry |  Complexity
文献传递获取全文
文献传递
收藏

7. Reconfigurable Routing in Data Center Networks NSTL国家科技图书文献中心

David C. Kutner |  Iain A. Stewart -  《Algorithmics of Wireless Networks》 -  International Symposium on Algorithmics of Wireless Networks - 2025, - 117～130 - 共14页

摘要：A hybrid network is a static (electronic | ) network that is augmented with optical switches. The |  Reconfigurable Routing Problem (RRP) in hybrid networks is the |  problem of finding settings for the optical switches |  augmenting a static network so as to achieve optimal
关键词： Algorithms |  Complexity |  Reconfigurable topologies |  Optical circuit switches |  Software-defined networking
文献传递获取全文
文献传递
收藏

8. Modular Population Protocols NSTL国家科技图书文献中心

Michael Raskin -  《Algorithmics of Wireless Networks》 -  International Symposium on Algorithmics of Wireless Networks - 2025, - 173～187 - 共15页

摘要：Population protocols are a model of |  distributed computation intended for the study of networks |  of independent computing agents with dynamic |  communication structure. Each agent has a finite number of |  states, and communication opportunities occur
关键词： Population protocols |  Protocol verification |  Modularity
文献传递获取全文
文献传递
收藏

9. Bike Assisted Evacuation on a Line of Robots with S/R Communication Faults NSTL国家科技图书文献中心

Khaled Jawhar |  Evangelos Kranakis -  《Algorithmics of Wireless Networks》 -  International Symposium on Algorithmics of Wireless Networks - 2025, - 91～105 - 共15页

摘要：Two autonomous mobile robots and a non | -autonomous one, also called bike, are placed at the origin |  of an infinite line. The autonomous robots can |  travel with maximum speed 1. When a robot rides the |  bike its speed increases to v > 1, however only
关键词： Faults |  Line |  Robots |  Search |  Receiver |  Sender |  S/R communication model
文献传递获取全文
文献传递
收藏

10. On the Exponential Growth of Geometric Shapes NSTL国家科技图书文献中心

Nada Almalki |  Siddharth Gupta... -  《Algorithmics of Wireless Networks》 -  International Symposium on Algorithmics of Wireless Networks - 2025, - 16～30 - 共15页

摘要：In this paper, we explore the exponential |  growth of geometric structures starting from a single |  node, focusing on centralized growth operations. We |  identify a parameter k, representing the number of |  turning points within specific parts of a shape. We
关键词： Centralized algorithm |  Growth process |  Collision |  Programmable matter
文献传递获取全文
文献传递
收藏

相关推荐

检索结果集分析
检索结果集分析
结构化综述分析
检索条件出处：Algorithmics of Wireless Networks

NSTL主题词

  • NSTL学科导航

服务站

成员单位

友情链接

NSTL官方微信

官方微信

NSTL安卓APP

安卓APP

服务热线：

4008-161-200 800-990-8900

国家科技图书文献中心

国家科技图书文献中心

京ICP备10027328号

© Copyright(C)2023 NSTL.All Rights Reserved 版权所有

杭州服务站

0571-85112211；0571-85058943zj85112211@163.com

地址：浙江省杭州市滨江区信诚路572号 科技大市场A座318室

页面总访问量：32579360