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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,032 篇 会议
2,167 篇 期刊文献
34 篇 学位论文

馆藏范围

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

日期分布

学科分类号

3,925 篇 工学
- 2,158 篇 计算机科学与技术...
- 1,870 篇 电气工程
- 955 篇 信息与通信工程
- 908 篇 控制科学与工程
- 407 篇 软件工程
- 156 篇 仪器科学与技术
- 155 篇 电子科学与技术（可...
- 137 篇 机械工程
- 72 篇 交通运输工程
- 40 篇 石油与天然气工程
- 21 篇 动力工程及工程热...
- 21 篇 网络空间安全
- 16 篇 土木工程
- 15 篇 测绘科学与技术
- 11 篇 生物医学工程（可授...
- 9 篇 材料科学与工程（可...
- 8 篇 航空宇航科学与技...
690 篇 理学
- 371 篇 数学
- 274 篇 系统科学
- 77 篇 物理学
- 18 篇 生物学
- 8 篇 统计学（可授理学、...
- 7 篇 化学
233 篇 管理学
- 225 篇 管理科学与工程(可...
- 9 篇 图书情报与档案管...
37 篇 医学
- 32 篇 临床医学
- 11 篇 特种医学
20 篇 文学
- 20 篇 新闻传播学
10 篇 经济学
- 7 篇 理论经济学
6 篇 军事学
- 6 篇 军队指挥学
3 篇 教育学
3 篇 农学
2 篇 艺术学
1 篇 法学

主题

6,233 篇 distributed algo...
545 篇 wireless sensor ...
543 篇 convergence
526 篇 algorithm design...
409 篇 optimization
381 篇 computer science
372 篇 distributed comp...
361 篇 network topology
328 篇 routing
279 篇 resource managem...
219 篇 protocols
210 篇 computational mo...
207 篇 computer network...
202 篇 costs
199 篇 approximation al...
199 篇 fault tolerance
186 篇 ad hoc networks
181 篇 bandwidth
179 篇 wireless network...
178 篇 peer to peer com...

机构

25 篇 carnegie mellon ...
19 篇 univ illinois de...
19 篇 cent south univ ...
19 篇 nanyang technol ...
19 篇 univ cyprus dept...
16 篇 univ liverpool d...
16 篇 ege univ int com...
16 篇 univ minnesota d...
16 篇 mit cambridge ma...
14 篇 suny stony brook...
14 篇 swiss fed inst t...
14 篇 purdue univ sch ...
13 篇 northeastern uni...
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 篇 shanghai jiao to...

作者

35 篇 hadjicostis chri...
23 篇 kowalski dariusz...
21 篇 hong yiguang
21 篇 notarstefano giu...
21 篇 scutari gesualdo
20 篇 dagdeviren orhan
18 篇 dominguez-garcia...
17 篇 deng zhenhua
17 篇 pandurangan gopa...
17 篇 mosbah mohamed
16 篇 christoforos n. ...
16 篇 cortes jorge
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

语言

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

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

共 6233 条记录，以下是221-230 订阅

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

详细简洁

排序：

distributed algorithms for Scheduling on Line and Tree Networks with Non-uniform Bandwidths

Distributed Algorithms for Scheduling on Line and Tree Netwo...

引用

International Symposium on Parallel and distributed Processing (IPDPS)

作者： Venkatesan T. Chakaravarthy Anamitra R. Choudhury Sambuddha Roy Yogish Sabharwal IBM Research New Delhi India

ISBN: (纸本)9781467360661

In this paper we study the unsplittable flow problem (UFP) on tree networks in a distributed setting. We have a set of processors (or agents) and a set of tree networks defined over some vertex set. Each processor can access a subset of the tree networks. Each edge in each of the tree networks is associated with a capacity. Each processor has a demand specified as a pair of vertices u and v, along with a profit and a height; the processor wishes to send data between u and v and requires bandwidth equal to its height. Towards that goal, the processor needs to select a tree network accessible to it. A feasible solution selects a subset of demands and schedules each selected demand on a tree network accessible to the processor owning the demand. The requirement is that for any tree network and any edge in the network, the sum of heights of demands scheduled on the network and passing through the edge must not exceed the capacity offered by the edge. The goal is to output a solution having the maximum aggregate profit. Prior work has addressed the above problem in a distributed setting for the special case where all the edge capacities are uniform, say one unit. The main contributions of this paper is to address the general case where the edge capacities can be non-uniform and arbitrary. For this case, we present distributed algorithms with poly-logarithmic approximation ratio.

关键词： Vegetation Program processors Approximation algorithms Approximation methods Algorithm design and analysis distributed algorithms Bandwidth

来源：评论

学校读者我要写书评

暂无评论

distributed algorithms for energy-efficient broadcasting in ad hoc networks

Distributed algorithms for energy-efficient broadcasting in ...

引用

MILCOM, Military Communications Conference

作者： J.E. Wieselthier G.D. Nguyen A. Ephremides Information Technology Division Naval Research Laboratory Inc. Washington D.C. DC USA Electrical and Computer Engineering Dep and Institute for Systems Research University of Maryland College Park MD USA

Previously, we developed the broadcast incremental power (BIP) algorithm (Wieselthier, J.E. et al., Proc. IEEE INFOCOM 2000, p.585-94, 2000; Mobile Networks and Applications (MONET), vol.7, no.6, 2002), which is a centralized heuristic for energy-efficient broadcasting of source-initiated session-based traffic in wireless networks. This algorithm, which exploits the characteristics of the wireless channel, was shown to perform better than adaptations of conventional algorithms that were originally developed for wired networks. However, as a consequence of its centralized nature, it is "expensive" in terms of both communication and computation requirements. We now develop two distributed versions of BIP, and compare their performance to that of centralized BIP and to an algorithm based on the minimum-cost spanning tree formulation.

关键词： distributed algorithms Energy efficiency Broadcasting Intelligent networks Ad hoc networks Wireless networks Radio frequency Information technology Laboratories Computer networks

来源：评论

学校读者我要写书评

暂无评论

distributed algorithms for Solving Modular Congruences over Networks

Distributed Algorithms for Solving Modular Congruences over ...

引用

American Control Conference

作者： Xiang Li Choon Yik Tang School of Electrical and Computer Engineering University of Oklahoma Norman OK USA

ISBN: (数字)9781538682661

ISBN: (纸本)9781538682678

This paper presents a family of discrete-time distributed algorithms that enable nodes in an undirected, connected network to solve, in a fully decentralized fashion, a system of modular congruences whose residues and pairwise coprime moduli are locally known to the nodes. We show that each algorithm in the family is able to determine, in finite time, the congruence class of solutions whose existence and uniqueness is guaranteed by the Chinese remainder theorem. We also describe and analyze three specific algorithms from the family called Synchronous Updating (SU), Pairwise Equalizing (PE), and Groupwise Equalizing (GE), relating the convergence rate of SU to the network diameter and those of PE and GE to their asynchronous update patterns. Finally, we provide simulation results that illustrate their effectiveness.

关键词： distributed algorithms Manganese Simulation Heuristic algorithms Nickel Convergence Mathematical model

来源：评论

学校读者我要写书评

暂无评论

distributed algorithms for Resource Allocation in Wireless Mesh Networks

Distributed Algorithms for Resource Allocation in Wireless M...

引用

ICOF 2016;19th International Conference on OFDM and Frequency Domain Techniques

作者： Daniel Horovitz M. Priesler A. Reichman Ariel University Ruppin Academic Center

ISBN: (纸本)9783800742530

A wireless network using a mesh topology is offered as an alternative to a star topology in a dynamic mobile network. A great challenge for a mobile mesh network is the ability to share resources between nodes to allow connectivity throughout the network. As the network is dynamic, it is proposed that the algorithm for resource sharing be distributed and be easily adaptable to changes. This research suggests two distributive algorithms for resource allocation and compares the results to the minimal distribution in one predetermined scenario, and to a in random scenarios. The research assumes the ability to perform frequency and time division, and also suggests a method for resource allocation when using orthogonal subbands.

关键词： Wireless mesh networks Resource allocation distributed management OFDMA Cognitive radio Wireless ad hoc network Resource utilization Wireless mesh networks Mobile ad hoc networks OFDMA management of resources Cognitive radio distributed algorithms distributed management Mesh networks Wireless networks Time division Resource sharing

来源：评论

学校读者我要写书评

暂无评论

distributed algorithms for Efficient Learning and Coordination in Ad Hoc Networks

Distributed Algorithms for Efficient Learning and Coordinati...

引用

International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)

