咨询与建议

限定检索结果

文献类型

  • 137 篇 期刊文献
  • 27 篇 会议
  • 6 篇 学位论文
  • 1 册 图书

馆藏范围

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

日期分布

学科分类号

  • 140 篇 工学
    • 126 篇 计算机科学与技术...
    • 52 篇 电气工程
    • 18 篇 软件工程
    • 10 篇 信息与通信工程
    • 6 篇 仪器科学与技术
    • 6 篇 控制科学与工程
    • 3 篇 电子科学与技术(可...
    • 2 篇 石油与天然气工程
    • 1 篇 机械工程
    • 1 篇 动力工程及工程热...
    • 1 篇 交通运输工程
  • 62 篇 理学
    • 55 篇 数学
    • 11 篇 统计学(可授理学、...
    • 6 篇 生物学
    • 3 篇 化学
    • 2 篇 物理学
  • 6 篇 管理学
    • 6 篇 管理科学与工程(可...
  • 2 篇 经济学
    • 2 篇 应用经济学
  • 1 篇 医学
    • 1 篇 临床医学

主题

  • 171 篇 probabilistic al...
  • 9 篇 machine learning
  • 6 篇 parallel algorit...
  • 5 篇 approximation al...
  • 5 篇 tracking
  • 5 篇 finite fields
  • 4 篇 reliability
  • 4 篇 clustering
  • 4 篇 algorithms
  • 4 篇 analysis of algo...
  • 4 篇 distributed algo...
  • 4 篇 biology and gene...
  • 3 篇 computational co...
  • 3 篇 random graphs
  • 3 篇 geometric soluti...
  • 3 篇 polynomial
  • 3 篇 markov processes
  • 3 篇 computational ge...
  • 3 篇 primality
  • 3 篇 decision trees

机构

  • 3 篇 technion israel ...
  • 3 篇 univ buenos aire...
  • 2 篇 agena ltd cambri...
  • 2 篇 univ nacl gen sa...
  • 2 篇 univ cambridge d...
  • 2 篇 cornell univ dep...
  • 2 篇 vrije univ amste...
  • 2 篇 google inc mount...
  • 2 篇 northwestern uni...
  • 2 篇 queen mary univ ...
  • 2 篇 brno university ...
  • 2 篇 idiap res inst c...
  • 2 篇 inst tecnol buen...
  • 2 篇 core secur techn...
  • 1 篇 universidad vera...
  • 1 篇 the work of the ...
  • 1 篇 crytek r&d dept ...
  • 1 篇 univ malaga dept...
  • 1 篇 univ pisa dipart...
  • 1 篇 fgan fom ettling...

作者

  • 4 篇 alt helmut
  • 4 篇 scharf ludmila
  • 3 篇 matera guillermo
  • 2 篇 garcia j. c.
  • 2 篇 srinivasan a
  • 2 篇 ezome tony
  • 2 篇 pizarro d.
  • 2 篇 kaski samuel
  • 2 篇 pang jun
  • 2 篇 juan angel a.
  • 2 篇 naor m
  • 2 篇 moran s
  • 2 篇 ciuffoletti a
  • 2 篇 devismes stephan...
  • 2 篇 waissbein ariel
  • 2 篇 solerno pablo
  • 2 篇 schymura daria
  • 2 篇 lercier reynald
  • 2 篇 neil martin
  • 2 篇 noguchi takao

语言

  • 166 篇 英文
  • 5 篇 其他
检索条件"主题词=Probabilistic algorithms"
171 条 记 录,以下是131-140 订阅
DESIGNING PROGRAMS THAT CHECK THEIR WORK
收藏 引用
JOURNAL OF THE ACM 1995年 第1期42卷 269-291页
作者: BLUM, M KANNAN, S UNIV PENN DEPT COMP & INFORMAT SCI PHILADELPHIA PA 19104 USA
A program correctness checker is an algorithm for checking the output of a computation. That is, given a program and an instance on which the program is run, the checker certifies whether the output of the program on ... 详细信息
来源: 评论
RANDOMNESS-OPTIMAL UNIQUE ELEMENT ISOLATION WITH APPLICATIONS TO PERFECT MATCHING AND RELATED PROBLEMS
收藏 引用
SIAM JOURNAL ON COMPUTING 1995年 第5期24卷 1036-1050页
作者: CHARI, S ROHATGI, P SRINIVASAN, A CORNELL UNIV DEPT COMP SCI ITHACA NY 14853 USA
In this paper, we precisely characterize the randomness complexity of the unique element isolation problem, a crucial step in the RNC algorithm for perfect matching by Mulmuley, Vazirani, and Vazirani [Combinatorica, ... 详细信息
来源: 评论
Subquadratic zero-knowledge
收藏 引用
JOURNAL OF THE ACM 1995年 第6期42卷 1169-1193页
作者: Boyar, J Brassard, G Peralta, R UNIV MONTREAL DEPT IRO MONTREAL PQ H3C 3J7 CANADA UNIV WISCONSIN DEPT ELECT ENGN & COMP SCI MILWAUKEE WI 53201 USA
We improve on the communication complexity of zero-knowledge proof systems. Let C be a Boolean circuit of size n. Previous zero-knowledge proof systems for the satisfiability of C require the use of Omega(kn) bit comm... 详细信息
来源: 评论
RELIABILITY VERSUS COST - DESIGN OF A probabilistic BROADCAST ALGORITHM
收藏 引用
DISTRIBUTED COMPUTING 1994年 第3期7卷 115-127页
作者: CIUFFOLETTI, A 1. Dipartimento di Informatica Università degli Studi di Pisa Corso Italia n. 40 I-56100 Pisa Italy
We propose a probabilistic algorithm to solve the problem of distributed broadcast. A simple diffusion algorithm is introduced, and its reliability is evaluated. The cost and reliability of the probabilistic algorithm... 详细信息
来源: 评论
THE MINIMUM SATISFIABILITY PROBLEM
收藏 引用
SIAM JOURNAL ON DISCRETE MATHEMATICS 1994年 第2期7卷 275-283页
作者: KOHLI, R KRISHNAMURTI, R MIRCHANDANI, P SIMON FRASER UNIV SCH COMP SCI BURNABY V5A 1S6 BC CANADA UNIV PITTSBURGH JOSEPH M KATZ SCH BUSINESS PITTSBURGH PA 15260 USA
This paper shows that a minimization version of satisfiability is strongly NP-hard, even if each clause contains no more than two literals and/or each clause contains at most one unnegated variable. The worst-case and... 详细信息
来源: 评论
REASONING ABOUT probabilistic PARALLEL PROGRAMS
收藏 引用
ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS 1994年 第3期16卷 798-842页
作者: RAO, JR IBM Thomas J. Watson Research Center Yorktown Heights NY
The use of randomization in the design and analysis of algorithms promises simple and efficient algorithms to difficult problems, some of which may not have a deterministic solution. This gain in simplicity, efficienc... 详细信息
来源: 评论
Network Orientation
收藏 引用
International Journal of Foundations of Computer Science 1994年 第1期05卷 23-57页
作者: GERARD TEL Department of Computer Science University of Utrecht P.O. Box 80.089 3508 TB Utrecht The Netherlands The work of the author was supported by the ESPRIT Basic Research Action No. 7141 (project ALCOM II: Algorithms and Complexity).
This paper analyses how the symmetry of a processor network influences the existence of a solution for the network orientation problem. The orientation of hypercubes and tori is the problem of assigning labels to each... 详细信息
来源: 评论
BOUNDS ON SAMPLE SPACE SIZE FOR MATRIX PRODUCT VERIFICATION
收藏 引用
INFORMATION PROCESSING LETTERS 1993年 第2期48卷 87-91页
作者: CHINN, DD SINHA, RK Department of Computer Science and Engineering FR-35 University of Washington Seattle WA 98195 USA
We show that the size of any sample space that could be used in Freivalds' probabilistic matrix product verification algorithm for n x n matrices is at least (n - 1)/epsilon if the probability of error is at most ... 详细信息
来源: 评论
RANDOMIZATION FOR ROBOT TASKS - USING DYNAMIC-PROGRAMMING IN THE SPACE OF KNOWLEDGE STATES
收藏 引用
ALGORITHMICA 1993年 第2-4期10卷 248-291页
作者: ERDMANN, M CARNEGIE MELLON UNIV INST ROBOT PITTSBURGH PA 15213 USA
This paper explores the use of randomization as a primitive action in the solution of robot tasks. An example of randomization is the strategy of shaking a bin containing a part in order to orient the part in a desire... 详细信息
来源: 评论
INTRODUCTION TO THE INTERFACE OF PROBABILITY AND algorithms
收藏 引用
STATISTICAL SCIENCE 1993年 第1期8卷 3-9页
作者: ALDOUS, D STEELE, JM UNIV CALIF BERKELEY DEPT STATBERKELEYCA 94720 UNIV PENN WHARTON SCHDEPT STATPHILADELPHIAPA 19104
Probability and algorithms enjoy an almost boisterous interaction that has led to an active, extensive literature that touches fields as diverse as number theory and the design of computer hardware. This article offer... 详细信息
来源: 评论