找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Computational Data and Social Networks; 8th International Co Andrea Tagarelli,Hanghang Tong Conference proceedings 2019 Springer Nature Swi

[复制链接]
楼主: 凝固
发表于 2025-3-25 04:19:05 | 显示全部楼层
发表于 2025-3-25 10:44:08 | 显示全部楼层
发表于 2025-3-25 12:45:33 | 显示全部楼层
发表于 2025-3-25 18:29:11 | 显示全部楼层
发表于 2025-3-25 23:53:28 | 显示全部楼层
发表于 2025-3-26 00:21:33 | 显示全部楼层
发表于 2025-3-26 05:20:37 | 显示全部楼层
Profit Maximization Under Group Influence Model in Social Networkshard and the objective function is neither submodular nor supermodular. We develop an upper bound and a lower bound that both are difference of two submodular functions. Then we design an Submodular-Modular Algorithm (SMA) for solving difference of submodular functions and SMA is proved to converge
发表于 2025-3-26 12:29:56 | 显示全部楼层
Zahlensysteme und das Klassenzahl-Problem,on ratio guarantee can be computed. Extensive experiments are conducted on different types of real-world graphs and synthetic graphs. The results illustrate that the proposed algorithms exhibit good efficiency, stability and scalability.
发表于 2025-3-26 16:31:15 | 显示全部楼层
发表于 2025-3-26 19:46:17 | 显示全部楼层
V. C. Jordan,C. J. Dix,G. Prestwichhard and the objective function is neither submodular nor supermodular. We develop an upper bound and a lower bound that both are difference of two submodular functions. Then we design an Submodular-Modular Algorithm (SMA) for solving difference of submodular functions and SMA is proved to converge
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-7-3 21:00
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表