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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,328 篇 会议
53 篇 期刊文献
1 册 图书

馆藏范围

1,382 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,077 篇 工学
- 1,050 篇 计算机科学与技术...
- 446 篇 软件工程
- 152 篇 信息与通信工程
- 142 篇 电气工程
- 78 篇 控制科学与工程
- 41 篇 网络空间安全
- 23 篇 电子科学与技术（可...
- 7 篇 建筑学
- 6 篇 动力工程及工程热...
- 6 篇 化学工程与技术
- 6 篇 农业工程
- 6 篇 生物工程
- 5 篇 材料科学与工程（可...
- 4 篇 机械工程
- 4 篇 光学工程
- 4 篇 仪器科学与技术
- 4 篇 生物医学工程（可授...
305 篇 理学
- 277 篇 数学
- 72 篇 统计学（可授理学、...
- 17 篇 物理学
- 12 篇 系统科学
- 8 篇 化学
- 8 篇 生物学
68 篇 管理学
- 36 篇 图书情报与档案管...
- 33 篇 管理科学与工程(可...
- 23 篇 工商管理
11 篇 经济学
- 11 篇 应用经济学
10 篇 法学
- 8 篇 社会学
10 篇 教育学
- 10 篇 教育学
6 篇 农学
- 6 篇 作物学
1 篇 医学

主题

243 篇 distributed comp...
94 篇 distributed algo...
82 篇 distributed comp...
34 篇 distributed algo...
29 篇 consensus
25 篇 distributed syst...
24 篇 congest model
23 篇 approximation al...
23 篇 computer systems...
23 篇 algorithms
22 篇 fault tolerance
20 篇 local model
20 篇 distributed grap...
18 篇 shared memory
17 篇 cloud computing
16 篇 message passing
16 篇 self-stabilizati...
14 篇 fault-tolerance
14 篇 lower bounds
13 篇 graph algorithms

机构

27 篇 swiss fed inst t...
25 篇 technion haifa
16 篇 univ freiburg fr...
15 篇 mit cambridge ma...
12 篇 tel aviv univ te...
10 篇 aalto univ espoo
10 篇 natl univ singap...
9 篇 carnegie mellon ...
9 篇 technion dept co...
8 篇 weizmann inst sc...
8 篇 univ michigan an...
8 篇 ben gurion univ ...
8 篇 national univers...
7 篇 cispa helmholtz ...
7 篇 ben gurion univ ...
6 篇 cnrs
5 篇 georgetown univ ...
5 篇 technion
5 篇 department of co...
5 篇 ecole polytech f...

作者

25 篇 kuhn fabian
20 篇 ghaffari mohsen
18 篇 suomela jukka
18 篇 censor-hillel ke...
17 篇 raynal michel
16 篇 elkin michael
16 篇 wattenhofer roge...
16 篇 fraigniaud pierr...
15 篇 pandurangan gopa...
15 篇 brandt sebastian
14 篇 peleg david
14 篇 toueg sam
14 篇 kutten shay
13 篇 patt-shamir boaz
13 篇 guerraoui rachid
12 篇 chang yi-jun
12 篇 balliu alkida
12 篇 rajsbaum sergio
12 篇 maus yannic
12 篇 olivetti dennis

语言

1,356 篇 英文
25 篇 其他
1 篇 中文

检索条件"任意字段=Proceedings of the 2014 ACM symposium on Principles of distributed computing"

共 1382 条记录，以下是201-210 订阅

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

详细简洁

排序：

proceedings of the Annual acm symposium on principles of distributed computing

Proceedings of the Annual ACM Symposium on Principles of Dis...

引用

36th acm symposium on principles of distributed computing, PODC 2017

ISBN: (纸本)9781450349925

The proceedings contain 59 papers. The topics discussed include: exploiting spontaneous transmissions for broadcasting and leader election in radio networks;communication primitives in cognitive radio networks;analyzing contention and backoff in asynchronous shared memory;a layered architecture for erasure-coded consistent distributed storage;seeing is believing: a client-centric specification of database isolation;space complexity of fault-tolerant register emulations;brief announcement: readers of wait-free unbounded registers must write;brief announcement: fast shared counting using (O(n)) compare-and-swap registers;on the multiparty communication complexity of testing triangle-freeness;distributed MST and routing in almost mixing time;brief announcement: optimal address-oblivious epidemic dissemination;a simple deterministic distributed MST algorithm, with near-optimal time and message complexities;distributed approximation of maximum independent set and maximum matching;deterministic distributed (delta + o(delta))-edge-coloring, and vertex-coloring of graphs with bounded diversity;optimal distance labeling schemes for trees;randomized abortable mutual exclusion with constant amortized RMR complexity on the CC model;effectiveness of delaying timestamp computation;ignore or comply? on breaking symmetry in consensus;and greedy routing and the algorithmic small-world phenomenon.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Single-Source Shortest Paths in the CONGEST Model with Improved Bound 20

Single-Source Shortest Paths in the CONGEST Model with Impro...

引用

39th symposium on principles of distributed computing

作者： Chechik, Shiri Mukhtar, Doron Tel Aviv Univ Tel Aviv Israel

ISBN: (纸本)9781450375825

We improve the time complexity of the single-source shortest path problem for weighted directed graphs (with non-negative integer weights) in the Broadcast CONGEST model of distributed computing. For polynomially bounded edge weights, the state-of-the-art algorithm for this problem requires (O) over tilde (min root nD(1/2), root nD(1/4) +n(3/5) + D}) rounds [Forster and Nanongkai, FOCS 2018], which is quite far from the known lower bound of (O) over tilde(root n + D) rounds [Elkin, STOC 2014];here D is the diameter of the underlying network and n is the number of vertices in it. For the approximate version of this problem, Forster and Nanongkai [FOCS 2018] obtained an upper bound of (O) over tilde (root nD(1/4) + D), and stated that achieving the same bound for the exact case remains a major open problem. In this paper we resolve the above mentioned problem by devising a new randomized algorithm for solving (the exact version of) this problem in (O) over tilde(root nD(1/4) + D) rounds. Our algorithm is based on a novel weight-modifying technique that allows us to compute bounded-hop distance approximation that preserves a certain form of the triangle inequality for the edges in the graph.

