咨询与建议

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

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

主题

  • 1,409 篇 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...
  • 21 篇 load balancing
  • 21 篇 analysis of algo...
  • 21 篇 computational ge...
  • 21 篇 consensus
  • 21 篇 convex optimizat...
  • 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 条 记 录,以下是351-360 订阅
排序:
Estimating Hospital Admissions with a randomized Regression Approach
Estimating Hospital Admissions with a Randomized Regression ...
收藏 引用
11th IEEE International Conference on Machine Learning and Applications (ICMLA)
作者: Garcia, Kleber A. Chan, Philip K. Elect Arts Orlando FL 32810 USA Florida Inst Technol Dept Comp Sci Melbourne FL 32901 USA
Boarding or holding in the Emergency Department (ED) reduces capacity of the ED and delays patients from receiving specialized care. Estimating accurately the number of admissions from the ED can help determine approp... 详细信息
来源: 评论
Replacing Pivoting in Distributed Gaussian Elimination with randomized Techniques  11
Replacing Pivoting in Distributed Gaussian Elimination with ...
收藏 引用
11th Workshop on Latest Advances in Scalable algorithms for Large- Scale Systems (ScalA)
作者: Lindquist, Neil Luszczek, Piotr Dongarra, Jack Univ Tennessee Innovat Comp Lab Knoxville TN 37996 USA Univ Manchester Manchester Lancs England Oak Ridge Natl Lab Oakland CA USA
Gaussian elimination is a key technique for solving dense, non-symmetric systems of linear equations. Pivoting is used to ensure numerical stability but can introduce significant overheads. We propose replacing pivoti... 详细信息
来源: 评论
randomized Sampling for Large Data Applications of SVM
Randomized Sampling for Large Data Applications of SVM
收藏 引用
11th IEEE International Conference on Machine Learning and Applications (ICMLA)
作者: Ferragut, Erik M. Laska, Jason Oak Ridge Natl Lab Computat Sci & Engn Div Oak Ridge TN 37830 USA
A trend in machine learning is the application of existing algorithms to ever-larger datasets. Support Vector Machines (SVM) have been shown to be very effective, but have been difficult to scale to large-data problem... 详细信息
来源: 评论
Subspace-Orbit randomized-Based Decomposition for Low-Rank Matrix Approximations  26
Subspace-Orbit Randomized-Based Decomposition for Low-Rank M...
收藏 引用
26th European Signal Processing Conference (EUSIPCO)
作者: Kaloorazi, Maboud F. de lamare, Rodrigo C. Pontifical Catholic Univ Rio de Janeiro PUC Rio CETUC Rio De Janeiro RJ Brazil Pontificia Univ Catolica Rio de Janeiro CETUC Rio de Janeiro RJ Brazil Univ York Dept Elect York N Yorkshire England
In this paper we introduce a novel matrix decomposition algorithm termed Subspace-Orbit randomized Singular Value Decomposition (SOR-SVD). It is computed by using random sampling techniques to give a low-rank approxim... 详细信息
来源: 评论
A randomized competitive algorithm for evaluating priced AND/OR trees
收藏 引用
21st Annual Symposium on Theoretical Aspects of Computer Science
作者: Laber, Eduardo Sany Dept Informat PUC Rio BR-22453901 Rio De Janeiro RJ Brazil
Recently, Charikar et al. investigated the problem of evaluating AND/OR trees, with non-uniform costs on its leaves, from the perspective of the competitive analysis. For an AND/OR tree T they presented a mu(T)-compet... 详细信息
来源: 评论
Analysis of a randomized local search algorithm for LDPCC decoding problem
收藏 引用
2nd International Symposium on Stochastic algorithms
作者: Watanabe, O Sawai, T Takahashi, H Tokyo Inst Technol Dept Math & Comp Sci Tokyo Japan
We propose an approach for analyzing the average performance of a given (randomized) local search algorithm, for a constraint satisfaction problem. Our approach consists of two approximations. Using a randomized algor... 详细信息
来源: 评论
A NEW STATISTICAL APPROACH FOR THE ANALYSIS OF UNCERTAIN SYSTEMS
收藏 引用
Journal of Systems Science & Complexity 2009年 第1期22卷 1-34页
作者: Xinjia CHEN Kemin ZHOU Jorge ARAVENA Department of Electrical Engineering Southern University Baton Rouge LA 70813 USA. Department of Electrical and Computer Engineering Louisiana State University Baton Rouge LA 70803 USA.
This paper addresses the issues of conservativeness and computational complexity of probabilistie robustness analysis. The authors solve both issues by defining a new sampling strategy and robustness measure. The new ... 详细信息
来源: 评论
Property testing in bounded degree graphs
收藏 引用
ALGORITHMICA 2002年 第2期32卷 302-343页
作者: Goldreich, O Ron, D Weizmann Inst Sci Dept Comp Sci & Appl Math IL-76100 Rehovot Israel Tel Aviv Univ Dept Elect Engn Syst Ramat Aviv Israel MIT LCS Cambridge MA 02139 USA CS Dept Berkeley Berkeley CA USA
We further develop the study of testing graph properties as initiated by Goldreich, Goldwasser and Ron. Loosely speaking, given an oracle access to a graph, we wish to distinguish the case when the graph has a pre-det... 详细信息
来源: 评论
The Complexity of Computing the Random Priority Allocation Matrix
收藏 引用
MATHEMATICS OF OPERATIONS RESEARCH 2015年 第4期40卷 1005-1014页
作者: Saban, Daniela Sethuraman, Jay Columbia Univ Grad Sch Business New York NY 10027 USA Columbia Univ Dept Ind Engn & Operat Res New York NY 10027 USA
The random priority (RP) mechanism is a popular way to allocate n objects to n agents with strict ordinal preferences over the objects. In the RP mechanism, an ordering over the agents is selected uniformly at random;... 详细信息
来源: 评论
Stochastic spatial routing for reconfigurable networks
收藏 引用
MICROPROCESSORS AND MICROSYSTEMS 2006年 第6期30卷 301-318页
作者: DeHon, Andre Huang, Randy Wawrzynek, John Univ Calif Berkeley Berkeley CA 94720 USA
FPGA placement and routing is time consuming, often serving as the major obstacle inhibiting a fast edit-compile-test loop in prototyping and development and the major obstacle preventing late-bound hardware and desig... 详细信息
来源: 评论