检索结果-内蒙古大学图书馆

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

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 条记录，以下是491-500 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Network Size Estimation in Small-World Networks under Byzantine Faults 33

Network Size Estimation in Small-World Networks under Byzant...

引用

33rd IEEE International Parallel and Distributed Processing Symposium (IPDPS)

作者： Chatterjee, Soumyottam Pandurangan, Gopal Robinson, Peter Univ Houston Dept Comp Sci Houston TX 77204 USA McMaster Univ Dept Comp & Software Hamilton ON Canada

ISBN: (纸本)9781728112466

We study the fundamental problem of counting the number of nodes in a sparse network (of unknown size) under the presence of a large number of Byzantine nodes. We assume the full information model where the Byzantine nodes have complete knowledge about the entire state of the network at every round (including random choices made by all the nodes), have unbounded computational power, and can deviate arbitrarily from the protocol. Essentially all known algorithms for fundamental Byzantine problems (e.g., agreement, leader election, sampling) studied in the literature assume the knowledge (or at least an estimate) of the size of the network. It is non-trivial to design algorithms for Byzantine problems that work without knowledge of the network size, especially in bounded-degree (expander) networks where the local views of all nodes are (essentially) the same and limited, and Byzantine nodes can quite easily fake the presence/absence of non-existing nodes. To design truly local algorithms that do not rely on any global knowledge (including network size), estimating the size of the network under Byzantine nodes is an important first step. Our main contribution is a randomized distributed algorithm that estimates the size of a network under the presence of a large number of Byzantine nodes. In particular, our algorithm estimates the size of a sparse, "small-world", expander network with up to O(n(1-delta)) Byzantine nodes, where n is the (unknown) network size and delta > 0 can be be any arbitrarily small (but fixed) constant. Our algorithm outputs a (fixed) constant factor estimate of log(n) with high probability;the correct estimate of the network size will be known to a large fraction ((1 - epsilon)-fraction, for any fixed positive constant) of the honest nodes. Our algorithm is fully distributed, lightweight, and simple to implement, runs in O (log(3) n) rounds, and requires nodes to send and receive messages of only small-sized messages per round;any node's local co

关键词： distributed algorithm counting byzantine behavior randomized algorithm small-world network expander

来源：评论

学校读者我要写书评

暂无评论

A fast distributed approximation algorithm for minimum spanning trees

引用

20th International Symposium on Distributed Computing

作者： Khan, Maleq Pandurangan, Gopal Purdue Univ Dept Comp Sci W Lafayette IN 47907 USA

ISBN: (纸本)3540446249

We present a distributed algorithm that constructs an O(log n)-approximate minimum spanning tree (MST) in any arbitrary network. This algorithm runs in time (O) over tilde (D(G)+L(G, w)) where L(G, w) is a parameter called the local shortest path diameter and D(G) is the (unweighted) diameter of the graph. Our algorithm is existentially optimal (up to polylogarithmic factors), i.e., there exist graphs which need Omega(D(G) + L(G, w)) time to compute an H-approximation to the MST for any H is an element of [1, Theta(log n)]. Our result also shows that there can be a significant time gap between exact and approximate MST computation: there exists graphs in which the running time of our approximation algorithm is exponentially faster than the time-optimal distributed algorithm that computes the MST. Finally, we show that our algorithm can be used to find an approximate MST in wireless networks and in random weighted networks in almost optimal (O) over tilde (D(G)) time.

关键词： minimum spanning tree distributed approximation algorithm randomized algorithm

来源：评论

学校读者我要写书评

暂无评论

COMBINING BIASED RANDOM SAMPLING WITH METAHEURISTICS FOR THE FACILITY LOCATION PROBLEM IN DISTRIBUTED COMPUTER SYSTEMS

COMBINING BIASED RANDOM SAMPLING WITH METAHEURISTICS FOR THE...

引用

Winter Simulation Conference

