咨询与建议

限定检索结果

文献类型

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

馆藏范围

  • 627 篇 电子文献
  • 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 篇 军事学

主题

  • 627 篇 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 篇 英文
  • 36 篇 其他
  • 5 篇 中文
  • 1 篇 德文
检索条件"主题词=randomized algorithm"
627 条 记 录,以下是561-570 订阅
排序:
Efficient randomized routing algorithms on the two-dimensional mesh of buses
收藏 引用
THEORETICAL COMPUTER SCIENCE 2001年 第2期261卷 227-239页
作者: Iwama, K Miyano, E Tajima, S Tamaki, H Kyushu Inst Design Fukuoka 8158540 Japan Kyoto Univ Sch Informat Kyoto 6068501 Japan Toshiba Co Ltd Ctr Res & Dev Syst & Software Res Labs Kawasaki Kanagawa 2108501 Japan Meiji Univ Dept Comp Sci Kawasaki Kanagawa 2148571 Japan
The mesh of buses (MBUS) is a parallel computation model which consists of n x n processors, II row buses and n column buses but no local connections between two neighboring processors. As for deterministic (permutati... 详细信息
来源: 评论
Efficient randomized routing algorithms on the two-dimensional mesh of buses  4th
收藏 引用
4th Annual International Computing and Combinatorics Conference (COCOON 98)
作者: Iwama, K Miyano, E Tajima, S Tamaki, H Kyushu Inst Design Fukuoka 8158540 Japan Kyoto Univ Sch Informat Kyoto 6068501 Japan Toshiba Co Ltd Ctr Res & Dev Syst & Software Res Labs Kawasaki Kanagawa 2108501 Japan Meiji Univ Dept Comp Sci Kawasaki Kanagawa 2148571 Japan
The mesh of buses (MBUS) is a parallel computation model which consists of n x n processors, II row buses and n column buses but no local connections between two neighboring processors. As for deterministic (permutati... 详细信息
来源: 评论
A general method for geometric feature matching and model extraction
收藏 引用
INTERNATIONAL JOURNAL OF COMPUTER VISION 2001年 第1期45卷 39-54页
作者: Olson, CF Univ Washington Dept Comp & Software Syst Bothell WA 98011 USA
Popular algorithms for feature matching and model extraction fall into two broad categories: generate-and-test and Hough transform variations. However, both methods suffer from problems in practical implementations. G... 详细信息
来源: 评论
Tree search on an atomic model for message passing
收藏 引用
SIAM JOURNAL ON COMPUTING 2001年 第1期31卷 67-85页
作者: Liu, PF Aiello, W Bhatt, S Natl Taiwan Univ Dept Comp Sci & Informat Engn Taipei 106 Taiwan AT&T Labs Res AT&T Shannon Ctr Florham Pk NJ 07932 USA Akamai Technol Inc Cambridge MA 02139 USA
This paper presents a simple atomic model of message-passing multicomputers. Within one synchronous time step each processor can receive one atomic message, perform local computation, and send one message. When severa... 详细信息
来源: 评论
Anycast service model and its QoS routing algorithm
收藏 引用
Journal of Central South University 2001年 第2期8卷 135-139页
作者: WANG Jian xin, CHEN Song qiao, CHEN Jian er (College of Information Science and Engineering, Central South University, Changsha 410083, China) 1. College of Information Science and Engineering Central South University 410083 Changsha China
In the Internet, a group of replicated servers is commonly used in order to improve the scalability of network service. Anycast service is a new network service that can improve network load distribution and simplify ... 详细信息
来源: 评论
Constrained robustness analysis by randomized algorithms
收藏 引用
IEEE TRANSACTIONS ON AUTOMATIC CONTROL 2000年 第6期45卷 1180-1186页
作者: Chen, XJ Zhou, KM Louisiana State Univ Dept Elect & Comp Engn Baton Rouge LA 70803 USA
This paper shows that many robust control problems can be formulated as constrained optimization problems and can be tackled by using randomized algorithms. Two different approaches in searching reliable solutions to ... 详细信息
来源: 评论
Using randomized algorithms for digital mock-up in automotive industry
收藏 引用
Mexican International Conference on Artificial Intelligence (MICAI 2000)
作者: Bietzker, B Karch, O Noltemeier, H ISA Tools GMBH D-70567 Stuttgart Germany Univ Wurzburg Dept Comp Sci 1 D-97074 Wurzburg Germany
An automobile consists of a large number of component parts that must be assembled. Even if all parts precisely fit together, it is not clear whether they can be assembled or not. The process of finding a suitable ass... 详细信息
来源: 评论
A randomized QoS Routing algorithm On Networks with Inaccurate Link-State Information
A Randomized QoS Routing Algorithm On Networks with Inaccura...
收藏 引用
2000 International Conference on Communication Technology(WCC2000·ICCT2000)
作者: Wang Jianxin Wang Weiping Chen Jianer Chen Songqiao College of Information Engineering Central South University of Technology Changsha
The quality of network services is directly affected by QoS routing algorithms,and QoS routing algorithms rely heavily on network state information specifying the resource availability at network nodes and *** practic... 详细信息
来源: 评论
Selecting the k largest elements with parity tests
收藏 引用
DISCRETE APPLIED MATHEMATICS 2000年 第1-3期101卷 187-196页
作者: Lam, TW Ting, HF Univ Hong Kong Dept Comp Sci & Informat Syst Hong Kong Hong Kong Peoples R China
In this paper we study the problem of finding the k largest elements of n distinct real numbers. We give a pure combinatorial argument to prove that n + (k - 1)log n + O(1) queries are necessary for any deterministic ... 详细信息
来源: 评论
Two decentralized algorithms for strong interaction fairness for systems with unbounded speed variability
收藏 引用
THEORETICAL COMPUTER SCIENCE 2000年 第1-2期243卷 307-338页
作者: Joung, YJ Natl Taiwan Univ Dept Informat Management Taipei 10764 Taiwan
We present two randomized algorithms, one for message passing and the other for shared memory, that, with probability 1, schedule multiparty interactions in a strongly fair manner. Both algorithms improve upon a previ... 详细信息
来源: 评论