作者： Arun Verma Manjesh K. Hanawal Rahul Vaze Industrial Engineering and Operations Research Indian Institute of Technology Bombay School of Technology and Computer Science Tata Institute of Fundamental Research

ISBN: (数字)9783903176201

ISBN: (纸本)9781728130859

A distributed sampling strategy for multiple (N) agents is considered that minimizes the sample complexity and regret of acquiring the best subset of size N among total K ≥ N channels in a cognitive radio access setup. Agents cannot directly communicate with each other, and no central coordination is possible. Each agent can transmit on one channel at a time, and if multiple agents transmit on the same channel at the same time, a collision occurs, and no agent gets any information about the channel gain or how many other agents transmitted on the same channel. If no collision occurs, the agent observes a reward (or gain) sample drawn from an underlying distribution associated with the channel. An algorithm to minimize the sample complexity and regret is proposed. One important property of our algorithm that distinguishes it from the prior work (that do not assume knowledge of N) is that it requires no information about the difference of the means of the channel gains of the K channels. Our approach results in fewer collisions with improved regret performance compared to the state-of-the-art algorithms. We validate our theoretical guarantees with experiments.

关键词： Resource management Complexity theory Games distributed algorithms Cognitive radio Indexes Standards

来源：评论

学校读者我要写书评