作者： Cabrera, Guillem Gonzalez-Martin, Sergio Juan, Angel A. Marques, Joan M. Grasman, Scott E. Univ Oberta Catalunya IN3 Dept Comp Sci Barcelona 08018 Spain Rochester Inst Technol Ind & Syst Engn Dept Rochester NY 14623 USA

ISBN: (纸本)9781479974863

yThis paper introduces a probabilistic algorithm for solving the well-known Facility Location Problem (FLP), an optimization problem frequently encountered in practical applications in fields such as Logistics or Telecommunications. Our algorithm is based on the combination of biased random sampling -using a skewed probability distribution-with a metaheuristic framework. The use of random variates from a skewed distribution allows to guide the local search process inside the metaheuristic framework which, being a stochastic procedure, is likely to produce slightly different results each time it is run. Our approach is validated against some classical benchmarks from the FLP literature and it is also used to analyze the deployment of service replicas in a realistic Internet-distributed system.

关键词： Internet facility location randomised algorithms sampling methods statistical distributions stochastic processes FLP Internet-distributed system biased random sampling distributed computer systems facility location problem local search process metaheuristic framework optimization problem randomized algorithm service replica deployment skewed probability distribution stochastic procedure Abstracts Benchmark testing Computer architecture

来源：评论

学校读者我要写书评

暂无评论

Dynamic Maximal Matching in Clique Networks 15

Dynamic Maximal Matching in Clique Networks

引用

15th Innovations in Theoretical Computer Science Conference (ITCS)

作者： Li, Minming Robinson, Peter Zhu, Xianbin City Univ Hong Kong Dept Comp Sci Hong Kong Peoples R China Augusta Univ Sch Comp & Cyber Sci Augusta GA 30912 USA

ISBN: (纸本)9783959773096

