咨询与建议

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

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

主题

  • 1,411 篇 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,349 篇 英文
  • 57 篇 其他
  • 4 篇 中文
  • 1 篇 西班牙文
检索条件"主题词=Randomized Algorithms"
1411 条 记 录,以下是351-360 订阅
排序:
Polylogarithmic Guarantees for Generalized Reordering Buffer Management  60
Polylogarithmic Guarantees for Generalized Reordering Buffer...
收藏 引用
60th IEEE Annual Symposium on Foundations of Computer Science (FOCS)
作者: Englert, Matthias Raecke, Harald Stotz, Richard Univ Warwick DIMAP Coventry W Midlands England Univ Warwick Dept Comp Sci Coventry W Midlands England Tech Univ Munich Dept Informat Munich Germany
In the Generalized Reordering Buffer Management Problem (GRBM) a sequence of items located in a metric space arrives online, and has to be processed by a set of k servers moving within the space. In a single step the ... 详细信息
来源: 评论
Compressed randomized UTV Decompositions for Low-Rank Matrix Approximations
收藏 引用
IEEE JOURNAL OF SELECTED TOPICS IN SIGNAL PROCESSING 2018年 第6期12卷 1155-1169页
作者: Kaloorazi, Maboud F. de Lamare, Rodrigo C. Pontifical Catholic Univ Rio de Janeiro Ctr Telecommun Studies CETUC BR-22451000 Rio De Janeiro Brazil Univ York Dept Elect York YO10 5DD N Yorkshire England
Low-rankmatrix approximations play a fundamental role in numerical linear algebra and signal processing applications. This paper introduces a novel rank-revealing matrix decomposition algorithm termed compressed rando... 详细信息
来源: 评论
Safe approximations of chance constrained sets by probabilistic scaling  18
Safe approximations of chance constrained sets by probabilis...
收藏 引用
18th European Control Conference (ECC)
作者: Alamo, Teodoro Mirasierra, Victor Dabbene, Fabrizio Lorenzen, Matthias Univ Seville Dept Ingn Sistemas & Automat Escuela Super Ingenieros Camino Descubrimientos S-N Seville 41092 Spain Politecn Torino Natl Res Council Italy CNR IEIIT Inst Elect Comp & Telecommun Engn I-10129 Corso Duca Degli Abruzzi Italy Univ Stuttgart Inst Syst Theory & Automat Control Stuttgart Germany
Motivated by problems arising in robust control, we develop a sampling-based methodology to obtain an inner approximation of the region of the design space that satisfies a given set of probabilistic constraints (chan... 详细信息
来源: 评论
Subspace-Orbit randomized Decomposition for Low-Rank Matrix Approximations
收藏 引用
IEEE TRANSACTIONS ON SIGNAL PROCESSING 2018年 第16期66卷 4409-4424页
作者: Kaloorazi, Maboud Farzaneh de lamare, Rodrigo C. Pontifical Univ Catholic Rio de Janeiro Ctr Telecommun Studies BR-22451000 Rio De Janeiro Brazil Univ York Dept Elect York YO10 5DD N Yorkshire England
An efficient, accurate, and reliable approximation of a matrix by one of lower rank is a fundamental task in numerical linear algebra and signal processing applications. In this paper, we introduce a newmatrix decompo... 详细信息
来源: 评论
Faster Minimum k-cut of a Simple Graph  60
Faster Minimum k-cut of a Simple Graph
收藏 引用
60th IEEE Annual Symposium on Foundations of Computer Science (FOCS)
作者: Li, Jason Carnegie Mellon Univ Dept Comp Sci Pittsburgh PA 15213 USA
We consider the (exact, minimum) k-CUT problem: given a graph and an integer k, delete a minimum-weight set of edges so that the remaining graph has at least k connected components. This problem is a natural generaliz... 详细信息
来源: 评论
The power of randomization by sex in multilocus genetic evolution
收藏 引用
BIOLOGY DIRECT 2020年 第1期15卷 26-26页
作者: Vasylenko, Liudmyla Feldman, Marcus W. Livnat, Adi Univ Haifa Dept Evolutionary & Environm Biol 199 Aba Khoushy Ave IL-3498838 Haifa Israel Univ Haifa Inst Evolut 199 Aba Khoushy Ave IL-3498838 Haifa Israel Stanford Univ Dept Biol 371 Jane Stanford Way Stanford CA 94305 USA
Background Many hypotheses have been proposed for how sexual reproduction may facilitate an increase in the population mean fitness, such as the Fisher-Muller theory, Muller's ratchet and others. According to the ... 详细信息
来源: 评论
randomized LU decomposition
收藏 引用
APPLIED AND COMPUTATIONAL HARMONIC ANALYSIS 2018年 第2期44卷 246-272页
作者: Shabat, Gil Shmueli, Yaniv Aizenbud, Yariv Averbuch, Amir Tel Aviv Univ Sch Elect Engn IL-69978 Tel Aviv Israel Tel Aviv Univ Sch Comp Sci IL-69978 Tel Aviv Israel Tel Aviv Univ Sch Math Sci Dept Appl Math IL-69978 Tel Aviv Israel
randomized algorithms play a central role in low rank approximations of large matrices. In this paper, the scheme of the randomized SVD is extended to a randomized LU algorithm. Several error bounds are introduced, th... 详细信息
来源: 评论
Online Resource Allocation with Matching Constraints  18
Online Resource Allocation with Matching Constraints
收藏 引用
18th International Conference on Autonomous Agents and MultiAgent Systems (AAMAS)
作者: Dickerson, John P. Sankararaman, Karthik Abinav Sarpatwar, Kanthi Kiran Srinivasan, Aravind Wu, Kun-Lung Xu, Pan Univ Maryland College Pk MD 20742 USA IBM Res AI Yorktown Hts NY USA
Matching markets with historical data are abundant in many applications, e.g., matching candidates to jobs in hiring, workers to tasks in crowdsourcing markets, and jobs to servers in cloud services. In all these appl... 详细信息
来源: 评论
Declarative Implementations of Genetic algorithms in Control Network Programming  19
Declarative Implementations of Genetic Algorithms in Control...
收藏 引用
20th Bulgarian International Computer Science and Technologies Conference (CompSysTech)
作者: Golemanova, Emilia Golemanov, Tzanko Ruse Univ Comp Syst & Technol Ruse Bulgaria
The paper describes how the built-in tools for stochastic dynamic control of the computation process in a programming paradigm, named Control Network Programming (CNP), could be used to achieve declarative (non-proced... 详细信息
来源: 评论
Locality-Preserving Oblivious RAM  38th
Locality-Preserving Oblivious RAM
收藏 引用
38th Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT)
作者: Asharov, Gilad Chan, T. -H. Hubert Nayak, Kartik Pass, Rafael Ren, Ling Shi, Elaine Cornell Cornell Tech New York NY 10044 USA Univ Hong Kong Pok Fu Lam Hong Kong Peoples R China Univ Maryland College Pk MD 20742 USA MIT 77 Massachusetts Ave Cambridge MA 02139 USA
Oblivious RAMS, introduced by Goldreich and Ostrovsky [JACM'96], compile any RAM program into one that is "memory oblivious", i.e., the access pattern to the memory is independent of the input. All previ... 详细信息
来源: 评论