咨询与建议

限定检索结果

文献类型

  • 477 篇 期刊文献
  • 144 篇 会议
  • 5 篇 学位论文
  • 2 册 图书

馆藏范围

  • 628 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 456 篇 工学
    • 361 篇 计算机科学与技术...
    • 116 篇 电气工程
    • 78 篇 软件工程
    • 42 篇 控制科学与工程
    • 40 篇 信息与通信工程
    • 8 篇 机械工程
    • 7 篇 电子科学与技术(可...
    • 4 篇 力学(可授工学、理...
    • 4 篇 仪器科学与技术
    • 3 篇 材料科学与工程(可...
    • 3 篇 动力工程及工程热...
    • 3 篇 石油与天然气工程
    • 3 篇 生物医学工程(可授...
    • 3 篇 生物工程
    • 3 篇 网络空间安全
    • 2 篇 测绘科学与技术
    • 2 篇 化学工程与技术
    • 2 篇 航空宇航科学与技...
  • 305 篇 理学
    • 274 篇 数学
    • 29 篇 物理学
    • 22 篇 统计学(可授理学、...
    • 8 篇 系统科学
    • 5 篇 生物学
  • 60 篇 管理学
    • 59 篇 管理科学与工程(可...
    • 12 篇 工商管理
  • 17 篇 经济学
    • 15 篇 应用经济学
    • 2 篇 理论经济学
  • 6 篇 医学
    • 5 篇 临床医学
  • 4 篇 农学
    • 2 篇 作物学
  • 3 篇 法学
    • 3 篇 法学
  • 1 篇 文学
  • 1 篇 军事学

主题

  • 628 篇 randomized algor...
  • 31 篇 approximation al...
  • 25 篇 distributed algo...
  • 19 篇 low-rank approxi...
  • 17 篇 computational ge...
  • 15 篇 approximation
  • 14 篇 lower bound
  • 13 篇 clustering
  • 12 篇 optimization
  • 11 篇 dimension reduct...
  • 11 篇 parallel algorit...
  • 10 篇 load balancing
  • 10 篇 linear programmi...
  • 10 篇 combinatorial op...
  • 9 篇 competitive anal...
  • 9 篇 singular value d...
  • 9 篇 sketching
  • 8 篇 computational co...
  • 8 篇 big data
  • 8 篇 leader election

机构

  • 11 篇 chongqing univ c...
  • 6 篇 fudan univ sch m...
  • 6 篇 stanford univ de...
  • 5 篇 univ hong kong d...
  • 5 篇 univ colorado de...
  • 5 篇 city univ hong k...
  • 5 篇 natl univ singap...
  • 4 篇 n carolina state...
  • 4 篇 wuhan univ sch m...
  • 4 篇 max planck inst ...
  • 4 篇 tsinghua univ in...
  • 4 篇 stanford univ ic...
  • 4 篇 fudan univ key l...
  • 4 篇 purdue univ dept...
  • 4 篇 univ michigan de...
  • 3 篇 univ elect sci &...
  • 3 篇 univ chicago dep...
  • 3 篇 iit dept comp sc...
  • 3 篇 xiamen univ wang...
  • 3 篇 chongqing univ k...

作者

  • 11 篇 li hanyu
  • 9 篇 pandurangan gopa...
  • 6 篇 yang haizhao
  • 6 篇 wei yimin
  • 5 篇 robinson peter
  • 5 篇 tropp joel a.
  • 5 篇 wang mengyu
  • 5 篇 kaltofen e
  • 5 篇 alipour sharareh
  • 5 篇 gulwani s
  • 5 篇 ghodsi mohammad
  • 5 篇 wang jianxin
  • 5 篇 molla anisur rah...
  • 5 篇 lau francis c. m...
  • 5 篇 necula gc
  • 5 篇 chen jianer
  • 4 篇 sauerwald thomas
  • 4 篇 kumar manish
  • 4 篇 liu yang
  • 4 篇 mostefaoui achou...

语言

  • 585 篇 英文
  • 38 篇 其他
  • 5 篇 中文
  • 1 篇 德文
检索条件"主题词=Randomized algorithm"
628 条 记 录,以下是451-460 订阅
排序:
Input-based adaptive randomized test case prioritization: A local beam search approach
收藏 引用
JOURNAL OF SYSTEMS AND SOFTWARE 2015年 105卷 91-106页
作者: Jiang, Bo Chan, W. K. Beihang Univ Sch Comp Sci & Engn Beijing 100191 Peoples R China City Univ Hong Kong Dept Comp Sci Hong Kong Hong Kong Peoples R China
Test case prioritization assigns the execution priorities of the test cases in a given test suite. Many existing test case prioritization techniques assume the full-fledged availability of code coverage data, fault hi... 详细信息
来源: 评论
Solving the system of nonsingular tensor equations via randomized Kaczmarz-like method
收藏 引用
JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS 2023年 421卷
作者: Wang, Xuezhong Che, Maolin Mo, Changxin Wei, Yimin Hexi Univ Sch Math & Stat Zhangye 734000 Peoples R China Southwest Univ Finance & Econ Sch Math Chengdu 611130 Peoples R China Chongqing Normal Univ Sch Math Sci Chongqing 401331 Peoples R China Fudan Univ Sch Math Sci Shanghai 200433 Peoples R China Fudan Univ Key Lab Math Nonlinear Sci Shanghai 200433 Peoples R China
A great deal of attention has been paid to solve the system of tensor equations in recent years for its applications in various fields. In this paper, the Kaczmarz-like method, which is an effective approach for solvi... 详细信息
来源: 评论
Global value numbering using random interpretation  04
Global value numbering using random interpretation
收藏 引用
31st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
作者: Gulwani, S Necula, GC Univ Calif Berkeley Dept Elect Engn & Comp Sci Berkeley CA 94720 USA
We present a polynomial time randomized algorithm for global value numbering. Our algorithm is complete when conditionals are treated as non-deterministic and all operators are treated as uninterpreted functions. We a... 详细信息
来源: 评论
Certification Under Uncertainties of Control Methods for Multisource Elevators  1
收藏 引用
16th International Conference on Intelligent Systems Design and Applications (ISDA)
作者: Desdouits, Chloe Alamir, Mazen Giroudeau, Rodolphe Le Pape, Claude Univ Grenoble Alpes CNRS GIPSA Lab Domaine Univ F-38000 Grenoble France Univ Montpellier 2 LIRMM UMR 5506 CC477161 Rue Ada F-34095 Montpellier 5 France Schneider Elect Ind SAS 38 TEC Technopole37 Quai Paul Louis Merlin F-38050 Grenoble 09 France
As the interest in regulating energy usage and participating in the demand-response market is growing, new energy management algorithms emerge. Energy consumption of elevators represents about 5% of the overall consum... 详细信息
来源: 评论
An Improved Approximation algorithm for Knapsack Median Using Sparsification  23rd
An Improved Approximation Algorithm for Knapsack Median Usin...
收藏 引用
23rd Annual European Symposium on algorithms (ESA) as part of ALGO Conference
作者: Byrka, Jaroslaw Pensyl, Thomas Rybicki, Bartosz Spoerhase, Joachim Srinivasan, Aravind Khoa Trinh Univ Warsaw Inst Comp Sci PL-00325 Warsaw Poland Univ Maryland Dept Comp Sci College Pk MD 20742 USA Univ Maryland Instute Adv Comp Studies College Pk MD 20742 USA
Knapsack median is a generalization of the classic k-median problem in which we replace the cardinality constraint with a knapsack constraint. It is currently known to be 32-approximable. We improve on the best known ... 详细信息
来源: 评论
Efficient Information Exchange in Single-Hop Multi-Channel Radio Networks
Efficient Information Exchange in Single-Hop Multi-Channel R...
收藏 引用
7th International Conference on Wireless algorithms, Systems, and Applications (WASA)
作者: Shi, Weijie Hua, Qiang-Sheng Yu, Dongxiao Wang, Yuexuan Lau, Francis C. M. Tsinghua Univ Inst Interdisciplinary Informat Sci Inst Theoret Comp Sci Beijing 100084 Peoples R China Univ Hong Kong Dept Comp Sci Hong Kong Peoples R China
This paper studies the information exchange problem in single-hop multi-channel radio networks, which is to disseminate k messages stored in k arbitrary nodes to the entire network (with n nodes) with the fewest times... 详细信息
来源: 评论
Time-Optimal Construction of Overlay Networks  21
Time-Optimal Construction of Overlay Networks
收藏 引用
40th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC)
作者: Goette, Thorsten Hinnenthal, Kristian Scheideler, Christian Werthmann, Julian Paderborn Univ Paderborn Germany
We show how to construct an overlay network of constant degree and diameter O(log n) in time O(log n) starting from an arbitrary weakly connected graph. We assume a synchronous communication network in which nodes can... 详细信息
来源: 评论
Low-Rank Tucker Approximation of a Tensor from Streaming Data
收藏 引用
SIAM JOURNAL ON MATHEMATICS OF DATA SCIENCE 2020年 第4期2卷 1123-1150页
作者: Sun, Yiming Guo, Yang Luo, Charlene Tropp, Joel Udell, Madeleine Cornell Univ Dept Stat & Data Sci Ithaca NY 14853 USA Univ Wisconsin Madison Dept Comp Sci Madison WI 53706 USA Columbia Univ New York NY 10027 USA CALTECH Dept Comp Math Sci Pasadena CA 91125 USA Cornell Univ Sch Operat Res & Informat Engn Ithaca NY 14853 USA
This paper describes a new algorithm for computing a low-Tucker-rank approximation of a tensor. The method applies a randomized linear map to the tensor to obtain a sketch that captures the important directions within... 详细信息
来源: 评论
ONLINE SET PACKING
收藏 引用
SIAM JOURNAL ON COMPUTING 2012年 第4期41卷 728-746页
作者: Emek, Yuval Halldorsson, Magnus M. Mansour, Yishay Patt-Shamir, Boaz Radhakrishnan, Jaikumar Rawitz, Dror ETH Comp Engn & Networks Lab CH-8092 Zurich Switzerland Reykjavik Univ Sch Comp Sci IS-103 Reykjavik Iceland Tel Aviv Univ Sch Comp Sci IL-69978 Tel Aviv Israel Tel Aviv Univ Sch Elect Engn IL-69978 Tel Aviv Israel Tata Inst Fundamental Res Sch Technol & Comp Sci Bombay 400005 Maharashtra India
In online set packing (OSP), elements arrive online, announcing which sets they belong to, and the algorithm needs to assign each element, upon arrival, to one of its sets. The goal is to maximize the number of sets t... 详细信息
来源: 评论
Join-Idle-Queue: A novel load balancing algorithm for dynamically scalable web services
收藏 引用
PERFORMANCE EVALUATION 2011年 第11期68卷 1056-1071页
作者: Lu, Yi Xie, Qiaomin Kliot, Gabriel Geller, Alan Larus, James R. Greenberg, Albert Univ Illinois Dept Elect & Comp Engn Urbana IL 61801 USA Microsoft Res Extreme Comp Grp Redmond WA USA
The prevalence of dynamic-content web services, exemplified by search and online social networking, has motivated an increasingly wide web-facing front end. Horizontal scaling in the Cloud is favored for its elasticit... 详细信息
来源: 评论