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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

4,033 篇 会议
2,063 篇 期刊文献
34 篇 学位论文

馆藏范围

6,130 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

3,830 篇 工学
- 2,087 篇 计算机科学与技术...
- 1,865 篇 电气工程
- 930 篇 信息与通信工程
- 899 篇 控制科学与工程
- 364 篇 软件工程
- 153 篇 仪器科学与技术
- 146 篇 电子科学与技术（可...
- 134 篇 机械工程
- 70 篇 交通运输工程
- 39 篇 石油与天然气工程
- 21 篇 网络空间安全
- 19 篇 动力工程及工程热...
- 15 篇 土木工程
- 15 篇 测绘科学与技术
- 11 篇 生物医学工程（可授...
- 8 篇 材料科学与工程（可...
- 7 篇 航空宇航科学与技...
652 篇 理学
- 342 篇 数学
- 269 篇 系统科学
- 70 篇 物理学
- 18 篇 生物学
- 8 篇 统计学（可授理学、...
- 7 篇 化学
232 篇 管理学
- 224 篇 管理科学与工程(可...
- 9 篇 图书情报与档案管...
36 篇 医学
- 31 篇 临床医学
- 11 篇 特种医学
20 篇 文学
- 20 篇 新闻传播学
10 篇 经济学
- 7 篇 理论经济学
6 篇 军事学
- 6 篇 军队指挥学
3 篇 教育学
2 篇 农学
1 篇 艺术学

主题

6,130 篇 distributed algo...
553 篇 convergence
532 篇 wireless sensor ...
528 篇 algorithm design...
409 篇 optimization
382 篇 computer science
368 篇 distributed comp...
363 篇 network topology
331 篇 routing
279 篇 resource managem...
218 篇 computational mo...
218 篇 protocols
207 篇 computer network...
206 篇 costs
198 篇 approximation al...
196 篇 fault tolerance
187 篇 ad hoc networks
182 篇 bandwidth
180 篇 peer to peer com...
180 篇 interference

机构

24 篇 carnegie mellon ...
19 篇 univ illinois de...
19 篇 cent south univ ...
19 篇 nanyang technol ...
19 篇 univ cyprus dept...
16 篇 ege univ int com...
16 篇 univ minnesota d...
16 篇 mit cambridge ma...
15 篇 univ liverpool d...
14 篇 suny stony brook...
14 篇 swiss fed inst t...
14 篇 northeastern uni...
14 篇 purdue univ sch ...
12 篇 univ penn dept e...
12 篇 department of el...
12 篇 weizmann inst sc...
11 篇 department of in...
11 篇 georgia state un...
11 篇 purdue univ sch ...
11 篇 univ cyprus dept...

作者

38 篇 hadjicostis chri...
23 篇 kowalski dariusz...
21 篇 hong yiguang
21 篇 notarstefano giu...
20 篇 dagdeviren orhan
20 篇 scutari gesualdo
18 篇 dominguez-garcia...
17 篇 deng zhenhua
17 篇 pandurangan gopa...
17 篇 mosbah mohamed
16 篇 christoforos n. ...
16 篇 khan usman a.
16 篇 schmid stefan
16 篇 sharma gokarna
15 篇 peleg david
15 篇 korman amos
15 篇 navarra alfredo
15 篇 mou shaoshuai
15 篇 zeng xianlin
15 篇 cortes jorge

语言

6,029 篇 英文
58 篇 其他
38 篇 中文
4 篇 德文
1 篇 法文
1 篇 葡萄牙文
1 篇 俄文
1 篇 土耳其文

检索条件"主题词=DISTRIBUTED algorithms"

共 6130 条记录，以下是51-60 订阅

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

详细简洁

排序：

distributed algorithms for Resource Allocation in Cellular Networks with Coexisting Femto- and Macrocells

Distributed Algorithms for Resource Allocation in Cellular N...

引用

54th Annual IEEE Global Telecommunications Conference (GLOBECOM)

作者： Shi, Yongsheng MacKenzie, Allen B. Virginia Tech Bradley Dept Elect & Comp Engn Blacksburg VA 24061 USA

ISBN: (纸本)9781424492688

This paper introduces two distributed algorithms for resource allocation in cellular networks with coexisting femtocells and macrocells. Network interference in these complex networks is modeled by a random graph to maintain the complexity of the examined networks' interference scenarios while abstracting away details such as node density and propagation characteristics. We propose two distributed algorithms for interference-free resource assignment: An uncoordinated algorithm designed for a case with no communications between base stations, and a coordinated algorithm designed to exploit information sharing between base stations. We assess the two algorithms by comparing their performance against a centralized heuristic algorithm and a centralized genetic algorithm, which together approximate the (computationally intractable) optimal allocation.

关键词： Algorithm design and analysis distributed algorithms Femtocells Interference Macrocell networks Resource management Sensors cellular networks cellular radio centralized genetic algorithm centralized heuristic algorithm distributed algorithms distributed algorithms femtocells genetic algorithms graph colouring interference suppression interference-free resource assignment macrocells network interference random graph resource allocation resource allocation

来源：评论

学校读者我要写书评

暂无评论

distributed algorithms for multi-robot systems

Distributed algorithms for multi-robot systems

引用

6th International Symposium on Information Processing Sensor Networks

作者： McLurkin, James MIT CSAIL Cambridge MA 02139 USA

This demonstration showcases distributed algorithms for configuration control in multi-robot systems.. These algorithms include examples of gradient communication, clustering and dispersion, group motion, and network ... 详细信息

ISBN: (纸本)9781595936387

关键词： distributed algorithms multi-robot systems

来源：评论

学校读者我要写书评

暂无评论

distributed algorithms for Opportunistic Spectrum Access in Decentralized Cognitive Radio Network 10

Distributed Algorithms for Opportunistic Spectrum Access in ...

引用

10th International Conference on Communication Systems and Networks (COMSNETS)

作者： Kumar, Rohit NIT Delhi ECE Dept Delhi India

ISBN: (纸本)9781538611821

The opportunistic spectrum access (OSA) algorithms aim to maximize network throughput by ensuring orthogonal channel allocation among secondary users (SUs) in cognitive radio network (CRN). OSA is challenging in the decentralized CRN due to lack of coordination among SUs. Most of the existing algorithms assume prior knowledge of the number of active SUs to guarantee orthogonalization. In addition, they assume static network only where all SUs stay in the network throughout the horizon which is not feasible in practical conditions. However the dynamic network may also exist where the SUs can enter or exit the network at any time. Also, most of the existing algorithms assume an i.i.d. reward model whereas a markovian model may be more appropriate where the rewards are assumed to come from a finite, irreducible and aperiodic Markov chain represented by a single parameter probability transition matrix. Thus, our goal is to design a distributed algorithm for decentralized static and dynamic network without prior knowledge of the number of active SUs with i.i.d. as well as markovian reward model.

关键词： Heuristic algorithms Erbium Channel estimation distributed algorithms Cognitive radio Signal processing algorithms Throughput

来源：评论

学校读者我要写书评

暂无评论

distributed algorithms for Green IP Networks

Distributed Algorithms for Green IP Networks

引用

IEEE Conference on Computer Communications (INFOCOM)

作者： Bianzino, Aruna Prem Chiaraviglio, Luca Mellia, Marco Consorzio Nazl Interuniv Telecomunicaz Turin Italy

ISBN: (纸本)9781467310161

We propose a novel distributed approach to exploit sleep mode capabilities of links in an Internet Service Provider network. Differently from other works, neither a central controller, nor the knowledge of the current traffic matrix is assumed, favoring a major step towards making sleep mode enabled networks practical in the current Internet architecture. Our algorithms are able to automatically adapt the state of network links to the actual traffic in the network. Moreover, the required input parameters are intuitive and easy to set. Extensive simulations that consider a real network and traffic demand prove that our algorithms are able to follow the daily variation of traffic, reducing energy consumption up to 70% during off peak time, with little overheads and while guaranteeing Quality of Service constraints.

关键词： distributed algorithms Internet Protocol networks flow matrix central controller sleeping mode traffic network Travel demand DAILY VARIATIONS Intuitive input parameter off peak internet service providers algorithms energy consumption

来源：评论

学校读者我要写书评

暂无评论

distributed algorithms for the Graph Biconnectivity and Least Common Ancestor Problems 36

Distributed Algorithms for the Graph Biconnectivity and Leas...

引用

36th IEEE International Parallel and distributed Processing Symposium (IEEE IPDPS)

作者： Bogle, Ian Slota, George M. Rensselaer Polytech Inst Comp Sci Dept Troy NY 12180 USA

ISBN: (纸本)9781665497473

Graph connectivity analysis is one of the primary ways to analyze the topological structure of social networks. Graph biconnectivity decompositions are of particular interest due to how they identify cut vertices and cut edges in a network. We present the first, to our knowledge, implementation of a distributed-memory parallel biconnectivity algorithm. As part of our algorithm, we also require the computation of least common ancestors (LCAs) of non-tree edge endpoints in a BFS tree. As such, we also propose a novel distributed algorithm for the LCA problem. Using our implementations, we observe up to a 14.8 x speedup from 1 to 128 MPI ranks for computing a biconnectivity decomposition.

关键词： distributed processing Social networking (online) Conferences distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

distributed algorithms for TDMA Link Scheduling in Sensor Networks

Distributed Algorithms for TDMA Link Scheduling in Sensor Ne...

引用

26th IEEE International Parallel and distributed Processing Symposium (IPDPS) / Workshop on High Performance Data Intensive Computing

作者： Alsulaiman, Thamer Prasad, Sushil K. Zelikovsky, Alexander Georgia State Univ Dept Comp Sci Atlanta GA 30303 USA

ISBN: (纸本)9780769546766

The paper is devoted to Time Division Multiple Access Link Scheduling Protocols in wireless sensor networks for full duplex (two-way) communication, where each sensor is scheduled on an incident link as a transmitter and as a receiver in two different time slots. We formulate the full duplex link scheduling problem (FDLSP) as distance-2 edge coloring in bi-directed graphs. We proves that there exists Delta-approximation algorithm for FDLSP (Delta being the maximum node degree in the network). Then, we present two distributed algorithms. The first is a synchronous algorithm based on finding maximal independent sets. The second is an asynchronous depth first search (DFS) algorithm. The maximal independent set based algorithm requires only O(Delta log*n) communication rounds (where n is the number of processors in the network) for growth bounded graphs, which is a realistic geometric model of sensor networks. For general graphs, the maximal independent set based algorithm requires O(Delta(4) + Delta(3)log*n) communication rounds, improving upon the previous best algorithm with O(n Delta(2) + n(2)m) communication rounds (where m is the number of links in the network). The asynchronous DFS based algorithm requires only O(n) communication rounds for both general and growth bounded graphs. The simulations show that the proposed algorithms assign on average equal or fewer number of time slots compared to the best known distributed algorithm while being significantly faster.

关键词： distributed algorithms Depth--first search Communication Research Sensor networks colored graph algorithms Rounding off network links

来源：评论

学校读者我要写书评

暂无评论

distributed algorithms for Planar Networks I: Planar Embedding 16

Distributed Algorithms for Planar Networks I: Planar Embeddi...

引用

35th ACM SIGACT-SIGOPS Symposium on Principles of distributed Computing (PODC)

作者： Ghaffari, Mohsen Haeupler, Bernhard MIT Cambridge MA 02139 USA CMU Pittsburgh PA USA

ISBN: (纸本)9781450339643

This paper presents the first (non-trivial) distributed planar embedding algorithm. We consider this a crucial first step in a broader program to design efficient distributed algorithms for planar networks. We work in the standard distributed model in which nodes can send an O (log n)-bit message to each of their neighbors per round. In a planar network, with n nodes and diameter D, our deterministic planar embedding algorithm uses O (D . min{log n, D}) rounds to compute a combinatorial planar embedding, which consists of each node knowing the clockwise order of its incident edges in a fixed planar drawing. The complexity of our algorithm is near-optimal and matches the trivial lower bound of Omega(D) up to a log n factor. No algorithm outperforming the trivial round complexity of O(n) was known prior to this work.

关键词： network optimization distributed algorithms planar embedding

来源：评论

学校读者我要写书评

暂无评论

distributed algorithms for Joint Routing and Frame Aggregation in 802.11n Wireless Mesh Networks

Distributed Algorithms for Joint Routing and Frame Aggregati...

引用

IEEE 27th International Parallel and distributed Processing Symposium (IPDPS)

作者： Gong, Dawei Yang, Yuanyuan SUNY Stony Brook Dept Elect & Comp Engn Stony Brook NY 11794 USA

ISBN: (纸本)9780769549712

A wireless mesh network (WMN) is a special type of wireless ad-hoc network, which consists of mesh clients, mesh routers and gateways to the Internet, organized in a mesh topology. The mesh clients are often laptops, cell phones and other wireless devices. Mesh routers forward traffic between mesh clients and gateways. Despite a number of promising features provided by WMNs, such as low deployment cost, self-healing, etc., the throughput of WMNs is often limited by severe congestion and collisions, and thus cannot satisfy the increasing traffic demands of numerous applications. In this paper, we study how to maximize the throughput of IEEE 802.11n WMNs by joint routing and frame aggregation. Frame aggregation is to aggregate multiple frames into a large frame before transmission, to reduce communication overhead and alleviate collisions. We first show that previous frame aggregation strategies cannot achieve optimal network throughput. We then formulate the joint problem into a linear programming (LP) problem by considering traffic in the network as flow. As most previous algorithms for LP are centralized and difficult to deploy in large-scale WMNs, we propose a distributed algorithm to solve the formulated problem, in which each mesh router determines the amount of traffic flow for its adjacent links based on the traffic information of neighbors and interfering links. However, in realistic 802.11n WMNs, traffic is transmitted in frames instead of flow, and the traffic to different routers needs to be distinguished. Thus, we further provide an algorithm to determine the routing and frame aggregation strategy for each mesh router, using the traffic flow derived from the first algorithm. We have conducted extensive simulations to evaluate the proposed algorithms and the results demonstrate that the network throughput can be significantly improved compared with existing schemes.

关键词： distributed algorithms IEEE 802.11n Wireless mesh networks (WMNs) Routing Frame aggregation

来源：评论

学校读者我要写书评

暂无评论

distributed algorithms for Shape Sculpting of Lattice-Arrayed Modular Robots via Hole Motion

Distributed Algorithms for Shape Sculpting of Lattice-Arraye...

引用

10th IEEE International Conference on Control and Automation (IEEE ICCA)

作者： Zhu, Jingwei Chen, Michael Z. Q. Su, Housheng Univ Hong Kong Dept Mech Engn Hong Kong Hong Kong Peoples R China Huazhong Univ Sci & Technol Dept Control Sci & Engn Huazhong Peoples R China

ISBN: (纸本)9781467347082;9781467347075

A self-reconfigurable modular robot can change its own shape by rearranging the connectivity of the modules of which it is composed. In this paper, we focus on a two-dimensional lattice-arrayed self-reconfigurable modular robotic system. Each module can move to a neighboring lattice under certain motion constraints, communicate with its neighbors and act upon local knowledge only. A scalable shape sculpting algorithm based on the manipulation of regularly shaped voids within the lattice ("holes") is given. We present detailed solutions to the conflict test and settlement problem encountered when applying this algorithm, and make improvement on the efficiency of shape sculpting. We believe that the algorithm can potentially generalize to 3D and scale to handle millions of modules.

关键词： distributed algorithms multi-robot systems

来源：评论

学校读者我要写书评

暂无评论

distributed algorithms for Fractional Coloring 28th

Distributed Algorithms for Fractional Coloring

引用

28th International Colloquium on Structural Information and Communication Complexity (SIROCCO)

作者： Bousquet, Nicolas Esperet, Louis Pirot, Francois Univ Claude Bernard Lyon 1 Lab LIRIS CNRS UMR 5205 Lyon France Univ Grenoble Alpes Lab G SCOP CNRS Grenoble France

ISBN: (纸本)9783030795269;9783030795276

In this paper we study fractional coloring from the angle of distributed computing. Fractional coloring is the linear relaxation of the classical notion of coloring, and has many applications, in particular in scheduling. It was proved by Hasemann, Hirvonen, Rybicki and Suomela [19] that for every real alpha > 1 and integer Delta, a fractional coloring of total weight at most alpha(Delta + 1) can be obtained deterministically in a single round in graphs of maximum degree Delta, in the LOCAL model of computation. However, a major issue of this result is that the output of each vertex has unbounded size. Here we prove that even if we impose the more realistic assumption that the output of each vertex has constant size, we can find fractional colorings of total weight arbitrarily close to known tight bounds for the fractional chromatic number in several cases of interest. More precisely, we show that for any fixed epsilon > 0 and Delta, a fractional coloring of total weight at most Delta+epsilon can be found in Omega(log* n) rounds in graphs of maximum degree Delta with no K Delta+1, while finding a fractional coloring of total weight at most Delta in this case requires Omega(log log n) rounds for randomized algorithms and Omega(log n) rounds for deterministic algorithms. We also show how to obtain fractional colorings of total weight at most 2+ epsilon in grids of any fixed dimension, for any epsilon > 0, in O(log* n) rounds. Finally, we prove that in sparse graphs of large girth from any proper minor-closed family we can find a fractional coloring of total weight at most 2+ epsilon, for any epsilon > 0, in O(log n) rounds.

关键词： Fractional coloring Graph coloring distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 2 3 4 5 6 7 8 9 10 11 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：