咨询与建议

限定检索结果

文献类型

  • 2,431 篇 期刊文献
  • 770 篇 会议
  • 24 篇 学位论文
  • 4 册 图书

馆藏范围

  • 3,229 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 2,348 篇 工学
    • 2,007 篇 计算机科学与技术...
    • 477 篇 电气工程
    • 380 篇 信息与通信工程
    • 337 篇 软件工程
    • 76 篇 机械工程
    • 74 篇 控制科学与工程
    • 68 篇 电子科学与技术(可...
    • 29 篇 交通运输工程
    • 28 篇 仪器科学与技术
    • 11 篇 材料科学与工程(可...
    • 8 篇 土木工程
    • 6 篇 力学(可授工学、理...
    • 6 篇 测绘科学与技术
    • 6 篇 石油与天然气工程
    • 6 篇 生物工程
    • 3 篇 环境科学与工程(可...
  • 1,652 篇 理学
    • 1,598 篇 数学
    • 28 篇 生物学
    • 25 篇 统计学(可授理学、...
    • 19 篇 物理学
    • 12 篇 系统科学
    • 10 篇 化学
    • 3 篇 地球物理学
  • 897 篇 管理学
    • 890 篇 管理科学与工程(可...
    • 235 篇 工商管理
    • 5 篇 图书情报与档案管...
  • 242 篇 经济学
    • 235 篇 应用经济学
    • 6 篇 理论经济学
  • 10 篇 法学
    • 8 篇 法学
  • 9 篇 医学
    • 5 篇 临床医学
  • 8 篇 军事学
  • 4 篇 农学
  • 2 篇 艺术学
  • 1 篇 教育学

主题

  • 3,229 篇 approximation al...
  • 222 篇 scheduling
  • 80 篇 combinatorial op...
  • 73 篇 approximation al...
  • 68 篇 np-hard
  • 68 篇 computational co...
  • 65 篇 np-hardness
  • 64 篇 linear programmi...
  • 61 篇 np-complete
  • 56 篇 optimization
  • 53 篇 facility locatio...
  • 51 篇 traveling salesm...
  • 51 篇 graph algorithm
  • 46 篇 wireless sensor ...
  • 45 篇 worst-case analy...
  • 45 篇 vertex cover
  • 45 篇 makespan
  • 45 篇 network design
  • 43 篇 computational ge...
  • 43 篇 dynamic programm...

机构

  • 52 篇 univ alberta dep...
  • 50 篇 univ texas dalla...
  • 38 篇 shandong jianzhu...
  • 37 篇 iit dept comp sc...
  • 37 篇 nanjing univ sta...
  • 34 篇 tianjin univ tec...
  • 33 篇 city univ hong k...
  • 32 篇 univ new brunswi...
  • 31 篇 shandong normal ...
  • 29 篇 shandong univ sc...
  • 27 篇 renmin univ chin...
  • 24 篇 yunnan univ sch ...
  • 24 篇 chinese acad sci...
  • 23 篇 hangzhou dianzi ...
  • 20 篇 beijing univ tec...
  • 18 篇 zhejiang normal ...
  • 17 篇 beijing univ tec...
  • 17 篇 beijing univ tec...
  • 17 篇 univ wisconsin d...
  • 16 篇 univ texas dalla...

作者

  • 92 篇 xu dachuan
  • 52 篇 du donglei
  • 49 篇 wu weili
  • 47 篇 lin guohui
  • 44 篇 wu chenchen
  • 44 篇 zhang zhao
  • 42 篇 li deying
  • 34 篇 zhang dongmei
  • 30 篇 li min
  • 30 篇 du ding-zhu
  • 29 篇 chen yong
  • 28 篇 zhang an
  • 27 篇 yu wei
  • 25 篇 dai haipeng
  • 25 篇 liu zhaohui
  • 25 篇 wang wei
  • 25 篇 li weidong
  • 25 篇 chen guihai
  • 24 篇 dumitrescu adria...
  • 24 篇 zhang peng

语言

  • 3,001 篇 英文
  • 214 篇 其他
  • 13 篇 中文
  • 2 篇 法文
  • 1 篇 德文
检索条件"主题词=approximation algorithm"
3229 条 记 录,以下是3001-3010 订阅
排序:
BEATING THE INTEGRALITY RATIO FOR TOURS s-t- IN GRAPHS
收藏 引用
SIAM JOURNAL ON COMPUTING 2023年 第6期52卷 37-84页
作者: Traub, Vera Vygen, Jens Univ Bonn Res Inst Discrete Math D-53113 Bonn Germany Univ Bonn Hausdorff Ctr Math D-53113 Bonn Germany
Among various variants of the traveling salesman problem (TSP), the s-t-path graph TSP has the special feature that we know the exact integrality ratio, 3/2, and an approximation algorithm matching this ratio. In this... 详细信息
来源: 评论
FPGA Placement Using Space-Filling Curves: Theory Meets Practice
收藏 引用
ACM TRANSACTIONS ON EMBEDDED COMPUTING SYSTEMS 2009年 第2期9卷 12-12页
作者: Banerjee, Pritha Sur-Kolay, Susmita Bishnu, Arijit Das, Sandip Nandy, Subhas C. Bhattacharjee, Subhasis Indian Stat Inst Kolkata India Synopsis Pvt Ltd Bangalore Karnataka India
Research in VLSI placement, an NP-hard problem, has branched in two different directions. The first one employs iterative heuristics with many tunable parameters to produce a near-optimal solution but without theoreti... 详细信息
来源: 评论
Group fairness in non-monotone submodular maximization
收藏 引用
JOURNAL OF COMBINATORIAL OPTIMIZATION 2023年 第3期45卷 88-88页
作者: Yuan, Jing Tang, Shaojie Univ North Texas Dept Comp Sci & Engn Denton TX USA Univ Texas Dallas Naveen Jindal Sch Management Richardson TX 75080 USA
Maximizing a submodular function has a wide range of applications in machine learning and data mining. One such application is data summarization whose goal is to select a small set of representative and diverse data ... 详细信息
来源: 评论
Radiation Constrained Fair Charging for Wireless Power Transfer
收藏 引用
ACM TRANSACTIONS ON SENSOR NETWORKS 2019年 第2期15卷 15-15页
作者: Li, Lanlan Dai, Haipeng Chen, Guihai Zheng, Jiaqi Dou, Wanchun Wu, Xiaobing Nanjing Univ State Key Lab Novel Software Technol Nanjing 210023 Jiangsu Peoples R China Univ Canterbury Wireless Res Ctr Canterbury New Zealand
Recently, wireless power transfer technology (WPT) has attracted considerable attention and become a promising technology to prolong the lifetime of wireless sensor networks (WSNs) by providing perpetual energy to sen... 详细信息
来源: 评论
Channel modeling of wireless 3D-chip based on ray-tracing
收藏 引用
MICROELECTRONICS JOURNAL 2022年 119卷
作者: Ren, Chao Hou, Jingze Pan, Biao Univ Sci & Technol Beijing Sch Comp & Commun Engn & Shunde Grad Sch Beijing Peoples R China Univ Sci & Technol Beijing Beijing Peoples R China Beihang Univ Sch Integrated Circuit Sci & Engn MIIT Key Lab Spintron Beijing Peoples R China
The resource constraints and accuracy requirements for Internet of Things (IoT) memory chips need threedimensional (3D) monolithic integrated circuits, of which the increasing stack layers (currently more than 176) al... 详细信息
来源: 评论
Near-Optimal NP-Hardness of Approximating MAX k-CSPR
收藏 引用
THEORY OF COMPUTING 2022年 18卷 1-29页
作者: Manurangsi, Pasin Nakkiran, Preetum Trevisan, Luca Univ Calif Berkeley Berkeley CA USA Google Res Mountain View CA 94043 USA Univ Calif San Diego Halicioglu Data Sci Inst La Jolla CA 92093 USA Bocconi Univ Dept Decis Sci Comp Sci Milan Italy
We prove almost optimal hardness for MAX k-CSPR. In MAX k-CSPR, we are given a set of constraints, each of which depends on at most k variables. Each variable can take any value from 1, 2,. .., R. The goal is to find ... 详细信息
来源: 评论
BETTER GUARANTEES FOR k-MEANS AND EUCLIDEAN k-MEDIAN BY PRIMAL-DUAL algorithmS
收藏 引用
SIAM JOURNAL ON COMPUTING 2020年 第4期49卷 FOCS17-97-FOCS17-156页
作者: Ahmadian, Sara Norouzi-Fard, Ashkan Svensson, Ola Ward, Justin Univ Waterloo Dept Combinator & Optimizat Waterloo ON N2L 3G1 Canada Ecole Polytech Fed Lausanne Sch Comp & Commun Sci CH-1015 Lausanne Switzerland
Clustering is a classic topic in optimization with k-means being one of the most fundamental such problems. In the absence of any restrictions on the input, the best-known algorithm for k-means in Euclidean space with... 详细信息
来源: 评论
Bounded mixed batch scheduling with job release dates and rejection
收藏 引用
OPERATIONS RESEARCH LETTERS 2024年 57卷
作者: Xu, Jun Huang, Yong-Xing Zhang, Daxing Lin, Ran Fan, Guo-Qiang Xidian Univ Guangzhou Inst Technol Adv Mfg Technol Innovat Ctr Guangzhou 510555 Peoples R China Northwestern Polytech Univ Sch Mech Engn Dept Ind Engn Xian 710072 Peoples R China Zhengzhou Univ Sch Math & Stat Zhengzhou 450001 Peoples R China Xidian Univ Sch Econ & Management Xian 710126 Peoples R China
This paper investigates a bounded mixed batch scheduling problem with job release dates and rejection. The machine processes a batch containing several jobs that their number does not exceed the machine capacity. For ... 详细信息
来源: 评论
Building a small and informative phylogenetic supertree
收藏 引用
INFORMATION AND COMPUTATION 2023年 第1期294卷
作者: Jansson, Jesper Mampentzidis, Konstantinos Sandhya, T. P. Hong Kong Polytech Univ Dept Comp Hong Kong Peoples R China Kyoto Univ Grad Sch Informat Kyoto Japan Aarhus Univ Dept Comp Sci Aarhus Denmark Stockholm Univ Dept Math Stockholm Sweden
We combine two fundamental optimization problems related to the construction of phylogenetic trees called maximum rooted triplets consistency and minimally resolved supertree into a new problem, which we call q-maximu... 详细信息
来源: 评论
Auction algorithm sensitivity for multi-robot task allocation?
收藏 引用
AUTOMATICA 2023年 第1期158卷
作者: Clinch, Katie Wood, Tony A. Manzie, Chris Univ New South Wales Sch Comp Sci & Engn Sydney NSW Australia Ecole Polytech Fed Lausanne SYCAMORE Lab Lausanne Switzerland Univ Melbourne Dept Elect & Elect Engn Melbourne Vic 3010 Australia
We consider the problem of finding a low-cost allocation and ordering of tasks between a team of robots in a d-dimensional, uncertain, landscape, and the sensitivity of this solution to changes in the cost *** algorit... 详细信息
来源: 评论