关键词： Broadcast CONGEST single-source shortest paths distributed algorithms overlay networks

来源：评论

学校读者我要写书评

暂无评论

distributed Edge Coloring in Time Quasi-Polylogarithmic in Delta 20

Distributed Edge Coloring in Time Quasi-Polylogarithmic in D...

引用

39th symposium on principles of distributed computing

作者： Balliu, Alkida Kuhn, Fabian Olivetti, Dennis Univ Freiburg Freiburg Germany

ISBN: (纸本)9781450375825

The problem of coloring the edges of an n-node graph of maximum degree. with 2 Delta - 1 colors is one of the key symmetry breaking problems in the area of distributed graph algorithms. While there has been a lot of progress towards the understanding of this problem, the dependency of the running time on. has been a long-standing open question. Very recently, Kuhn [SODA '20] showed that the problem can be solved in time 2O(root log Delta) + O(log* n). In this paper, we study the edge coloring problem in the distributed LOCAL model. We show that the (degree + 1)-list edge coloring problem, and thus also the (2 Delta- 1)-edge coloring problem, can be solved deterministically in time 2(O(log2 log Delta))+ O(log* n). This is a significant improvement over the result of Kuhn [SODA '20].

关键词： LOCAL model graph problems graph coloring edge coloring

来源：评论

学校读者我要写书评

暂无评论

Distance-2 Coloring in the CONGEST Model 20

Distance-2 Coloring in the CONGEST Model

引用

39th symposium on principles of distributed computing

作者： Halldorsson, Magnus M. Kuhn, Fabian Maus, Yannic Reykjavik Univ ICE TCS Reykjavik Iceland Reykjavik Univ Dept Comp Sci Reykjavik Iceland Univ Freiburg Freiburg Germany Technion Israel Inst Technol Haifa Israel