We consider the problem of computing a maximal matching with a distributed algorithm in the presence of batch-dynamic changes to the graph topology. We assume that a graph of n nodes is vertex-partitioned among k players that communicate via message passing. Our goal is to provide an efficient algorithm that quickly updates the matching even if an adversary determines batches of edge insertions or deletions. We first show a lower bound of Q ( k) rounds for recomputing a matching assuming an oblivious adversary who is unaware of the initial (random) vertex partition as well as the current state of the players, and a stronger lower bound of Q( k rounds against an adaptive adversary, who may choose any balanced (but not necessarily random) vertex partition initially and who knows the current state of the players. We also present a randomized algorithm that has an initialization time of 0 log n) rounds, while achieving an update time that that is independent of n: In more detail, the update time is 0( N1 log k) against an oblivious adversary, who must fix all updates in advance. If we consider the stronger adaptive adversary, the update time becomes 0 ([1 log k) rounds.

关键词： distributed graph algorithm dynamic network maximal matching randomized algorithm lower bound

来源：评论

学校读者我要写书评

暂无评论

The Complexity of Leader Election: A Chasm at Diameter Two 18

The Complexity of Leader Election: A Chasm at Diameter Two

引用

19th International Conference on Distributed Computing and Networking (ICDCN)

作者： Chatterjee, Soumyottam Pandurangan, Gopal Robinson, Peter Univ Houston Dept Comp Sci Houston TX 77204 USA Royal Holloway Univ London Dept Comp Sci Egham Surrey England

ISBN: (纸本)9781450363723

Leader election is one of the fundamental problems in distributed computing. In its implicit version, only the leader must know who is the elected leader. This paper focuses on studying the message complexity of leader election in synchronous distributed networks, in particular, in networks of diameter two. Kutten et al. [JACM 2015] showed a fundamental lower bound of Omega (m) (m is the number of edges in the network) on the message complexity of (implicit) leader election that applied also to Monte Carlo randomized algorithms with constant success probability;this lower bound applies for graphs that have diameter at least three. On the other hand, for complete graphs (i.e., diameter 1), Kutten et al. [TCS 2015] established a tight bound of (Theta) over tilde(root n)(1) on the message complexity of randomized leader election (n is the number of nodes in the network). For graphs of diameter two, the complexity was not known. In this paper, we settle this complexity by showing a tight bound of (Theta) over tilde (n) on the message complexity of leader election in diameter two networks. We first give a simple randomized Monte-Carlo leader election algorithm that with high probability (i.e., probability at least 1 - n(-c), for some positive constant c) succeeds and uses O (n log(3) n) messages and runs in O(1) rounds;this algorithm works without knowledge of n (and hence needs no global knowledge). We then show that any algorithm (even Monte Carlo randomized algorithms with large enough constant success probability) needs Omega(n) messages (even when n is known), regardless of the number of rounds. We also present an O(n log n) messages deterministic algorithm that takes O(log n) rounds (but needs knowledge of n);we show that this message complexity is tight for deterministic algorithms. Our results show that leader election can be solved in diameter two graphs in (essentially) linear (in n) message complexity and thus the Omega(m) lower bound does not apply to diamete

关键词： Distributed algorithm Leader Election randomized algorithm Message Complexity Time Complexity Lower Bounds

来源：评论

学校读者我要写书评

暂无评论

Asymptotic Efficiency of Distributed Random Sampling algorithm 38

Asymptotic Efficiency of Distributed Random Sampling Algorit...

引用

38th Chinese Control Conference (CCC)

作者： Liu, Qian He, Xingkang Fang, Haitao Chinese Acad Sci Acad Math & Syst Sci LSC Beijing 100190 Peoples R China Univ Chinese Acad Sci Sch Math Sci Beijing 100049 Peoples R China KTH Royal Inst Technol Sch Elect Engn & Comp Sci ACCESS Linnaeus Ctr SE-10044 Stockholm Sweden

ISBN: (纸本)9789881563972

In this paper, we focus on estimating the distribution of underlying parameter over random networks through reconstructing the empirical distribution of initial samples, which can be viewed as a particular average consensus problem. A class of quantized communication protocol, in which neighbors exchange information randomly selected based on the current estimate, is considered. To improve the convergence rate of this distributed random sampling algorithm, we introduce the Polyak average scheme, and show that asymptotic efficiency can be achieved through the averaging technique under proper conditions. The results show that the minimum limit covariance matrix of estimation error can be reached. i.e., the proposed algorithm achieves the highest possible rate of convergence. Finally, we provide a numerical simulation to validate the theoretical results of this work.

关键词： Average consensus distributed computation randomized algorithm asymptotic efficiency

来源：评论

学校读者我要写书评

暂无评论

Computing the Implicit Voronoi Diagram in Triple Precision

引用

11th International Workshop on algorithms and Data Structures (WADS 2009)

作者： Millman, David L. Snoeyink, Jack Univ N Carolina Dept Comp Sci Chapel Hill NC 27599 USA

ISBN: (纸本)9783642033667

In a paper that considered arithmetic precision as a limited resource in the design and analysis of algorithms, Liotta, Preparata and Tamassia defined an "implicit Voronoi diagram" supporting logarithmic-time proximity queries using predicates of twice the precision of the input and query coordinates. They reported, however, that computing this diagram uses five times the input precision. We define a reduced-precision Voronoi diagram that similarly supports proximity queries, and describe a randomized incremental construction using only three times the input precision. The expected construction time is O(n(log n + log mu)), where mu is the length of the longest Voronoi edge;we can construct the implicit Voronoi from the reduced-precision Voronoi in linear time.

关键词： Voronoi diagram Low-degree primitives randomized algorithm Robust computation

来源：评论

学校读者我要写书评

暂无评论

Solving Simple Stochastic Games with Few Random Nodes Faster Using Bland's Rule 36

Solving Simple Stochastic Games with Few Random Nodes Faster...

引用

36th International Symposium on Theoretical Aspects of Computer Science (STACS)

作者： Auger, David Coucheney, Pierre Strozecki, Yann Univ Versailles St Quentin En Yvelines DAVID Lab Versailles France

ISBN: (纸本)9783959771009

The best algorithm so far for solving Simple Stochastic Games is Ludwig's randomized algorithm [21] which works in expected 2(O(root n)) time. We first give a simpler iterative variant of this algorithm, using Bland's rule from the simplex algorithm, which uses exponentially less random bits than Ludwig's version. Then, we show how to adapt this method to the algorithm of Gimbert and Horn [15] whose worst case complexity is O(k!), where k is the number of random nodes. Our algorithm has an expected running time of 2(O(k)), and works for general random nodes with arbitrary outdegree and probability distribution on outgoing arcs.

关键词： simple stochastic games randomized algorithm parametrized complexity strategy improvement Bland's rule

来源：评论

学校读者我要写书评

暂无评论

Monitoring schedules for randomly deployed sensor networks without geographic information

Monitoring schedules for randomly deployed sensor networks w...

引用

12th International Symposium on Pervasive Systems, algorithms, and Networks (I-SPAN)

作者： Calinescu, G. IIT Dept Comp Sci Chicago IL 60616 USA

ISBN: (纸本)9780769549309

Given n sensors and m targets, a monitoring schedule is a partition of the sensor set such that each part of the partition can monitor all targets. Monitoring schedules are used to maximize the time all targets are monitored when there is no possibility of replacing the batteries of the sensors. Each part of the partition is used for one unit of time, and thus the goal is to maximize the number of parts in the partition. We present distributed algorithms for Monitoring Schedule under the following assumptions: 1) identical sensors can each monitor all targets within a certain radius, 2) the n sensors are randomly distributed uniformly in a large square containing the targets, 3) the number of sensors is high enough given the area the square, and 4) the communication range is at least a constant times the the sensing range. We present randomized distributed algorithms that achieve a constant factor approximation in polylogarithmic number of communication rounds, with high probability. These results hold if we make one of the following two assumptions: 1) any two sensors within communication range are able to estimate within a constant their relative distance, or 2) the communication range is an exact fraction of the sensing range. We improve the results of Calinescu and Ellis (DIAL M-POMC '08) by eliminating the assumption that the communication range must be twice the sensing range, and by this result holding with fewer sensors.

关键词： wireless network distributed algorithm randomized algorithm area monitoring

来源：评论

学校读者我要写书评

暂无评论

SUPPORT VECTOR MACHINE (SVM) FOR ENGLISH HANDWRITTEN CHARACTER RECOGNITION

SUPPORT VECTOR MACHINE (SVM) FOR ENGLISH HANDWRITTEN CHARACT...

引用

2nd International Conference on Computer Engineering and Applications

作者： Nasien, Dewi Haron, Habibollah Yuhaniz, Siti Sophiayati Univ Teknol Malaysia Dept Modeling & Ind Comp Johor Baharu Malaysia

ISBN: (纸本)9780769539829

This paper proposes a recognition model for English handwritten (lowercase, uppercase and letter) character recognition that uses Freeman chain code (FCC) as the representation technique of an image character. Chain code representation gives the boundary of a character image in which the codes represent the direction of where is the location of the next pixel. An FCC method that uses 8-neighbourhood that starts from direction labelled as 1 to 8 is used. randomized algorithm is used to generate the FCC. After that, features vector is built. The criteria of features to input the classification is the chain code that converted to 64 features. Support vector machine (SVM) is chosen for the classification step. NIST Databases are used as the data in the experiment. Our test results show that by applying the proposed model, we reached a relatively high accuracy for the problem of English handwritten recognition.

关键词： Freeman chain code (FCC) Heuristic method randomized algorithm features vector Support vector machine (SVM)

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共63页 << < 46 47 48 49 50 51 52 53 54 55 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：