咨询与建议

限定检索结果

文献类型

  • 477 篇 期刊文献
  • 144 篇 会议
  • 5 篇 学位论文
  • 2 册 图书

馆藏范围

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

日期分布

学科分类号

  • 456 篇 工学
    • 361 篇 计算机科学与技术...
    • 116 篇 电气工程
    • 78 篇 软件工程
    • 42 篇 控制科学与工程
    • 40 篇 信息与通信工程
    • 8 篇 机械工程
    • 7 篇 电子科学与技术(可...
    • 4 篇 力学(可授工学、理...
    • 4 篇 仪器科学与技术
    • 3 篇 材料科学与工程(可...
    • 3 篇 动力工程及工程热...
    • 3 篇 石油与天然气工程
    • 3 篇 生物医学工程(可授...
    • 3 篇 生物工程
    • 3 篇 网络空间安全
    • 2 篇 测绘科学与技术
    • 2 篇 化学工程与技术
    • 2 篇 航空宇航科学与技...
  • 305 篇 理学
    • 274 篇 数学
    • 29 篇 物理学
    • 22 篇 统计学(可授理学、...
    • 8 篇 系统科学
    • 5 篇 生物学
  • 60 篇 管理学
    • 59 篇 管理科学与工程(可...
    • 12 篇 工商管理
  • 17 篇 经济学
    • 15 篇 应用经济学
    • 2 篇 理论经济学
  • 6 篇 医学
    • 5 篇 临床医学
  • 4 篇 农学
    • 2 篇 作物学
  • 3 篇 法学
    • 3 篇 法学
  • 1 篇 文学
  • 1 篇 军事学

主题

  • 628 篇 randomized algor...
  • 31 篇 approximation al...
  • 25 篇 distributed algo...
  • 19 篇 low-rank approxi...
  • 17 篇 computational ge...
  • 15 篇 approximation
  • 14 篇 lower bound
  • 13 篇 clustering
  • 12 篇 optimization
  • 11 篇 dimension reduct...
  • 11 篇 parallel algorit...
  • 10 篇 load balancing
  • 10 篇 linear programmi...
  • 10 篇 combinatorial op...
  • 9 篇 competitive anal...
  • 9 篇 singular value d...
  • 9 篇 sketching
  • 8 篇 computational co...
  • 8 篇 big data
  • 8 篇 leader election

机构

  • 11 篇 chongqing univ c...
  • 6 篇 fudan univ sch m...
  • 6 篇 stanford univ de...
  • 5 篇 univ hong kong d...
  • 5 篇 univ colorado de...
  • 5 篇 city univ hong k...
  • 5 篇 natl univ singap...
  • 4 篇 n carolina state...
  • 4 篇 wuhan univ sch m...
  • 4 篇 max planck inst ...
  • 4 篇 tsinghua univ in...
  • 4 篇 stanford univ ic...
  • 4 篇 fudan univ key l...
  • 4 篇 purdue univ dept...
  • 4 篇 univ michigan de...
  • 3 篇 univ elect sci &...
  • 3 篇 univ chicago dep...
  • 3 篇 iit dept comp sc...
  • 3 篇 xiamen univ wang...
  • 3 篇 chongqing univ k...

作者

  • 11 篇 li hanyu
  • 9 篇 pandurangan gopa...
  • 6 篇 yang haizhao
  • 6 篇 wei yimin
  • 5 篇 robinson peter
  • 5 篇 tropp joel a.
  • 5 篇 wang mengyu
  • 5 篇 kaltofen e
  • 5 篇 alipour sharareh
  • 5 篇 gulwani s
  • 5 篇 ghodsi mohammad
  • 5 篇 wang jianxin
  • 5 篇 molla anisur rah...
  • 5 篇 lau francis c. m...
  • 5 篇 necula gc
  • 5 篇 chen jianer
  • 4 篇 sauerwald thomas
  • 4 篇 kumar manish
  • 4 篇 liu yang
  • 4 篇 mostefaoui achou...

语言

  • 586 篇 英文
  • 36 篇 其他
  • 5 篇 中文
  • 1 篇 德文
检索条件"主题词=randomized algorithm"
628 条 记 录,以下是291-300 订阅
排序:
Tight Bounds for Online Weighted Tree Augmentation
收藏 引用
algorithmICA 2022年 第2期84卷 304-324页
作者: Naor, Joseph (Seffi) Umboh, Seeun William Williamson, David P. Technion Haifa Israel Univ Sydney Sydney NSW Australia Cornell Univ Ithaca NY USA
The Weighted Tree Augmentation problem (WTAP) is a fundamental problem in network design. In this paper, we consider this problem in the online setting. We are given an n-vertex tree T = (V, E) and an additional set L... 详细信息
来源: 评论
The complexity of leader election in diameter-two networks
收藏 引用
DISTRIBUTED COMPUTING 2020年 第2期33卷 189-205页
作者: Chatterjee, Soumyottam Pandurangan, Gopal Robinson, Peter Univ Houston Houston TX 77204 USA McMaster Univ Hamilton ON Canada
This paper focuses on studying the message complexity of implicit leader election in synchronous distributed networks of diameter two. Kutten et al. (J ACM 62(1):7:1-7:27, 2015) showed a fundamental lower bound of Ome... 详细信息
来源: 评论
EFFICIENT algorithmS FOR THE HITCHCOCK TRANSPORTATION PROBLEM
收藏 引用
SIAM JOURNAL ON COMPUTING 1995年 第3期24卷 563-578页
作者: TOKUYAMA, T NAKANO, J IBM Research Kanagawa Japan
We consider the Hitchcock transportation problem on n supply points and k demand points when n is much greater than k. The problem can be solved in O(kn(2) log n + n(2) log(2) n) time if an efficient minimum-cost flow... 详细信息
来源: 评论
High-performance sorting algorithms for the CRAY T3D parallel computer
收藏 引用
JOURNAL OF SUPERCOMPUTING 1997年 第4期10卷 371-395页
作者: Dixon, B Swallow, J DAVIDSON COLL DEPT MATHDAVIDSONNC 28036 CTR COMMUN RES PRINCETONNJ
In this paper we study the sorting performance of a 128-processor CRAY T3D and discuss the efficient use of the toroidal network connecting the processors. The problems we consider range from that of sorting one word ... 详细信息
来源: 评论
Distributed (Δ+1)-coloring in the physical model
收藏 引用
THEORETICAL COMPUTER SCIENCE 2014年 第0期553卷 37-56页
作者: Yu, Dongxiao Wang, Yuexuan Hua, Qiang-Sheng Lau, Francis C. M. Univ Hong Kong Dept Comp Sci Hong Kong Hong Kong Peoples R China Tsinghua Univ Inst Interdisciplinary Informat Sci Beijing 100084 Peoples R China
In multi-hop radio networks, such as wireless ad-hoc networks and wireless sensor networks, nodes employ a MAC (Medium Access Control) protocol such as TDMA to coordinate accesses to the shared medium and to avoid int... 详细信息
来源: 评论
An Improved Approximation algorithm for Knapsack Median Using Sparsification
收藏 引用
algorithmICA 2018年 第4期80卷 1093-1114页
作者: Byrka, Jaroslaw Pensyl, Thomas Rybicki, Bartosz Spoerhase, Joachim Srinivasan, Aravind Khoa Trinh Univ Wroclaw Inst Comp Sci Wroclaw Poland Univ Maryland Dept Comp Sci College Pk MD 20742 USA Univ Maryland Dept Comp Sci College Pk MD 20742 USA Univ Maryland Inst Adv Comp Studies College Pk MD 20742 USA
Knapsack median is a generalization of the classic k-median problem in which we replace the cardinality constraint with a knapsack constraint. It is currently known to be 32-approximable. We improve on the best known ... 详细信息
来源: 评论
Simultaneous Perturbation Stochastic Approximation-Based Consensus for Tracking Under Unknown-But-Bounded Disturbances
收藏 引用
IEEE TRANSACTIONS ON AUTOMATIC CONTROL 2021年 第8期66卷 3710-3717页
作者: Granichin, Oleg Erofeeva, Victoria Ivanskiy, Yury Jiang, Yuming St Petersburg State Univ Sci & Educ Ctr Math Robot & Artificial Intelligen St Petersburg 198504 Russia Norwegian Univ Sci & Technol NTNU Dept Informat Secur & Commun Technol NO-7491 Trondheim Norway
We consider a setup where a distributed set of sensors working cooperatively can estimate an unknown signal of interest, whereas any individual sensor cannot fulfill the task due to lack of necessary information diver... 详细信息
来源: 评论
Large independent sets in general random intersection graphs
收藏 引用
THEORETICAL COMPUTER SCIENCE 2008年 第3期406卷 215-224页
作者: Nikoletseas, S. Raptopoulos, C. Spirakis, P. Comp Technol Inst GR-26110 Patras Greece Univ Patras Patras 26500 Greece
We investigate the existence and efficient algorithmic construction of close to optimal independent sets in random models of intersection graphs. In particular, (a) we propose a new model for random intersection graph... 详细信息
来源: 评论
Nonlinear Monotonically Convergent Iterative Learning Control for Batch Processes
收藏 引用
IEEE TRANSACTIONS ON INDUSTRIAL ELECTRONICS 2018年 第7期65卷 5826-5836页
作者: Lu, Jingyi Cao, Zhixing Zhang, Ridong Gao, Furong Hong Kong Univ Sci & Technol Fok Ying Tung Grad Sch Kowloon Hong Kong Peoples R China Univ Edinburgh Sch Biol Sci Edinburgh EH9 3JH Midlothian Scotland Hong Kong Univ Sci & Technol Dept Chem & Biol Engn Kowloon Hong Kong Peoples R China
Iterative learning control (ILC) has been successfully applied to numerous batch processes over the past decades. Monotonic convergence of tracking error is a desired characteristic that attracts much attention in aca... 详细信息
来源: 评论
On fractional cut covers
收藏 引用
DISCRETE APPLIED MATHEMATICS 2019年 265卷 168-181页
作者: Neto, Jose Ben-Ameur, Walid Telecom SudParis CNRS Samovar 9 Rue Charles Fourier F-91011 Evry France
Given an undirected graph, a minimum cut cover is a collection of cuts covering the whole set of edges and having minimum cardinality. This paper is dedicated to the fractional version of this problem where a fraction... 详细信息
来源: 评论