ISBN: (纸本)9781450375825

We give efficient randomized and deterministic distributed algorithms for computing a distance-2 vertex coloring of a graph G in the CONGEST model. In particular, if Delta is the maximum degree of G, we show that there is a randomized CONGEST model algorithm to compute a distance-2 coloring of G with Delta(2) + 1 colors in O(log Delta . log n) rounds. Further if the number of colors is slightly increased to (1 + epsilon)Delta(2) for some epsilon > 1/polylog n, we show that it is even possible to compute a distance-2 coloring deterministically in polylog n time in the CONGEST model. Finally, we give a O(Delta(2) + log* n)-round deterministic CONGEST algorithm to compute distance-2 coloring with Delta(2) + 1 colors.

关键词： CONGEST model distributed graph coloring distance-2 coloring power graph

来源：评论

学校读者我要写书评

暂无评论

Fine-grained Analysis on Fast Implementations of distributed Multi-writer Atomic Registers 20

Fine-grained Analysis on Fast Implementations of Distributed...

引用

39th symposium on principles of distributed computing

作者： Huang, Kaile Huang, Yu Wei, Hengfeng Nanjing Univ State Key Lab Novel Software Technol Nanjing Jiangsu Peoples R China

ISBN: (纸本)9781450375825

distributed multi-writer atomic registers are at the heart of a large number of distributed algorithms. While enjoying the benefits of atomicity, researchers further explore fast implementations of atomic reigsters which are optimal in terms of data access latency. Though it is proved that multi-writer atomic register implementations are impossible when both read and write are required to be fast, it is still open whether implementations are impossible when only write or read is required to be fast. This work proves the impossibility of fast write implementations based on a series of chain arguments among indistiguishable executions. We also show the necessary and sufficient condition for fast read implementations by extending the results in the single-writer case. This work concludes a series of studies on fast implementations of distributed atomic registers.

关键词： atomicity fast implementation impossibility result chain argument

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Byzantine Agreement with Unknown Participants and Failures 20

Brief Announcement: Byzantine Agreement with Unknown Partici...

引用

39th symposium on principles of distributed computing

作者： Khanchandani, Pankaj Wattenhofer, Roger Swiss Fed Inst Technol Zurich Switzerland

ISBN: (纸本)9781450375825

A set of participants that want to agree on a common opinion despite the presence of malicious or Byzantine participants need to solve an instance of a Byzantine agreement problem. This classic problem has been well studied but most of the existing solutions assume that the participants are aware of n - the total number of participants in the system - and f - the upper bound on the number of Byzantine participants. In this paper, we examine a synchronous system with Byzantine faults where the participants are neither aware of n nor f. The participants have unique identifiers, which are not necessarily consecutive. For such a system, we give algorithms for rotor-coordinator and consensus, both with the resiliency of n > 3f, which is also the optimal resiliency for solving consensus when the participants know n and f. Thus, resiliency is unaffected even if the Byzantine participants can lie about n and f.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

How much does randomness help with locally checkable problems? 20

How much does randomness help with locally checkable problem...

引用

39th symposium on principles of distributed computing

作者： Balliu, Alkida Brandt, Sebastian Olivetti, Dennis Suomela, Jukka Univ Freiburg Freiburg Germany Swiss Fed Inst Technol Zurich Switzerland Aalto Univ Espoo Finland

ISBN: (纸本)9781450375825

Locally checkable labeling problems (LCLs) are distributed graph problems in which a solution is globally feasible if it is locally feasible in all constant-radius neighborhoods. Vertex colorings, maximal independent sets, and maximal matchings are examples of LCLs. On the one hand, it is known that some LCLs benefit exponentially from randomness-for example, any deterministic distributed algorithm that finds a sinkless orientation requires Theta(logn) rounds in the LOCAL model, while the randomized complexity of the problem is Theta(log logn) rounds. On the other hand, there are also many LCLs in which randomness is useless. Previously, it was not known whether there are any LCLs that benefit from randomness, but only subexponentially. We show that such problems exist: for example, there is an LCL with deterministic complexity Theta(log(2) n) rounds and randomized complexity T(logn log logn) rounds.

