咨询与建议

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

  • 1,154 篇 工学
    • 880 篇 计算机科学与技术...
    • 241 篇 电气工程
    • 224 篇 控制科学与工程
    • 175 篇 软件工程
    • 51 篇 信息与通信工程
    • 22 篇 机械工程
    • 15 篇 电子科学与技术(可...
    • 12 篇 仪器科学与技术
    • 7 篇 航空宇航科学与技...
    • 3 篇 力学(可授工学、理...
    • 2 篇 材料科学与工程(可...
    • 2 篇 化学工程与技术
    • 2 篇 交通运输工程
    • 2 篇 生物工程
    • 2 篇 网络空间安全
    • 1 篇 土木工程
  • 582 篇 理学
    • 530 篇 数学
    • 64 篇 系统科学
    • 30 篇 统计学(可授理学、...
    • 15 篇 物理学
    • 7 篇 生物学
    • 1 篇 生态学
  • 109 篇 管理学
    • 108 篇 管理科学与工程(可...
    • 10 篇 工商管理
  • 18 篇 经济学
    • 16 篇 应用经济学
    • 2 篇 理论经济学
  • 5 篇 医学
    • 4 篇 临床医学
    • 2 篇 基础医学(可授医学...
  • 4 篇 法学
    • 4 篇 法学
  • 4 篇 农学
  • 1 篇 教育学
    • 1 篇 教育学

主题

  • 1,411 篇 randomized algor...
  • 114 篇 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...
  • 22 篇 convex optimizat...
  • 21 篇 load balancing
  • 21 篇 analysis of algo...
  • 21 篇 computational ge...
  • 21 篇 consensus
  • 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,349 篇 英文
  • 57 篇 其他
  • 4 篇 中文
  • 1 篇 西班牙文
检索条件"主题词=randomized algorithms"
1411 条 记 录,以下是31-40 订阅
排序:
randomized algorithms to solve parameter-dependent linear matrix inequalities and their computational complexity
Randomized algorithms to solve parameter-dependent linear ma...
收藏 引用
40th IEEE Conference on Decision and Control
作者: Oishi, Y Kimura, H Univ Tokyo Grad Sch Informat Sci & Technol Dept Math Informat Bunkyo Ku Tokyo 1130033 Japan
The randomized algorithm of Calafiore and Polyak, which consists of random sampling and subgradient descent, is analyzed in the case that it is used to solve parameter-dependent linear matrix inequalities. This paper ... 详细信息
来源: 评论
randomized algorithms to Update Partial Singular Value Decomposition on a Hybrid CPU/GPU Cluster  15
Randomized Algorithms to Update Partial Singular Value Decom...
收藏 引用
International Conference for High Performance Computing, Networking, Storage and Analysis (SC)
作者: Yamazaki, Ichitaro Kurzak, Jakub Luszczek, Piotr Dongarra, Jack Univ Tennessee Dept Elect Engn & Comp Sci Knoxville TN 37996 USA
For data analysis, a partial singular value decomposition (SVD) of the sparse matrix representing the data is a powerful tool. However, computing the SVD of a large matrix can take a significant amount of time even on... 详细信息
来源: 评论
randomized algorithms for the majority problem
收藏 引用
Electronic Notes in Discrete Mathematics 2009年 34卷 453-457页
作者: Christofides, Demetres School of Mathematics University of Birmingham Birmingham United Kingdom
In the majority problem, we are given n balls coloured black or white and we are allowed to query whether two balls have the same colour or not. The goal is to find a ball of majority colour in the minimum number of q... 详细信息
来源: 评论
COMPETITIVE randomized algorithms FOR NONUNIFORM PROBLEMS
收藏 引用
ALGORITHMICA 1994年 第6期11卷 542-571页
作者: KARLIN, AR MANASSE, MS MCGEOCH, LA OWICKI, S AMHERST COLL DEPT MATH & COMP SCIAMHERSTMA 01002
Competitive analysis is concerned with comparing the performance of on-line algorithms with that of optimal off-line algorithms. In some cases randomization can lead to algorithms with improved performance ratios on w... 详细信息
来源: 评论
Computational complexity of randomized algorithms for solving parameter-dependent linear matrix inequalities
收藏 引用
AUTOMATICA 2003年 第12期39卷 2149-2156页
作者: Oishi, Y Kimura, H Univ Tokyo Grad Sch Informat Sci & Technol Dept Math Informat Bunkyo Ku Tokyo 1138656 Japan Univ Tokyo Grad Sch Frontier Sci Dept Complex Sci & Engn Bunkyo Ku Tokyo 1130033 Japan
randomized algorithms are proposed for solving parameter-dependent linear matrix inequalities and their computational complexity is analyzed. The first proposed algorithm is an adaptation of the algorithms of Polyak a... 详细信息
来源: 评论
Some applications of randomized algorithms for control system design
收藏 引用
AUTOMATICA 2002年 第12期38卷 2085-2092页
作者: Patel, VV Deodhare, G Viswanath, T Ctr Artificial Intelligence & Robot Bangalore 560001 Karnataka India Univ Twente Fac Math Sci NL-7500 AE Enschede Netherlands
In this paper a few "difficult" problems related to simultaneous stabilization of three plants (equivalent to a certain problem related to unit interpolation in H.) have been addressed through the framework ... 详细信息
来源: 评论
THE COMPETITIVENESS OF randomized algorithms FOR ONLINE STEINER TREE AND ONLINE SPANNING TREE PROBLEMS
收藏 引用
INFORMATION PROCESSING LETTERS 1993年 第4期48卷 177-182页
作者: TSAI, YT TANG, CY NATL TSING HUA UNIV DEPT COMP SCIHSINCHU 300TAIWAN
This paper considers a family of randomized on-line algorithms, Algorithm R(m), where 1 less-than-or-equal-to m less-than-or-equal-to n - 1 and n is the number of input points, for the on-line Steiner tree and on-line... 详细信息
来源: 评论
Worst-case properties of the uniform distribution and randomized algorithms for robustness analysis
收藏 引用
MATHEMATICS OF CONTROL SIGNALS AND SYSTEMS 1998年 第3期11卷 183-196页
作者: Bai, EW Tempo, R Fu, MY Univ Iowa Dept Elect & Comp Engn Iowa City IA 52242 USA Politecn Torino CNR CENS Turin Italy Univ Newcastle Dept Elect & Comp Engn Newcastle NSW 2308 Australia
In this paper we study a probabilistic approach which is an alternative to the classical worst-case algorithms for robustness analysis and design of uncertain control systems. That is, we aim to estimate the probabili... 详细信息
来源: 评论
Fault Detection for Non-Gaussian Processes Using Generalized Canonical Correlation Analysis and randomized algorithms
收藏 引用
IEEE TRANSACTIONS ON INDUSTRIAL ELECTRONICS 2018年 第2期65卷 1559-1567页
作者: Chen, Zhiwen Ding, Steven X. Peng, Tao Yang, Chunhua Gui, Weihua Cent South Univ Sch Informat Sci & Engn Changsha 410083 Hunan Peoples R China Univ Duisburg Essen Inst Automat Control & Complex Syst AKS D-47057 Duisburg Germany
In this paper, we first study a generalized canonical correlation analysis (CCA)-based fault detection (FD) method aiming at maximizing the fault detectability under an acceptable false alarm rate. More specifically, ... 详细信息
来源: 评论
Distributed randomized algorithms for probabilistic performance analysis
收藏 引用
SYSTEMS & CONTROL LETTERS 2009年 第3期58卷 202-212页
作者: Calafiore, Giuseppe Carlo Politecn Torino Dipartimento Automat & Informat I-10129 Turin Italy
randomized algorithms are a useful tool for analyzing the performance of complex uncertain systems. Their implementation requires the generation of a large number N of random samples representing the uncertainty scena... 详细信息
来源: 评论