找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Structural Information and Communication Complexity; 28th International C Tomasz Jurdziński,Stefan Schmid Conference proceedings 2021 Sprin

[复制链接]
楼主: Destruct
发表于 2025-3-23 13:26:23 | 显示全部楼层
发表于 2025-3-23 16:20:27 | 显示全部楼层
发表于 2025-3-23 21:10:21 | 显示全部楼层
发表于 2025-3-24 01:42:57 | 显示全部楼层
Wait-Free Approximate Agreement on Graphscate by reading and writing to shared memory. In this work, we consider a natural generalisation of approximate agreement on arbitrary undirected connected graphs. Each process is given a vertex of the graph as input and, if non-faulty, must output a vertex such that.From prior work, it is known tha
发表于 2025-3-24 06:00:27 | 显示全部楼层
Fragmented Objects: Boosting Concurrency of Shared Large Objectsmaintaining strong consistency guarantees, and ensuring good operation performance. To this respect, we define the notion of . concurrent objects composed of a list of fragments (or .) that allow operations to manipulate each of their fragments individually. As the fragments belong to the same objec
发表于 2025-3-24 07:21:51 | 显示全部楼层
发表于 2025-3-24 11:16:52 | 显示全部楼层
发表于 2025-3-24 16:22:16 | 显示全部楼层
New Approximation Algorithms for the Heterogeneous Weighted Delivery Problemositioned on vertices of an .-vertex edge-weighted graph ., have to deliver . messages. Each message is initially placed on a source vertex of . and needs to be delivered to a target vertex of .. Each agent can move along the edges of . and carry at most one message at any time. Each agent has a rat
发表于 2025-3-24 21:42:06 | 显示全部楼层
Graph Exploration by Energy-Sharing Mobile Agents energy transfers. The agents are initially placed at an arbitrary subset of nodes in the graph, and each agent has an initial, possibly different, amount of energy. The goal of the exploration problem is for every edge in the graph to be traversed by at least one agent. The amount of energy used by
发表于 2025-3-25 00:50:03 | 显示全部楼层
Two-Agent Tree Evacuationd at the same starting node; they explore the graph until one of them finds the exit through which they can evacuate. The task is to minimize the time it takes until . agents evacuate, for a . placement of the exit. We consider two communication models, . where the agents can communicate at any time
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-7 03:04
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表