关键词： locally checkable labeling problems LOCAL model distributed computational complexity

来源：评论

学校读者我要写书评

暂无评论

Fault-Tolerance in distributed Optimization: The Case of Redundancy 20

Fault-Tolerance in Distributed Optimization: The Case of Red...

引用

39th symposium on principles of distributed computing

作者： Gupta, Nirupam Vaidya, Nitin H. Georgetown Univ Dept Comp Sci Washington DC 20057 USA

ISBN: (纸本)9781450375825

This paper considers the problem of Byzantine fault-tolerance in distributed multi-agent optimization. In this problem, each agent has a local cost function. The goal of a distributed optimization algorithm is to allow the agents to collectively compute a minimum of their aggregate cost function. We consider the case when a certain number of agents may be Byzantine faulty. Such faulty agents may not follow a prescribed algorithm, and they may send arbitrary or incorrect information regarding their local cost functions. Unless a fault-tolerance mechanism is employed, traditional distributed optimization algorithms cannot tolerate such faulty agents. A reasonable goal in presence of faulty agents is to minimize the aggregate cost of the non-faulty agents. However, we show that this goal is impossible to achieve unless the cost functions of the non-faulty agents have a minimal redundancy property. We further propose a distributed optimization algorithm that allows the non-faulty agents to obtain a minimum of their aggregate cost if the minimal redundancy property holds. The scope of our algorithm is demonstrated through distributed sensing and learning applications, which are special cases of distributed optimization.

关键词： Cost functions

来源：评论

学校读者我要写书评

暂无评论

2021 principles of distributed computing Doctoral Dissertation Award 21

2021 Principles of Distributed Computing Doctoral Dissertati...

引用

proceedings of the 2021 acm symposium on principles of distributed computing

作者： Marcos K. Aguilera Hagit Attiya Christian Cachin Alessandro Panconesi VMWare Palo Alto CA USA Technion Haifa Israel University of Bern Bern Switzerland Sapienza University of Rome Rome Italy

No abstract available.

ISBN: (纸本)9781450385480

No abstract available.

关键词： principles of distributed computing doctoral dissertation award distributed computing

来源：评论

学校读者我要写书评

暂无评论

Integrating Parallel and distributed computing in Early CS Courses 2022

Integrating Parallel and Distributed Computing in Early CS C...

引用

proceedings of the 53rd acm Technical symposium on Computer Science Education V. 2

作者： Sheikh Ghafoor Sushil Prasad Charles Weems Tennessee Technological University Cookeville TN USA University of Texas San Antonio San Antonio TX USA University of Massachusetts Amherst Amherst MA USA

ISBN: (纸本)9781450390712

Parallel and distributed computing (PDC) has become pervasive in all aspects of computing, and thus it is essential that students include parallelism and distribution in the computational thinking that they apply to problem solving, from the very beginning. Computer science education is still teaching to a 20th century model of algorithmic problem solving. Sequence, branch, and loop are taught in our early courses as the only organizing principles needed for algorithms, and we invest considerable time in showing how best to sequentially process large volumes of data. All computing devices that students use currently have multiple cores as well as GPU in many cases. Most of their favorite applications use multiple cores and numbers of distributed processors. Often concurrency offers simpler solutions than sequential approaches. acm and ABET have recommended including PDC in the undergraduate CS curriculum. However, we are still teaching them to solve problems using sequential thinking. In this workshop we overview the key PDC concepts and provide examples of how they may naturally be incorporated in early CS classes. We will introduce plugged and unplugged curriculum modules that have been successfully integrated in existing CS classes at multiple institutions. We will highlight the upcoming summer training that we are organizing, for which we have funding to support attendance.

关键词： early computing class pdc education hpc education

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共139页 << < 17 18 19 20 21 22 23 24 25 26 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：