咨询与建议

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

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

主题

  • 1,410 篇 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 篇 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,348 篇 英文
  • 57 篇 其他
  • 4 篇 中文
  • 1 篇 西班牙文
检索条件"主题词=Randomized Algorithms"
1410 条 记 录,以下是441-450 订阅
排序:
Local Computation algorithms for Graphs of Non-constant Degrees
收藏 引用
ALGORITHMICA 2017年 第4期77卷 971-994页
作者: Levi, Reut Rubinfeld, Ronitt Yodpinyanee, Anak Ecole Normale Super Paris France Univ Paris Diderot Paris France MIT CSAIL 77 Massachusetts Ave Cambridge MA 02139 USA Tel Aviv Univ Blavatnik Sch Comp Sci Tel Aviv Israel
In the model of local computation algorithms (LCAs), we aim to compute the queried part of the output by examining only a small (sublinear) portion of the input. Many recently developed LCAs on graph problems achieve ... 详细信息
来源: 评论
Repetitive Scenario Design
收藏 引用
IEEE TRANSACTIONS ON AUTOMATIC CONTROL 2017年 第3期62卷 1125-1137页
作者: Calafiore, Giuseppe C. Politecn Torino Dipartimento Automat & Informat I-10129 Turin Italy
Repetitive Scenario Design (RSD) is a randomized approach to robust design based on iterating two phases: a standard scenario design phase that uses N scenarios (design samples), followed by randomized feasibility pha... 详细信息
来源: 评论
Approximately Optimal Mechanisms for Strategyproof Facility Location: Minimizing Lp Norm of Costs
收藏 引用
MATHEMATICS OF OPERATIONS RESEARCH 2017年 第2期42卷 434-447页
作者: Feigenbaum, Itai Sethuraman, Jay Ye, Chun Lehman Coll Dept Math & Comp Sci Bronx NY 10468 USA CUNY Grad Ctr Program Comp Sci New York NY 10016 USA Columbia Univ Dept Ind Engn & Operat Res New York NY 10027 USA Amazon Com Seattle WA 98109 USA
This paper is concerned with the problem of locating a facility on a line in the presence of strategic agents, also located on that line. Each agent incurs a cost equal to her distance to the facility whereas the plan... 详细信息
来源: 评论
Stochastic Configuration Networks: Fundamentals and algorithms
收藏 引用
IEEE TRANSACTIONS ON CYBERNETICS 2017年 第10期47卷 3466-3479页
作者: Wang, Dianhui Li, Ming La Trobe Univ Dept Comp Sci & Informat Technol Melbourne Vic 3086 Australia
This paper contributes to the development of randomized methods for neural networks. The proposed learner model is generated incrementally by stochastic configuration (SC) algorithms, termed SC networks (SCNs). In con... 详细信息
来源: 评论
Stochastic Primal-Dual Coordinate Method for Regularized Empirical Risk Minimization
收藏 引用
JOURNAL OF MACHINE LEARNING RESEARCH 2017年 第1期18卷 2939-2980页
作者: Zhang, Yuchen Xiao, Lin Stanford Univ Dept Comp Sci Stanford CA 94305 USA Microsoft Res Redmond WA 98052 USA
We consider a generic convex optimization problem associated with regularized empirical risk minimization of linear predictors. The problem structure allows us to reformulate it as a convex-concave saddle point proble... 详细信息
来源: 评论
Robust stochastic configuration networks with kernel density estimation for uncertain data regression
收藏 引用
INFORMATION SCIENCES 2017年 412卷 210-222页
作者: Wang, Dianhui Li, Ming La Trobe Univ Dept Comp Sci & Informat Technol Melbourne Vic 3086 Australia
Neural networks have been widely used as predictive models to fit data distribution, and they could be implemented through learning a collection of samples. In many applications, however, the given dataset may contain... 详细信息
来源: 评论
Quick but Odd Growth of Cacti
收藏 引用
ALGORITHMICA 2017年 第1期79卷 271-290页
作者: Kolay, Sudeshna Lokshtanov, Daniel Panolan, Fahad Saurabh, Saket HBNI Inst Math Sci CIT Campus Chennai 600113 Tamil Nadu India Univ Bergen Dept Informat N-5020 Bergen Norway
Let be a family of graphs. Given an n-vertex input graph G and a positive integer k, testing whether G has a vertex subset S of size at most k, such that belongs to , is a prototype vertex deletion problem. These type... 详细信息
来源: 评论
Computing the permanent modulo a prime power
收藏 引用
INFORMATION PROCESSING LETTERS 2017年 第Sep.期125卷 20-25页
作者: Bjorklund, Andreas Husfeldt, Thore Lyckberg, Isak Lund Univ Box 118 S-22100 Lund Sweden ITU Copenhagen Rued Langgaards Vej 7 DK-2300 Copenhagen S Denmark
We show how to compute the permanent of an n x n integer matrix modulo p(k) in time n(k+ O(1)) if p = 2 and in time 2(n)/exp{Omega(gamma(2)n/p logp)} if p is an odd prime with kp 0 we can compute the permanent of an ... 详细信息
来源: 评论
On Approximating the Eigenvalues of Stochastic Matrices in Probabilistic Logspace
收藏 引用
COMPUTATIONAL COMPLEXITY 2017年 第2期26卷 393-420页
作者: Doron, Dean Sarid, Amir Ta-Shma, Amnon Tel Aviv Univ Blavatnik Sch Comp Sci IL-6997801 Ramat Aviv Israel
We show that approximating the second eigenvalue of stochastic operators is BPL-complete, thus giving a natural problem complete for this class. We also show that approximating any eigenvalue of a stochastic and Hermi... 详细信息
来源: 评论
On Application of the Ray-Shooting Method for LQR via Static-Output-Feedback
收藏 引用
algorithms 2018年 第1期11卷 8-8页
作者: Peretz, Yossi Jerusalem Coll Technol Lev Acad Ctr Dept Comp Sci POB 16031 IL-93721 Jerusalem Israel
In this article we suggest a randomized algorithm for the LQR (Linear Quadratic Regulator) optimal-control problem via static-output-feedback. The suggested algorithm is based on the recently introduced randomized opt... 详细信息
来源: 评论