CLAIM
发表于 2025-3-23 12:08:04
https://doi.org/10.1007/978-3-030-61033-3 when this online algorithm is compared with a clairvoyant algorithm achieving the best total value. In this paper, we study a simple and intuitive online algorithm. We analyze its performance in terms of competitive ratio for the general model and a few important variants.
向宇宙
发表于 2025-3-23 14:02:05
Stories and Conversations in the Smart City, energy cost and access time into consideration to schedule the data retrieval process in multi-channel environments. It can be used in almost any broadcast environment, in which the data access frequencies, data sizes, and channel bandwidths can all be non-uniform.
Catheter
发表于 2025-3-23 19:05:56
Harish Karnatak,Kamal Pandey,V. Raghavaswamyrational probability while all nodes are immune to failures. We first design a complementary dynamic programming algorithm and then develop a parallel algorithm based on the underlying tree for finding an MRS on the network.
Chameleon
发表于 2025-3-24 00:29:07
http://reply.papertrans.cn/23/2300/229978/229978_14.png
轻而薄
发表于 2025-3-24 02:44:45
Catherine Crago Blanton,Walt TrybulaG algorithm, we propose an approximation algorithm. We also propose a heuristic algorithm for this special case. For the general case that each node has multiple power levels, we propose a general algorithm NF-MEM-R-G and an approximation algorithm based on NF-MEM-R-G algorithm. We also propose a heuristic algorithm for general case.
backdrop
发表于 2025-3-24 08:45:36
http://reply.papertrans.cn/23/2300/229978/229978_16.png
Watemelon
发表于 2025-3-24 12:30:01
http://reply.papertrans.cn/23/2300/229978/229978_17.png
偶然
发表于 2025-3-24 17:38:29
A Fast Parallel Algorithm for Finding a Most Reliable Source on a General Ring-Tree Graph with Unrerational probability while all nodes are immune to failures. We first design a complementary dynamic programming algorithm and then develop a parallel algorithm based on the underlying tree for finding an MRS on the network.
intertwine
发表于 2025-3-24 21:39:21
Restricted Edge Connectivity of Harary Graphs,nduced by .. A graph . is called ..-optimal if ..(.) = ..(.). A natural question is whether there exists a graph . which is ..-optimal for any . ≤ |.(.)|/2. In this paper, we show that except for two cases, the Harary graph has this property.
IVORY
发表于 2025-3-25 01:00:53
Approximation Algorithms for Minimum Energy Multicast Routing with Reception Cost in Wireless SensoG algorithm, we propose an approximation algorithm. We also propose a heuristic algorithm for this special case. For the general case that each node has multiple power levels, we propose a general algorithm NF-MEM-R-G and an approximation algorithm based on NF-MEM-R-G algorithm. We also propose a heuristic algorithm for general case.