MAXIMIZATION

作品数：204被引量：172H指数：5
导出分析报告
相关领域：自动化与计算机技术更多>>
相关作者：王佳丁洁丽官小平郭小卫王宏琦更多>>
相关机构：武汉大学清华大学北京东方泰坦科技股份有限公司中国科学院研究生院更多>>
相关期刊：更多>>
相关基金：国家自然科学基金国家重点基础研究发展计划国家高技术研究发展计划高等学校学科创新引智计划更多>>
-
在结果中检索

检索结果分析

结果分析中...
选择条件：
  • 期刊=Tsinghua Science and Technologyx
共 条 记 录，以下是1-9
全选清除导出
参考文献引证文献引用追踪
视图：
排序：
Maximization of k-Submodular Function with d-Knapsack Constraints Over Sliding Window
《Tsinghua Science and Technology》2025年第2期488-498,共11页Wenqi Wang Yuefang Sun Zhiren Sun Donglei Du Xiaoyan Zhang 
supported by the National Natural Science Foundation of China(Nos.12271259 and 12371352);the Zhejiang Provincial Natural Science Foundation of China(No.LY23A010011);the Yongjiang Talent Introduction Programme of Ningbo(No.2021B-011-G);the Natural Sciences and Engineering Research Council of Canada(NSERC)(No.06446).
Submodular function maximization problem has been extensively studied recently.A natural variant of submodular function is k-submodular function,which has many applications in real life,such as influence maximization ...
关键词：k-submodular function d-knapsack constraints sliding window streaming algorithm approximation algorithm 
Approximation Algorithms for Maximization of k-Submodular Function Under a Matroid Constraint
《Tsinghua Science and Technology》2024年第6期1633-1641,共9页Yuezhu Liu Yunjing Sun Min Li 
supported by the Natural Science Foundation of Shandong Province of China(No.ZR2020MA029).
In this paper,we design a deterministic 1/3-approximation algorithm for the problem of maximizing non-monotone k-submodular function under a matroid constraint.In order to reduce the complexity of this algorithm,we al...
关键词：k-submodular matroid constraint deterministic algorithm randomized algorithm streaming algorithm 
Two-Stage Submodular Maximization Under Knapsack Problem
《Tsinghua Science and Technology》2024年第6期1703-1708,共6页Zhicheng Liu Jing Jin Donglei Du Xiaoyan Zhang 
supported by the National Natural Science Foundation of China(Nos.12131003,12271259,11371001,11771386,and 11728104);the Natural Sciences and Engineering Research Council of Canada(NSERC)(No.06446);the Natural Science Foundation of Jiangsu Province(No.BK20200267);Qinglan Project.
Two-stage submodular maximization problem under cardinality constraint has been widely studied in machine learning and combinatorial optimization.In this paper,we consider knapsack constraint.In this problem,we give n...
关键词：submodular function knapsack constraint MATROID 
Multipass Streaming Algorithms for Regularized Submodular Maximization
《Tsinghua Science and Technology》2024年第1期76-85,共10页Qinqin Gong Suixiang Gao Fengmin Wang Ruiqi Yang 
This work was supported by the Beijing Natural Science Foundation Project(No.Z220004);the National Natural Science Foundation of China(Nos.11901544 and 12101587);the China Postdoctoral Science Foundation(No.2022M720329).
In this work,we study a k-Cardinality Constrained Regularized Submodular Maximization(k-CCRSM)problem,in which the objective utility is expressed as the difference between a non-negative submodular and a modular funct...
关键词：submodular optimization regularized model streaming algorithms THRESHOLD 
k-Submodular Maximization with a Knapsack Constraint and p Matroid Constraints
《Tsinghua Science and Technology》2023年第5期896-905,共10页Qian Liu Kemin Yu Min Li Yang Zhou 
supported by the Natural Science Foundation of Shandong Province of China(Nos.ZR2020MA029,ZR2021MA100);the National Natural Science Foundation of China(No.12001335).
A k-submodular function is a generalization of a submodular function,its definition domain is extended from the collection of single subsets to the collection of k disjoint subsets.The k-submodular maximization proble...
关键词：k-submodularity knapsack constraint matroid constraint approximation algorithm 
Approximating(mB,mP)-Monotone BP Maximization and Extensions
《Tsinghua Science and Technology》2023年第5期906-915,共10页Ruiqi Yang Suixiang Gao Lu Han Gaidi Li Zhongrui Zhao 
supported by the National Natural Science Foundation of China(No.12101587);the China Postdoctoral Science Foundation(No.2022M720329);the National Natural Science Foundation of China(No.12001523);the Beijing Natural Science Foundation Project(No.Z200002);the National Natural Science Foundation of China(No.12131003).
The paper proposes the optimization problem of maximizing the sum of suBmodular and suPermodular(BP)functions with partial monotonicity under a streaming fashion.In this model,elements are randomly released from the s...
关键词：submodular maximization streaming model threshold technique approximation algorithm 
Efficient Algorithms for Maximizing Group Influence in Social Networks
《Tsinghua Science and Technology》2022年第5期832-842,共11页Peihuang Huang Longkun Guo Yuting Zhong 
supported by the Natural Science Foundation of Fujian Province (No. 2020J01845);the Educational Research Project for Young and MiddleAged Teachers of Fujian Provincial Department of Education (No. JAT190613);the National Natural Science Foundation of China (Nos. 61772005 and 92067108);the Outstanding Youth Innovation Team Project for Universities of Shandong Province (No. 2020KJN008)。
In social network applications,individual opinion is often influenced by groups,and most decisions usually reflect the majority’s opinions.This imposes the group influence maximization(GIM) problem that selects k ini...
关键词：complementary maximum coverage(CMC) improved reverse influence sampling(IRIS) group influence maximization(GIM) independent cascade(IC)model 
Approximating Special Social Influence Maximization Problems被引量：6
《Tsinghua Science and Technology》2020年第6期703-711,共9页Jie Wu Ning Wang 
the National Science Foundation(NSF)grants Computer and Network Systems(CNS)1824440,CNS 1828363,CNS 1757533,CNS 1618398,CNS 1651947,and CNS 1564128。
Social Influence Maximization Problems(SIMPs)deal with selecting k seeds in a given Online Social Network(OSN)to maximize the number of eventually-influenced users.This is done by using these seeds based on a given se...
关键词：influence maximization online social networks submodular function 
Using Folding Ensemble and Stem Probability Maximization Methods to Predict RNA H-Type Pseudoknots
《Tsinghua Science and Technology》2012年第6期691-700,共10页Junilda Spirollari Shawn Xiong Wang Jason T.L. Wang 
We present in this paper an ab initio method, named KnotFold, for RNA H-type pseudoknot prediction. Our method employs an ensemble of RNA folding tools and a filtering heuristic to generate a set of pseudoknot-free st...
关键词：RNA structure PSEUDOKNOTS tool ensemble 
全选清除导出
共1页<1>
检索报告 对象比较 聚类工具 使用帮助 返回顶部