找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: VLSI-SoC: From Systems to Silicon; IFIP TC10/ WG 10.5 T Ricardo Reis,Adam Osseiran,Hans-Joerg Pfleiderer Conference proceedings 2007 IFIP I

[复制链接]
楼主: Reagan
发表于 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.
发表于 2025-3-28 21:41:19 | 显示全部楼层
发表于 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.
发表于 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 | 显示全部楼层
发表于 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.
发表于 2025-3-29 20:10:17 | 显示全部楼层
发表于 2025-3-30 00:17:56 | 显示全部楼层
发表于 2025-3-30 04:12:42 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-6 11:06
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表