暂无评论

distributed algorithms for Cyclic Edge Connectivity and Cyclic Vertex Connectivity of Cubic Graphs

Distributed Algorithms for Cyclic Edge Connectivity and Cycl...

引用

作者： Jun Liang Meixin Du Ruihua Nie Zhihao Liang Zheng Li School of Software South China Normal University School of Computer South China Normal University Zhichuang Center Shunde No.1 Middle School Shenzhen Guangming Primary School

For a connected graph , a set of edges(vertices) is a cyclic edge(vertex) cutset if-is not connected and at least two components contain a cycle respectively. The cyclic edge(vertex) connectivity (8((8) is the cardinality of a minimum cyclic edge(vertex) cutset. In this paper, we gave distributed algorithms determining cyclic edge connectivity and cyclic vertex connectivity of cubic graphs. The experiment results showed that the distributed algorithms were significantly improved in time compared to the original algorithms when the graph was large. Time costs of the distributed algorithms separately for cyclic edge connectivity and cyclic vertex connectivity are correspondingly less than 33% and less than 40% that of the single machine algorithms when the graph was large enough.

关键词： distributed algorithms cyclic edge connectivity cyclic vertex connectivity maximum flow cubic graphs

来源：评论

学校读者我要写书评

暂无评论

distributed algorithms for detecting conjunctive predicates

Distributed algorithms for detecting conjunctive predicates

引用

International Conference on distributed Computing Systems

作者： V.K. Garg C.M. Chase Parallel and Distributed Systems Laboratory The University of Texas at Austin

This paper discusses efficient distributed detection of global conjunctive predicates in a distributed program. Our methods correctly detect the first consistent cut in which the predicate is true, even if the predicate is unstable. Previous work in detection of such predicates is based on a centralized checker process. In this paper we introduce algorithms which distribute the computation and space requirements of the detection procedure. Two algorithms are presented. The first algorithm requires O (n/sup 2/ m) time and space where m is the number of messages sent by any process and n is the number of processes over which the predicate is defined. This algorithm has identical time complexity to the original centralized algorithm. However computation, space and message requirements are distributed evenly over the n processes. The second algorithm requires O(Nm) total work, where N is the total number of processes in the system. The relative values of n and N determine which algorithm is more efficient for a specific application. Parallelism can be introduced into either distributed algorithm, reducing the average case time complexity. We show that the worst-case time complexity can not be improved beyond O(mn) with any on-line detection algorithm.

关键词： distributed algorithms distributed computing Parallel processing Detection algorithms

来源：评论

学校读者我要写书评

暂无评论

distributed algorithms for TDMA Link Scheduling in Sensor Networks

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

引用

IEEE International Symposium on Parallel and distributed Processing Workshops and Phd Forum (IPDPSW)

作者： Thamer Alsulaiman Sushil K. Prasad Alexander Zelikovsky Department of Computer Science Georgia State University Atlanta GA USA

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 bidirected graphs. We proves that there exists a Δ-approximation algorithm for FDLSP (Δ 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(Δ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(Δ 4 + Δ 3 log*n) communication rounds, improving upon the previous best algorithm with O(nΔ 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.

关键词： Color distributed algorithms Scheduling Protocols Complexity theory Time division multiple access Processor scheduling

来源：评论

学校读者我要写书评

暂无评论

distributed algorithms for joint channel and RAT allocation in a cognitive digital home

Distributed algorithms for joint channel and RAT allocation ...

引用

International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)

作者： Tianming Li Narayan B. Mandayam Alex Reznik WINLAB Rutgers University North Brunswick NJ USA InterDigital Communications LLC King of Prussia PA USA

The advances in radio design and wireless networking, along with the growth of multimedia home entertainment technologies, is creating the concept of a cognitive digital home requiring spectrum coexistence of various devices and networks of networks. Recent work in has considered a framework for resource allocation in a cognitive digital home (CDH) with a multiplicity of radio access technologies (RAT) such as cognitive radios and legacy radio devices supporting heterogeneous applications. A spectrum manager, named the home genie node (HG), is used to coordinate spectrum coexistence across different services, with degrees of freedom ranging from transmission parameters such as frequency, bandwidth, and power, to the choice of radio access technology itself. distributed algorithms for the resource allocation problems in a CDH, namely maximizing sum rate and maximizing service capacity, which have been previously solved using centralized approaches in, are designed and studied using partial Lagrangian decomposition techniques in this paper.

关键词： Mercury (metals) Resource management Rats distributed algorithms Wireless networks TV

来源：评论

学校读者我要写书评

暂无评论

distributed algorithms for fair bandwidth allocation to elastic services in broadband networks

Distributed algorithms for fair bandwidth allocation to elas...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： H. Yaiche R.R. Mazumdar C. Rosenberg Department of Electrical and Computer Engineering Ecole Polytechnique de Montreal Montreal QUE Canada School of ECE Purdue University West Lafayette IN USA

The Nash arbitration scheme from cooperative game theory provides a natural framework to address the allocation of available bandwidth in network links which is network (Pareto) optimal and satisfies precise notions of fairness. In this paper we propose two distributed bandwidth allocation schemes that allocate available bandwidths to elastic sources according to the Nash arbitration scheme. We prove convergence to the desired allocations for both algorithms. Finally we show how such a scheme can be implemented in a real network.

关键词： distributed algorithms Channel allocation Intelligent networks Broadband communication Bandwidth Game theory Convergence Communication system control Context-aware services Bit rate

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 19 20 21 22 23 24 25 26 27 28 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：