咨询与建议

限定检索结果

文献类型

  • 972 篇 期刊文献
  • 420 篇 会议
  • 15 篇 学位论文
  • 2 册 图书

馆藏范围

  • 1,409 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 1,155 篇 工学
    • 881 篇 计算机科学与技术...
    • 240 篇 电气工程
    • 224 篇 控制科学与工程
    • 176 篇 软件工程
    • 51 篇 信息与通信工程
    • 22 篇 机械工程
    • 15 篇 电子科学与技术(可...
    • 12 篇 仪器科学与技术
    • 7 篇 航空宇航科学与技...
    • 3 篇 力学(可授工学、理...
    • 2 篇 材料科学与工程(可...
    • 2 篇 化学工程与技术
    • 2 篇 交通运输工程
    • 2 篇 生物工程
    • 2 篇 网络空间安全
    • 1 篇 土木工程
  • 580 篇 理学
    • 528 篇 数学
    • 64 篇 系统科学
    • 30 篇 统计学(可授理学、...
    • 15 篇 物理学
    • 7 篇 生物学
    • 1 篇 生态学
  • 111 篇 管理学
    • 110 篇 管理科学与工程(可...
    • 11 篇 工商管理
  • 19 篇 经济学
    • 17 篇 应用经济学
    • 2 篇 理论经济学
  • 5 篇 医学
    • 4 篇 临床医学
    • 2 篇 基础医学(可授医学...
  • 4 篇 法学
    • 4 篇 法学
  • 4 篇 农学
  • 1 篇 教育学
    • 1 篇 教育学

主题

  • 1,409 篇 randomized algor...
  • 115 篇 approximation al...
  • 69 篇 algorithms
  • 53 篇 online algorithm...
  • 48 篇 parallel algorit...
  • 44 篇 competitive anal...
  • 43 篇 distributed algo...
  • 35 篇 distributed comp...
  • 33 篇 computational co...
  • 31 篇 optimization
  • 29 篇 property testing
  • 27 篇 graph algorithms
  • 23 篇 probabilistic ro...
  • 21 篇 analysis of algo...
  • 21 篇 computational ge...
  • 21 篇 consensus
  • 21 篇 convex optimizat...
  • 20 篇 load balancing
  • 20 篇 robust control
  • 20 篇 deterministic al...

机构

  • 15 篇 politecn torino ...
  • 15 篇 technion israel ...
  • 13 篇 politecn torino ...
  • 12 篇 univ maryland de...
  • 11 篇 rensselaer polyt...
  • 11 篇 max planck inst ...
  • 10 篇 politecn milan d...
  • 10 篇 univ calif berke...
  • 9 篇 fudan univ sch m...
  • 9 篇 univ maryland in...
  • 9 篇 tel aviv univ sc...
  • 8 篇 cornell univ dep...
  • 8 篇 mit cambridge ma...
  • 8 篇 univ maryland co...
  • 8 篇 univ waterloo sc...
  • 8 篇 yale univ dept c...
  • 8 篇 fudan univ key l...
  • 8 篇 politecn torino ...
  • 7 篇 tel aviv univ sc...
  • 7 篇 univ connecticut...

作者

  • 15 篇 srinivasan aravi...
  • 15 篇 dabbene fabrizio
  • 15 篇 tempo roberto
  • 11 篇 patt-shamir boaz
  • 11 篇 drineas petros
  • 10 篇 rajasekaran s
  • 10 篇 wei yimin
  • 9 篇 calafiore giusep...
  • 9 篇 xu pan
  • 9 篇 mahoney michael ...
  • 9 篇 saibaba arvind k...
  • 8 篇 chan timothy m.
  • 8 篇 prandini maria
  • 8 篇 woelfel philipp
  • 8 篇 alistarh dan
  • 8 篇 piroddi luigi
  • 8 篇 doerr benjamin
  • 7 篇 chen zhi-zhong
  • 7 篇 rajasekaran sang...
  • 7 篇 tempo r

语言

  • 1,347 篇 英文
  • 57 篇 其他
  • 4 篇 中文
  • 1 篇 西班牙文
检索条件"主题词=Randomized Algorithms"
1409 条 记 录,以下是101-110 订阅
Low tubal rank tensor completion based on singular value factors
收藏 引用
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS 2023年 第2期100卷 342-360页
作者: Song, Zihao Xu, Xiangjian Cheng, Zhe Zhao, Weihua Nantong Univ Sch Sci Nantong 226019 Jiangsu Peoples R China
Inspired by the definition of tensor-tensor product and tensor tubal rank, a randomized singular value decomposition of tensor is presented in this paper. Based on tensor singular value decomposition (t-SVD) and tenso... 详细信息
来源: 评论
Dynamic Regret Bounds for Constrained Online Nonconvex Optimization Based on Polyak-Lojasiewicz Regions
收藏 引用
IEEE TRANSACTIONS ON CONTROL OF NETWORK SYSTEMS 2023年 第2期10卷 599-611页
作者: Mulvaney-Kemp, Julie Park, SangWoo Jin, Ming Lavaei, Javad Univ Calif Berkeley Dept Ind Engn & Operat Res Berkeley CA 94720 USA Virginia Tech Dept Elect & Comp Engn Blacksburg VA 24061 USA
Online optimization problems are well understood in the convex case, where algorithmic performance is typically measured relative to the best fixed decision. In this article, we shed light on online nonconvex optimiza... 详细信息
来源: 评论
A Probabilistic Test for A-Diagnosability of Stochastic Discrete-Event Systems With Guaranteed Error Bound
收藏 引用
IEEE CONTROL SYSTEMS LETTERS 2023年 7卷 2833-2838页
作者: Chen, Jun Oakland Univ Dept Elect & Comp Engn Rochester MI 48374 USA
This letter investigates the failure diagnosability of stochastic discrete-event systems (DES). Specifically, the A-Diagnosability (proposed by Thorsley et al., 2005) is studied, which requires every failure to be sto... 详细信息
来源: 评论
An Algorithm for Non-negative Leslie Matrices  12th
An Algorithm for Non-negative Leslie Matrices
收藏 引用
12th International Conference on Mathematical Modeling in Physical Sciences (IC-MSQUARE)
作者: Pantaz, Jesica Rodriguez, Jonnathan Medina, Luis Univ Antofagasta Fac Ciencias Basicas Dept Fis Av Angamos 601 Antofagasta Chile Univ Antofagasta Fac Ciencias Basicas Dept Matemat Av Angamos 601 Antofagasta Chile
The Leslie matrix plays a crucial role in analyzing the changes in survival and birth rates, thus determining the population's evolution. However, when it comes to evaluating continuous solutions of population gro... 详细信息
来源: 评论
Distributed maximal independent set computation driven by finite-state dynamics
收藏 引用
INTERNATIONAL JOURNAL OF PARALLEL EMERGENT AND DISTRIBUTED SYSTEMS 2023年 第1期38卷 85-97页
作者: Goles, Eric Leal, Laura Montealegre, Pedro Rapaport, Ivan Rios-Wilson, Martin Univ Adolfo Ibanez Fac Ingn & Ciencias Penalolen Chile Univ Chile Dept Ingn Matemat Santiago Chile Univ Chile DIM CMM UMI CNRS 2807 Santiago Chile
A Maximal Independent Set (MIS) is an inclusion maximal set of pairwise non-adjacent vertices. The computation of an MIS is one of the core problems in distributed computing. In this article, we introduce and analyze ... 详细信息
来源: 评论
An Iterative Random Sampling Algorithm for Rapid and Scalable Estimation of Matrix Spectra
收藏 引用
IEEE JOURNAL ON MULTISCALE AND MULTIPHYSICS COMPUTATIONAL TECHNIQUES 2023年 8卷 205-216页
作者: Kelley, Jon T. Yilmaz, Ali E. Brick, Yaniv Univ Texas Austin Oden Inst Computat Engn & Sci Austin TX 78712 USA Ben Gurion Univ Negev Sch Elect & Comp Engn IL-8410501 Beer Sheva Israel
An easy-to-implement iterative algorithm that enables efficient and scalable spectral analysis of dense matrices is presented. The algorithm relies on the approximation of a matrix's singular values by those of a ... 详细信息
来源: 评论
Formally Certified Approximate Model Counting  36th
Formally Certified Approximate Model Counting
收藏 引用
36th International Conference on Computer-Aided Verification (CAV)
作者: Tan, Yong Kiam Yang, Jiong Soos, Mate Myreen, Magnus O. Meel, Kuldeep S. ASTAR Inst Infocomm Res I2R Singapore Singapore Natl Univ Singapore Singapore Singapore Chalmers Univ Technol Gothenburg Sweden Univ Toronto Toronto ON Canada
Approximate model counting is the task of approximating the number of solutions to an input Boolean formula. The state-of-the-art approximate model counter for formulas in conjunctive normal form (CNF), ApproxMC, prov... 详细信息
来源: 评论
No-regret Caching via Online Mirror Descent
收藏 引用
ACM TRANSACTIONS ON MODELING AND PERFORMANCE EVALUATION OF COMPUTING SYSTEMS 2023年 第4期8卷 1-32页
作者: Salem, Tareq Si Neglia, Giovanni Ioannidis, Stratis Univ Cote Azur Inria 2004 Route Lucioles F-06902 Sophia Antipolis France Northeastern Univ 805 Columbus Ave Boston MA 02120 USA
We study an online caching problem in which requests can be served by a local cache to avoid retrieval costs from a remote server. The cache can update its state after a batch of requests and store an arbitrarily smal... 详细信息
来源: 评论
Learning Spanning Forests Optimally inWeighted Undirected Graphs with CUT queries  35
Learning Spanning Forests Optimally inWeighted Undirected Gr...
收藏 引用
35th International Conference on Algorithmic Learning Theory
作者: Chakrabarty, Deeparnab Liao, Hang Dartmouth Coll Dept Comp Sci Hanover NH 03755 USA
In this paper we describe a randomized algorithm which returns a maximal spanning forest of an unknown weighted undirected graph making O(n) CUT queries in expectation. For weighted graphs, this is optimal due to a re... 详细信息
来源: 评论
A Nearly Quadratic Improvement for Memory Reallocation  24
A Nearly Quadratic Improvement for Memory Reallocation
收藏 引用
36th ACM Symposium on Parallelism in algorithms and Architectures (SPAA)
作者: Farach-Colton, Martin Kuszmaul, William Sheffield, Nathan S. Westover, Alek NYU New York NY 10012 USA Harvard Univ Cambridge MA USA MIT Cambridge MA USA
In the Memory Reallocation Problem a set of items of various sizes must be dynamically assigned to non-overlapping contiguous chunks of memory. It is guaranteed that the sum of the sizes of all items present at any ti... 详细信息
来源: 评论