咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是401-410 订阅
排序:
Assigning Tasks to Workers based on Historical Data: Online Task Assignment with Two-sided Arrivals  17
Assigning Tasks to Workers based on Historical Data: Online ...
收藏 引用
17th International Conference on Autonomous Agents and MultiAgent Systems (AAMAS)
作者: Dickerson, John P. Sankararaman, Karthik Abinav Srinivasan, Aravind Xu, Pan Univ Maryland College Pk MD 20742 USA
Efficient allocation of tasks to workers is a central problem in crowd-sourcing. In this paper, we consider a special setting inspired from spatial crowdsourcing platforms where both workers and tasks arrive dynamical... 详细信息
来源: 评论
On fast and robust information spreading in the Vertex-Congest model  1
收藏 引用
22nd International Colloquium on Structural Information and Communication Complexity (SIROCCO)
作者: Censor-Hillel, Keren Toukan, Tariq Technion Israel Inst Technol Haifa Israel
This paper initiates the study of the impact of failures on the fundamental problem of information spreading in the Vertex-Congest model, in which in every round, each of the n nodes sends the same O (logn)-bit messag... 详细信息
来源: 评论
MST in O(1) Rounds of Congested Clique  29
MST in <i>O</i>(1) Rounds of Congested Clique
收藏 引用
29th Annual ACM-SIAM Symposium on Discrete algorithms (SODA)
作者: Jurdzinski, Tomasz Nowicki, Krzysztof Univ Wroclaw Inst Comp Sci Wroclaw Poland
We present a distributed randomized algorithm finding Minimum Spanning Tree (MST) of a given graph in O(1) rounds, with high probability, in the congested clique model. The input graph in the congested clique model is... 详细信息
来源: 评论
Analysis of Consensus Sorting via the Cycle Metric  12th
Analysis of Consensus Sorting via the Cycle Metric
收藏 引用
12th Annual International Conference on Combinatorial Optimization and Applications (COCOA)
作者: Avramovic, Ivan Richards, Dana S. George Mason Univ Fairfax VA 22030 USA
Sorting is studied in this paper as an archetypal example to explore the optimizing power of consensus. In conceptualizing the consensus sort, the classical hill-climbing method of optimization is paired with the mode... 详细信息
来源: 评论
Minimizing Inputs for Strong Structural Controllability
Minimizing Inputs for Strong Structural Controllability
收藏 引用
American Control Conference
作者: Kumar Yashashwi Shana Moothedath Prasanna Chaporkar Indian Institute of Technology Bomhay India University of Washington USA
The notion of strong structural controllability (s-controllability) allows for determining controllability properties of large linear time-invariant systems even when numerical values of the system parameters are not ... 详细信息
来源: 评论
SAMPLING AND RECONSTRUCTION OF GRAPH SIGNALS VIA WEAK SUBMODULARITY AND SEMIDEFINITE RELAXATION
SAMPLING AND RECONSTRUCTION OF GRAPH SIGNALS VIA WEAK SUBMOD...
收藏 引用
IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)
作者: Hashemi, Abolfazl Shafipour, Rasoul Vikalo, Haris Mateos, Gonzalo Univ Texas Austin Dept Elect & Comp Engn Austin TX 78712 USA Univ Rochester Dept Elect & Comp Engn Rochester NY USA
We study the problem of sampling a bandlimited graph signal in the presence of noise, where the objective is to select a node subset of prescribed cardinality that minimizes the signal reconstruction mean squared erro... 详细信息
来源: 评论
A randomized NONMONOTONE BLOCK PROXIMAL GRADIENT METHOD FOR A CLASS OF STRUCTURED NONLINEAR PROGRAMMING
收藏 引用
SIAM JOURNAL ON NUMERICAL ANALYSIS 2017年 第6期55卷 2930-2955页
作者: Lu, Zhaosong Xiao, Lin Simon Fraser Univ Dept Math Burnaby BC V5A 1S6 Canada Microsoft Res Machine Learning Grp One Microsoft Way Redmond WA 98052 USA
We propose a randomized nonmonotone block proximal gradient (RNBPG) method for minimizing the sum of a smooth (possibly nonconvex) function and a block-separable (possibly nonconvex nonsmooth) function. At each iterat... 详细信息
来源: 评论
Communication-Avoiding Parallel Minimum Cuts and Connected Components  18
Communication-Avoiding Parallel Minimum Cuts and Connected C...
收藏 引用
23rd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP)
作者: Gianinazzi, Lukas Kalvoda, Pavel De Palma, Alessandro Besta, Maciej Hoefler, Torsten Swiss Fed Inst Technol Dept Comp Sci Zurich Switzerland Google Inc Mountain View CA USA
We present novel scalable parallel algorithms for finding global minimum cuts and connected components, which are important and fundamental problems in graph processing. To take advantage of future massively parallel ... 详细信息
来源: 评论
Markov chains and emergent behavior for problems from discrete geometry
Markov chains and emergent behavior for problems from discre...
收藏 引用
作者: Cannon, Sarah Georgia Institute of Technology
学位级别:博士
The problem of generating random samples from large, complex sets is widespread across the sciences, where such samples provide one way to begin to learn about the sets' typical properties. However, when the sampl... 详细信息
来源: 评论
randomized Fixed-Parameter algorithms for the Closest String Problem
收藏 引用
ALGORITHMICA 2016年 第1期74卷 466-484页
作者: Chen, Zhi-Zhong Ma, Bin Wang, Lusheng Tokyo Denki Univ Div Informat Syst Design Hiki Saitama 3500394 Japan Univ Waterloo Sch Comp Sci Waterloo ON N2L 3G1 Canada City Univ Hong Kong Dept Comp Sci Kowloon Hong Kong Peoples R China
Given a set of strings of equal length and an integer , the closest string problem (CSP) requires the computation of a string of length such that for each , where is the Hamming distance between and . The problem is N... 详细信息
来源: 评论