群居动物 发表于 2025-3-28 17:56:57
César A. M. Marcon,José C. S. Palma,Ney L. V. Calazans,Fernando G. Moraes,Altamiro A. Susin,Ricardo.-neighborhood graphs..We also give a general technique for transforming a class of expected time randomized incremental algorithms that use random sampling into incremental algorithms with high likelihood time bounds. In particular, we show how we can maintain separators in time .(log..) with high likelihood.DUST 发表于 2025-3-28 21:41:19
http://reply.papertrans.cn/99/9840/983990/983990_42.png入会 发表于 2025-3-29 02:50:08
Achraf Dhayni,Salvador Mir,Libor Rufer,Ahcène Bounceurdding a new vertex . for each vertex . of . and joining . to the neighbors of . in .. In this paper, we study the geodetic and hull numbers of shadow graphs. Bounds for the geodetic and hull numbers of shadow graphs are obtained and for several classes exact values are determined. Graphs . for which . are characterized.Gene408 发表于 2025-3-29 03:24:48
Caronte: A methodology for the Implementation of Partially dynamically Self-Reconfiguring Systems o In order to meet the software requirements of complex systems, the solution is provided with a porting of a real–time gnu/Linux os, μCLinux, which allows software processes to exploit a rich set of features, and with a Linux module that simplifies and enhances the handling of reconfiguration.护身符 发表于 2025-3-29 09:33:13
http://reply.papertrans.cn/99/9840/983990/983990_45.pngthyroid-hormone 发表于 2025-3-29 13:18:18
Paul Franzon,David Nackashi,Christian Amsinck,Neil DiSpigna,Sachin Sonkusaledel, where each robot is equipped with an externally visible light that can assume colors from a fixed set of colors, using 9 colors and .(.) rounds. In this work, we present an algorithm that requires only 2 colors and .(.) rounds. The number of colors is optimal since at least two colors are required for point robots [.].轻快带来危险 发表于 2025-3-29 18:30:47
Markus Koester,Heiko Kalte,Mario Porrmann,Ulrich Rückertn that done by the best possible sequential one; and (iii) a model of computation is introduced which is an extension of the strongest variant of the PRAM, yet it requires no more resources than its weakest variant.Barrister 发表于 2025-3-29 20:10:17
http://reply.papertrans.cn/99/9840/983990/983990_48.pngLittle 发表于 2025-3-30 00:17:56
http://reply.papertrans.cn/99/9840/983990/983990_49.pngcommensurate 发表于 2025-3-30 04:12:42
http://reply.papertrans.cn/99/9840/983990/983990_50.png