咨询与建议

限定检索结果

文献类型

  • 22,768 篇 会议
  • 9,045 篇 期刊文献
  • 64 篇 学位论文
  • 1 册 图书

馆藏范围

  • 31,878 篇 电子文献
  • 1 种 纸本馆藏

日期分布

学科分类号

  • 15,921 篇 工学
    • 10,032 篇 计算机科学与技术...
    • 4,845 篇 电气工程
    • 3,065 篇 软件工程
    • 2,672 篇 信息与通信工程
    • 1,947 篇 控制科学与工程
    • 738 篇 机械工程
    • 679 篇 电子科学与技术(可...
    • 605 篇 航空宇航科学与技...
    • 532 篇 仪器科学与技术
    • 230 篇 交通运输工程
    • 215 篇 材料科学与工程(可...
    • 195 篇 化学工程与技术
    • 171 篇 生物工程
    • 144 篇 测绘科学与技术
    • 134 篇 动力工程及工程热...
    • 134 篇 生物医学工程(可授...
    • 130 篇 土木工程
  • 10,399 篇 理学
    • 9,342 篇 数学
    • 869 篇 物理学
    • 766 篇 系统科学
    • 737 篇 统计学(可授理学、...
    • 264 篇 生物学
    • 236 篇 化学
  • 2,477 篇 管理学
    • 1,925 篇 管理科学与工程(可...
    • 671 篇 工商管理
    • 547 篇 图书情报与档案管...
  • 417 篇 经济学
    • 386 篇 应用经济学
  • 206 篇 医学
    • 171 篇 临床医学
  • 179 篇 法学
    • 166 篇 社会学
  • 128 篇 文学
    • 123 篇 新闻传播学
  • 128 篇 农学
  • 37 篇 教育学
  • 27 篇 军事学
  • 11 篇 艺术学
  • 1 篇 哲学
  • 1 篇 历史学

主题

  • 31,878 篇 approximation al...
  • 2,736 篇 algorithm design...
  • 2,322 篇 optimization
  • 2,304 篇 approximation me...
  • 2,148 篇 heuristic algori...
  • 1,422 篇 linear programmi...
  • 1,400 篇 convergence
  • 1,268 篇 computational mo...
  • 1,213 篇 resource managem...
  • 1,132 篇 signal processin...
  • 956 篇 computer science
  • 910 篇 polynomials
  • 904 篇 clustering algor...
  • 902 篇 complexity theor...
  • 791 篇 mathematical mod...
  • 731 篇 vectors
  • 712 篇 programming
  • 646 篇 estimation
  • 611 篇 transportation
  • 607 篇 training

机构

  • 97 篇 univ maryland de...
  • 70 篇 technion israel ...
  • 55 篇 univ waterloo de...
  • 49 篇 cornell univ dep...
  • 42 篇 tsinghua univers...
  • 39 篇 national institu...
  • 39 篇 carnegie mellon ...
  • 38 篇 iit dept comp sc...
  • 35 篇 national mobile ...
  • 34 篇 shandong univ sc...
  • 32 篇 sichuan univ col...
  • 31 篇 school of comput...
  • 31 篇 nanjing univ sta...
  • 29 篇 univ chinese aca...
  • 29 篇 technion haifa
  • 29 篇 princeton univ p...
  • 29 篇 suny stony brook...
  • 28 篇 tel aviv univers...
  • 28 篇 max planck inst ...
  • 27 篇 epfl

作者

  • 64 篇 woodruff david p...
  • 64 篇 ravi r.
  • 52 篇 kortsarz guy
  • 43 篇 lee euiwoong
  • 43 篇 levin asaf
  • 41 篇 chan timothy m.
  • 41 篇 kumar amit
  • 37 篇 chen zhi-zhong
  • 36 篇 friggstad zachar...
  • 33 篇 kawarabayashi ke...
  • 32 篇 manurangsi pasin
  • 32 篇 chalermsook pari...
  • 31 篇 wang lusheng
  • 30 篇 gudmundsson joac...
  • 29 篇 thai my t.
  • 29 篇 williamson david...
  • 29 篇 carmi paz
  • 29 篇 zenklusen rico
  • 28 篇 saha barna
  • 27 篇 dinitz michael

语言

  • 31,193 篇 英文
  • 548 篇 其他
  • 114 篇 中文
  • 9 篇 日文
  • 7 篇 俄文
  • 5 篇 法文
  • 3 篇 德文
  • 2 篇 西班牙文
  • 1 篇 葡萄牙文
  • 1 篇 土耳其文
检索条件"主题词=Approximation algorithms"
31878 条 记 录,以下是4741-4750 订阅
排序:
Services Management and Distributed Multihop Requests Routing in Mobile Edge Networks
收藏 引用
IEEE-ACM TRANSACTIONS ON NETWORKING 2023年 第2期31卷 497-510页
作者: Shi, Tuo Cai, Zhipeng Li, Jianzhong Gao, Hong Chen, Jiancheng Yang, Ming Tianjin Univ Coll Intelligence & Comp Tianjin 300354 Peoples R China Georgia State Univ Dept Comp Sci Atlanta GA 30303 USA Chinese Acad Sci Shenzhen Inst Adv Technol Shenzhen 518055 Peoples R China Zhejiang Normal Univ Coll Math & Comp Sci Jinhua 321004 Zhejiang Peoples R China Xiamen Intretech Inc Fujian Prov Key Lab Ind Internet & IoT Xiamen 361027 Fujian Peoples R China Xiamen Intretech Inc Xiamen 361027 Fujian Peoples R China
Multi-access Edge Computing (MEC) is an emerging computing architecture to release the resource burden of the centralized cloud and reduce the mobile application latency. Services management and MEC requests routing i... 详细信息
来源: 评论
Randomized Admission Policy for Efficient Top-k, Frequency, and Volume Estimation
收藏 引用
IEEE-ACM TRANSACTIONS ON NETWORKING 2019年 第4期27卷 1432-1445页
作者: Ben Basat, Ran Chen, Xiaoqi Einziger, Gil Friedman, Roy Kassner, Yaron Harvard Univ Dept Comp Sci Cambridge MA 02138 USA Princeton Univ Dept Comp Sci Princeton NJ 08540 USA Ben Gurion Univ Negev Dept Comp Sci IL-84105 Beer Sheva Israel Technion Israel Inst Technol Dept Comp Sci IL-32000 Haifa Israel
Network management protocols often require timely and meaningful insight about per flow network traffic. This paper introduces Randomized Admission Policy (RAP) -a novel algorithm for the frequency, top-k, and byte vo... 详细信息
来源: 评论
Path multicoloring with fewer colors in spiders and caterpillars
收藏 引用
COMPUTING 2007年 第3期80卷 255-274页
作者: Pagourtzis, A. Potika, K. Zachos, S. Natl Tech Univ Athens Sch Elect & Comp Engn Dept Comp Sci Athens 15780 Greece CUNY Brooklyn Coll Brooklyn NY 11210 USA
We study a recently introduced path coloring problem with applications to wavelength assignment in all-optical networks with multiple fibers. In contrast to classical path coloring, it is, in this setting, possible to... 详细信息
来源: 评论
METAHEURISTICS FOR THE DEPLOYMENT OF 5G
收藏 引用
IEEE WIRELESS COMMUNICATIONS 2015年 第6期22卷 40-46页
作者: Tsai, Chun-Wei Cho, Hsin-Hung Shih, Timothy K. Pan, Jeng-Shyang Rodrigues, Joel J. P. C. Natl Ilan Univ Dept Comp Sci & Informat Engn Yilan 260 Taiwan Natl Cent Univ Dept Comp Sci & Informat Engn Zhongli Taiwan Natl Cent Univ Zhongli Taiwan Fujian Univ Technol Fujian Peoples R China Univ Beira Interior Inst Telecomunicacoes Dept Informat Covilha Portugal Univ Fortaleza Fortaleza Ceara Brazil
It is not difficult to anticipate that the system capacity and spectral efficiency of 5G will be greater than those of 4G, and so will the number of network-connected wireless devices. Moreover, the infrastructure of ... 详细信息
来源: 评论
Resource-Constrained Federated Edge Learning With Heterogeneous Data: Formulation and Analysis
收藏 引用
IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING 2022年 第5期9卷 3166-3178页
作者: Liu, Yi Zhu, Yuanshao Yu, James J. Q. Southern Univ Sci & Technol Dept Comp Sci & Engn Guangdong Prov Key Lab Brain Inspired Intelligent Shenzhen 518055 Peoples R China City Univ Hong Kong Dept Comp Sci Hong Kong 518057 Peoples R China
Efficient collaboration between collaborative machine learning and wireless communication technology, forming a Federated Edge Learning (FEEL), has spawned a series of next-generation intelligent applications. However... 详细信息
来源: 评论
Survivable Task Allocation in Cloud Radio Access Networks With Mobile-Edge Computing
收藏 引用
IEEE INTERNET OF THINGS JOURNAL 2021年 第2期8卷 1095-1108页
作者: Yang, Song He, Nan Li, Fan Trajanovski, Stojan Chen, Xu Wang, Yu Fu, Xiaoming Beijing Inst Technol Sch Comp Sci & Technol Beijing 100081 Peoples R China Microsoft Microsoft Search Assistant & Intelligence Grp London W2 6BD England Sun Yat Sen Univ Sch Data & Comp Sci Guangzhou 510006 Peoples R China Temple Univ Dept Comp & Informat Sci Philadelphia PA 19122 USA Univ Gottingen Inst Comp Sci D-37077 Gottingen Germany
Cloud radio access network (C-RAN) is a promising 5G network architecture by establishing baseband units (BBU) pools to perform baseband processing functionalities and deploying remote radio heads (RRHs) for wireless ... 详细信息
来源: 评论
Region-restricted clustering for geographic data mining
收藏 引用
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS 2009年 第3期42卷 231-240页
作者: Gudmundsson, Joachim van Kreveld, Marc Narasimhan, Giri NICTA Sydney NSW Australia Univ Utrecht Dept Informat & Comp Sci NL-3508 TC Utrecht Netherlands Florida Int Univ Sch Comp & Informat Sci Miami FL 33199 USA
Clustering problems in a complex geographical setting are often required to incorporate the type and extent of land cover within a region. Given a set P of n points in a geographical setting. with the constraint that ... 详细信息
来源: 评论
FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension
收藏 引用
MATHEMATICAL PROGRAMMING 2008年 第2期115卷 273-290页
作者: De Loera, Jesus A. Hemmecke, Raymond Koeppe, Matthias Weismantel, Robert Otto VonGuericke Univ Magdegurg FMA IMO D-39106 Magdeburg Germany Univ Calif Davis Dept Math Davis CA 95616 USA
We show the existence of a fully polynomial-time approximation scheme (FPTAS) for the problem of maximizing a non-negative polynomial over mixed-integer sets in convex polytopes, when the number of variables is fixed.... 详细信息
来源: 评论
FITTING TREE METRICS: HIERARCHICAL CLUSTERING AND PHYLOGENY
收藏 引用
SIAM JOURNAL ON COMPUTING 2011年 第5期40卷 1275-1291页
作者: Ailon, Nir Charikar, Moses Technion Israel Inst Technol Fac Comp Sci IL-32000 Haifa Israel Princeton Univ Dept Comp Sci Princeton NJ 08544 USA
Given dissimilarity data on pairs of objects in a set, we study the problem of fitting a tree metric to this data so as to minimize additive error (i.e., some measure of the difference between the tree metric and the ... 详细信息
来源: 评论
Approximating the Generalized Minimum Manhattan Network Problem
收藏 引用
ALGORITHMICA 2018年 第4期80卷 1170-1190页
作者: Das, Aparna Fleszar, Krzysztof Kobourov, Stephen Spoerhase, Joachim Veeramoni, Sankar Wolff, Alexander Le Moyne Coll Dept Math & Comp Sci Syracuse NY USA Univ Arizona Dept Comp Sci Tucson AZ 85721 USA Univ Wurzburg Inst Informat Lehrstuhl 1 Wurzburg Germany
We consider the generalized minimum Manhattan network problem (GMMN). The input to this problem is a set R of n pairs of terminals, which are points in . The goal is to find a minimum-length rectilinear network that c... 详细信息
来源: 评论