咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是181-190 订阅
The randomized 𝑘-Server Conjecture Is False!  2023
The Randomized 𝑘-Server Conjecture Is False!
收藏 引用
Proceedings of the 55th Annual ACM Symposium on Theory of Computing
作者: Sébastien Bubeck Christian Coester Yuval Rabani Microsoft Research USA University of Oxford UK Hebrew University of Jerusalem Israel
We prove a few new lower bounds on the randomized competitive ratio for the k-server problem and other related problems, resolving some long-standing conjectures. In particular, for metrical task systems (MTS) we asym... 详细信息
来源: 评论
A note on the k-restriction problem
收藏 引用
Information Processing Letters 2025年 187卷
作者: Lin, Jing-You Tsai, Shi-Chun Department of Computer Science National Yang Ming Chiao Tung University Hsinchu Taiwan
Consider a set of demands, each taking length-k strings as input. The k-restriction problem is to construct a small set of length-m strings, such that given any k positions and any demand, there exists a string in the... 详细信息
来源: 评论
Layered List Labeling
收藏 引用
Proceedings of the ACM on Management of Data 2024年 第2期2卷 1-19页
作者: Michael A. Bender Alex Conway Martin Farach-Colton Hanna Komlós William Kuszmaul Stony Brook University and RelationalAI Stony Brook NY USA Cornell Tech New York NY USA New York University New York NY USA Harvard University Cambridge MA USA
The list-labeling problem is one of the most basic and well-studied algorithmic primitives in data structures, with an extensive literature spanning upper bounds, lower bounds, and data management applications. The cl... 详细信息
来源: 评论
Parallel Load Balancing on constrained client-server topologies
收藏 引用
THEORETICAL COMPUTER SCIENCE 2021年 895卷 16-33页
作者: Clementi, Andrea Natale, Emanuele Ziccardi, Isabella Univ Roma Tor Vergata Rome Italy Univ Cote Azur INRIA CNRS Sophia Antipolis France Univ Aquila Laquila Italy
We study parallel Load Balancing protocols for the client-server distributed model defined as follows. There is a set C of n clients and a set S of n servers where each client has (at most) a constant number d >= 1... 详细信息
来源: 评论
Query-competitive sorting with uncertainty
收藏 引用
THEORETICAL COMPUTER SCIENCE 2021年 867卷 50-67页
作者: Halldorsson, Magnus M. de Lima, Murilo Santos Reykjavik Univ Dept Comp Sci Menntavegi 1 IS-102 Reykjavik Iceland Univ Leicester Sch Informat Univ Rd Leicester LE1 7RH Leics England
We study the problem of sorting under incomplete information, when queries are used to resolve uncertainties. Each of n data items has an unknown value, which is known to lie in a given interval. We can pay a query co... 详细信息
来源: 评论
Estimating the Longest Increasing Subsequence in Nearly Optimal Time  63
Estimating the Longest Increasing Subsequence in Nearly Opti...
收藏 引用
63rd Annual IEEE Symposium on Foundations of Computer Science (FOCS)
作者: Andoni, Alexandr Nosatzki, Negev Shekel Sinha, Sandip Stein, Clifford Columbia Univ New York NY 10027 USA
Longest Increasing Subsequence (LIS) is a fundamental statistic of a sequence, and has been studied for decades. While the LIS of a sequence of length n can be computed exactly in time O(n log n), the complexity of es... 详细信息
来源: 评论
Phase Transition of the 3-Majority Dynamics with Uniform Communication Noise  1
收藏 引用
29th International Colloquium on Structural Information and Communication Complexity (SIROCCO)
作者: d'Amore, Francesco Ziccardi, Isabella Univ Cote Azur INRIA CNRS I3S Sophia Antipolis France Univ Aquila Laquila Italy
Communication noise is a common feature in several real-world scenarios where systems of agents need to communicate in order to pursue some collective task. In particular, many biologically inspired systems that try t... 详细信息
来源: 评论
Finding Multiple Optimal Solutions to an Integer Linear Program by Random Perturbations of Its Objective Function
收藏 引用
algorithms 2025年 第3期18卷 140-140页
作者: Schulhof, Noah Sukprasert, Pattara Ruppin, Eytan Khuller, Samir Schaffer, Alejandro A. NCI NIH Canc Data Sci Lab Bethesda MD 20892 USA Northwestern Univ Dept Comp Sci Evanston IL 60201 USA Databricks Inc San Francisco CA 94105 USA
Integer linear programs (ILPs) and mixed integer programs (MIPs) often have multiple distinct optimal solutions, yet the widely used Gurobi optimization solver returns certain solutions at disproportionately high freq... 详细信息
来源: 评论
Bidirectional stochastic configuration network for regression problems
收藏 引用
NEURAL NETWORKS 2021年 140卷 237-246页
作者: Cao, Weipeng Xie, Zhongwu Li, Jianqiang Xu, Zhiwu Ming, Zhong Wang, Xizhao Shenzhen Univ Coll Comp Sci & Software Engn Shenzhen 518060 Peoples R China
To adapt to the reality of limited computing resources of various terminal devices in industrial applications, a randomized neural network called stochastic configuration network (SCN), which can conduct effective tra... 详细信息
来源: 评论
Derandomization for Sliding Window algorithms with Strict Correctness*
收藏 引用
THEORY OF COMPUTING SYSTEMS 2021年 第3期65卷 444-461页
作者: Ganardi, Moses Hucke, Danny Lohrey, Markus Univ Siegen Holderlinstr 3 D-57076 Siegen Germany
In the sliding window streaming model the goal is to compute an output value that only depends on the lastnsymbols from the data stream. Thereby, only space sublinear in the window sizenshould be used. Quite often ran... 详细信息
来源: 评论