咨询与建议

限定检索结果

文献类型

  • 115 篇 期刊文献
  • 64 篇 会议
  • 1 篇 学位论文

馆藏范围

  • 180 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 139 篇 工学
    • 107 篇 计算机科学与技术...
    • 42 篇 电气工程
    • 24 篇 信息与通信工程
    • 18 篇 软件工程
    • 17 篇 控制科学与工程
    • 9 篇 机械工程
    • 5 篇 电子科学与技术(可...
    • 4 篇 仪器科学与技术
    • 3 篇 材料科学与工程(可...
    • 2 篇 交通运输工程
    • 1 篇 冶金工程
    • 1 篇 动力工程及工程热...
    • 1 篇 测绘科学与技术
    • 1 篇 航空宇航科学与技...
    • 1 篇 生物工程
  • 44 篇 理学
    • 33 篇 数学
    • 4 篇 生物学
    • 4 篇 统计学(可授理学、...
    • 3 篇 物理学
    • 3 篇 化学
    • 3 篇 系统科学
  • 41 篇 管理学
    • 37 篇 管理科学与工程(可...
    • 4 篇 工商管理
    • 3 篇 图书情报与档案管...
    • 1 篇 公共管理
  • 6 篇 经济学
    • 5 篇 应用经济学
  • 4 篇 医学
    • 2 篇 临床医学
    • 1 篇 公共卫生与预防医...
  • 1 篇 哲学
  • 1 篇 法学
    • 1 篇 法学
  • 1 篇 教育学
    • 1 篇 心理学(可授教育学...
  • 1 篇 军事学
  • 1 篇 艺术学

主题

  • 180 篇 approximate algo...
  • 9 篇 optimization
  • 8 篇 minimum enclosin...
  • 7 篇 exact algorithm
  • 5 篇 kernel methods
  • 5 篇 dynamic programm...
  • 4 篇 submodular
  • 4 篇 support vector m...
  • 4 篇 approximation al...
  • 4 篇 support vector m...
  • 3 篇 social network a...
  • 3 篇 core sets
  • 3 篇 computational ge...
  • 3 篇 social networks
  • 3 篇 betweenness cent...
  • 3 篇 heuristics
  • 3 篇 iterative learni...
  • 3 篇 directed graphs
  • 3 篇 motif discovery
  • 3 篇 optimal control

机构

  • 3 篇 zhengzhou inst a...
  • 3 篇 southwest jiaoto...
  • 3 篇 xidian univ stat...
  • 3 篇 hong kong univ s...
  • 2 篇 georgia state un...
  • 2 篇 college of infor...
  • 2 篇 department of co...
  • 2 篇 beijing normal u...
  • 2 篇 univ technol syd...
  • 2 篇 univ hong kong d...
  • 2 篇 univ paris sacla...
  • 2 篇 china jiliang un...
  • 2 篇 suny stony brook...
  • 2 篇 xidian univ sch ...
  • 2 篇 telecom paris ip...
  • 2 篇 shanghai jiao to...
  • 2 篇 univ new brunswi...
  • 2 篇 jiangxi univ fin...
  • 2 篇 beijing institut...
  • 2 篇 xidian univ sch ...

作者

  • 4 篇 zheng danyang
  • 4 篇 bifet albert
  • 4 篇 abdessalem talel
  • 4 篇 wang yongqing
  • 4 篇 wang meng
  • 4 篇 cui jiangtao
  • 4 篇 li hui
  • 4 篇 chehreghani most...
  • 4 篇 cao xiaojun
  • 3 篇 chen lei
  • 3 篇 xu hong-wei
  • 2 篇 liu bo
  • 2 篇 yongqing wang
  • 2 篇 zhang xudong
  • 2 篇 li dan
  • 2 篇 soh sieteng
  • 2 篇 liu xiaorong
  • 2 篇 chang liang
  • 2 篇 guoren wang
  • 2 篇 liu lei

语言

  • 171 篇 英文
  • 8 篇 其他
  • 1 篇 德文
  • 1 篇 法文
  • 1 篇 意大利文
  • 1 篇 中文
检索条件"主题词=approximate algorithm"
180 条 记 录,以下是31-40 订阅
An approximation algorithm for K-best enumeration of minimal connected edge dominating sets with cardinality constraints
收藏 引用
THEORETICAL COMPUTER SCIENCE 2024年 1005卷
作者: Kurita, Kazuhiro Wasa, Kunihiro Nagoya Univ Nagoya Japan Hosei Univ Tokyo Japan
K -best enumeration , which asks to output k -best solutions without duplication, is a helpful tool in data analysis for many fields. In such fields, graphs typically represent data. Thus subgraph enumeration has been... 详细信息
来源: 评论
Bunkering policies for a fuel bunker management problem for liner shipping networks
收藏 引用
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2021年 第3期289卷 927-939页
作者: De, Arijit Choudhary, Alok Turkay, Metin Tiwari, Manoj K. Newcastle Univ Business Sch Newcastle Upon Tyne NE1 4SE Tyne & Wear England Loughborough Univ Sch Business & Econ Loughborough LE11 3TU Leics England Koc Univ Dept Ind Engn Rumelifeneri Yolu TR-34450 Istanbul Turkey Indian Inst Technol Kharagpur Dept Ind & Syst Engn Kharagpur 721302 W Bengal India
This paper investigates the problem of bunker fuel management for liner shipping networks under different fuel pricing scenarios and taking into consideration different fuel bunkering policies. The fuel consumption of... 详细信息
来源: 评论
Influential facilities placement over moving objects
收藏 引用
DISTRIBUTED AND PARALLEL DATABASES 2021年 第3期39卷 607-636页
作者: Zhou, Ying Li, Hui Li, Dan Wang, Meng Cui, Jiangtao Xidian Univ State Key Lab Integrated Serv Networks Xian Peoples R China Xidian Univ Sch Cyber Engn Xian Peoples R China Xian Polytech Univ Sch Comp Sci Xian Peoples R China Xidian Univ Sch Comp Sci & Technol Xian Peoples R China
In this paper we propose and study the problem ofk-Collective influential facility placement over moving object. Specifically, given a set of candidate locations, a group of moving objects, each of which is associated... 详细信息
来源: 评论
An Approximation algorithm for Unrelated Parallel Machine Scheduling Under TOU Electricity Tariffs
收藏 引用
IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING 2021年 第2期18卷 743-756页
作者: Pei, Zhi Wan, Mingzhong Jiang, Zhong-Zhong Wang, Ziteng Dai, Xu Zhejiang Univ Technol Coll Mech Engn Hangzhou 310023 Peoples R China Northeastern Univ Sch Business Adm Shenyang 110167 Peoples R China Northeastern Univ Inst Behav & Serv Operat Management Shenyang 110167 Peoples R China Northeastern Univ Key Lab Data Analyt & Optimizat Smart Ind Minist Educ Shenyang 110167 Peoples R China Northern Illinois Univ Dept Ind & Syst Engn De Kalb IL 60115 USA
In an era of sustainable development, considerable emphasis has been put onto energy saving, environment friendly, and social welfare as well as productivity in the manufacturing sector. In this work, an unrelated par... 详细信息
来源: 评论
Event-Participant and Incremental Planning over Event-Based Social Networks
收藏 引用
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 2021年 第2期33卷 474-488页
作者: Cheng, Yurong Yuan, Ye Chen, Lei Giraud-Carrier, Christophe Wang, Guoren Li, Boyang Sch Comp Sci & Technol Beijing Inst Technol Beijing 100811 Peoples R China Northeastern Univ Sch Comp Sci & Engn Qinhuangdao 066004 Hebei Peoples R China Hong Kong Univ Sci & Technol Dept Comp Sci & Engn Hong Kong Peoples R China Brigham Young Univ Dept Comp Sci Provo UT 84602 USA
In recent years, online Event Based Social Network (EBSN) platforms have become increasingly popular. One typical task of EBSN platforms is to help users make suitable and personalized plans for participating in diffe... 详细信息
来源: 评论
Distributed Fair k-Center Clustering Problems with Outliers  22nd
Distributed Fair k-Center Clustering Problems with Outliers
收藏 引用
22nd International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT 2021)
作者: Yuan, Fan Diao, Luhong Du, Donglei Liu, Lei Beijing Univ Technol Dept Operat Res & Informat Engn Beijing 100124 Peoples R China Univ New Brunswick Fac Management Fredericton NB E3B 5A3 Canada
Big data clustering is a fundamental problem with a vast number of applications. Due to the increasing size of data, interests in clustering problems in distributed computation models have increased. On the other hand... 详细信息
来源: 评论
Maximizing Range Sum in Trajectory Data  38
Maximizing Range Sum in Trajectory Data
收藏 引用
38th IEEE International Conference on Data Engineering (ICDE)
作者: Zhang, Kaiqi Gao, Hong Han, Xixian Chen, Jian Li, Jianzhong Harbin Inst Technol Sch Comp Sci Harbin Peoples R China Chinese Acad Sci Shenzhen Inst Adv Technol Fac Comp Sci & Control Engn Shenzhen Peoples R China
Maximizing Range Sum (MaxRS) query is a basic operation in computational geometry and database communities. Given a set of weighted objects in 2-dimensional space and a rectangle, MaxRS query aims to find an optimal p... 详细信息
来源: 评论
Efficient and Provable Effective Resistance Computation on Large Graphs: An Index-based Approach
收藏 引用
Proceedings of the ACM on Management of Data 2024年 第3期2卷 1-27页
作者: Meihao Liao Junjie Zhou Rong-Hua Li Qiangqiang Dai Hongyang Chen Guoren Wang Beijing Institute of Technology Beijing China Beijing Institude of technology Beijing China Zhejiang Lab Zhejiang China
Effective resistance (ER) is a fundamental metric for measuring node similarities in a graph, and it finds applications in various domains including graph clustering, recommendation systems, link prediction, and graph... 详细信息
来源: 评论
Finding shortest gentle paths on polyhedral terrains by the method of multiple shooting
收藏 引用
JOURNAL OF COMPUTATIONAL SCIENCE 2023年 67卷
作者: An, Phan Thanh Le, Nguyen Thi Trang, Le Hong Wong, Raymond Chi-Wing Ho Chi Minh City Univ Technol HCMUT IMACS Inst Math & Computat Sci 268 Ly Thuong Kiet StDist 10 Ho Chi Minh City Vietnam Ho Chi Minh City Univ Technol HCMUT Fac Appl Sci 268 Ly Thuong Kiet StDist 10 Ho Chi Minh City Vietnam Vietnam Natl Univ Ho Chi Minh City Linh Trung Ward Ho Chi Minh City Vietnam Vietnam Acad Sci & Technol VAST Inst Math 18 Hoang Quoc Viet Rd Hanoi Vietnam Hong Kong Univ Sci & Technol Dept Comp Sci & Engn Hong Kong Peoples R China
The problem of finding shortest 0-gentle paths can be stated as follows: given two points p, q on a polyhedral terrain and a slope parameter 0 e (0, n /2), the objective is to find a path joining p and q on the terrai... 详细信息
来源: 评论
Efficient Resistance Distance Computation: The Power of Landmark-based Approaches
收藏 引用
Proceedings of the ACM on Management of Data 2023年 第1期1卷 1-27页
作者: Meihao Liao Rong-Hua Li Qiangqiang Dai Hongyang Chen Hongchao Qin Guoren Wang Beijing Institute of Technology Beijing China Beijing Institute of Technology Zhejiang China
Resistance distance is a fundamental metric to measure the similarity between two nodes in graphs which has been widely used in many real-world applications. In this paper, we study two problems on approximately compu... 详细信息
来源: 评论