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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

99 篇 会议
63 篇 期刊文献
1 篇 学位论文

馆藏范围

163 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

114 篇 工学
- 104 篇 计算机科学与技术...
- 32 篇 控制科学与工程
- 31 篇 电气工程
- 26 篇 软件工程
- 6 篇 信息与通信工程
- 4 篇 机械工程
- 2 篇 材料科学与工程（可...
- 1 篇 仪器科学与技术
- 1 篇 化学工程与技术
- 1 篇 石油与天然气工程
- 1 篇 交通运输工程
- 1 篇 航空宇航科学与技...
21 篇 管理学
- 21 篇 管理科学与工程(可...
13 篇 理学
- 8 篇 数学
- 3 篇 生物学
- 2 篇 化学
- 2 篇 系统科学
- 1 篇 物理学
- 1 篇 统计学（可授理学、...
2 篇 教育学
- 1 篇 心理学(可授教育学...
- 1 篇 体育学
2 篇 医学
- 2 篇 临床医学
- 1 篇 基础医学(可授医学...
- 1 篇 特种医学
1 篇 哲学
- 1 篇 哲学
1 篇 经济学
- 1 篇 应用经济学
1 篇 法学
- 1 篇 社会学
1 篇 文学
- 1 篇 中国语言文学
- 1 篇 外国语言文学
- 1 篇 新闻传播学
1 篇 艺术学

主题

163 篇 distributed prob...
11 篇 multi-agent syst...
10 篇 coordination
9 篇 algorithms
9 篇 distributed arti...
7 篇 collective intel...
7 篇 multi-agent syst...
7 篇 dcop
6 篇 multiagent syste...
5 篇 teamwork
5 篇 multi-robot syst...
5 篇 artificial intel...
5 篇 object-oriented ...
5 篇 agent cooperatio...
5 篇 dcops
5 篇 knowledge repres...
4 篇 planning
4 篇 distributed cons...
4 篇 blackboard syste...
4 篇 multi-agent plan...

机构

4 篇 imperial college...
3 篇 university of so...
2 篇 washington unive...
2 篇 university of dh...
2 篇 university of so...
2 篇 carnegie mellon ...
2 篇 university of so...
2 篇 clermont univ pa...
2 篇 ben-gurion unive...
2 篇 cornell universi...
2 篇 univ southern ca...
2 篇 univ bristol bri...
2 篇 greyc caen
2 篇 southern illinoi...
2 篇 boğaziçi univers...
2 篇 univ augsburg in...
2 篇 hong kong baptis...
2 篇 science and tech...
2 篇 university of so...
1 篇 ist austria klos...

作者

7 篇 nicholas r. jenn...
5 篇 long tran-thanh
5 篇 md. mosaddek kha...
4 篇 routier jean-chr...
4 篇 alex rogers
4 篇 william yeoh
4 篇 morge maxime
3 篇 ruben stranders
3 篇 sven koenig
3 篇 zivan roie
3 篇 yeoh william
3 篇 moumita choudhur...
3 篇 roie zivan
3 篇 victor lesser
2 篇 gupta a
2 篇 omer lev
2 篇 anders gerrit
2 篇 ariel felner
2 篇 marcolino leandr...
2 篇 tambe milind

语言

154 篇 英文
8 篇 其他
1 篇 德文

检索条件"主题词=distributed problem solving"

共 163 条记录，以下是121-130 订阅

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

详细简洁

排序：

Proactive distributed Constraint Optimization problems 19

Proactive Distributed Constraint Optimization Problems

引用

Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems

作者： Khoi Hoang Washington University in St. Louis St. Louis MO USA

ISBN: (纸本)9781450363099

Current approaches that model dynamism in DCOPs solve a sequence of static problems, reacting to changes in the environment as the agents observe them. Such approaches thus ignore possible predictions on future changes. To overcome this limitation, we introduce (finite-horizon) Proactive Dynamic DCOPs (PD-DCOPs) and Infinite-Horizon PD-DCOPs (IPD-DCOPs) to model dynamic DCOPs in the presence of exogenous uncertainty. In contrast to reactive approaches, PD-DCOPs and IPD-DCOPs are able to explicitly model the possible changes to the problem, and take such information into account proactively, when solving the dynamically changing problem. The additional expressivity of these formalisms allows them to model a wider variety of distributed optimization problems. Our work presents both theoretical and practical contributions that advance current dynamic DCOP models.

关键词： distributed constraint optimization dcop distributed problem solving

来源：评论

学校读者我要写书评

暂无评论

distributed value functions for the coordination of decentralized decision makers 12

Distributed value functions for the coordination of decentra...

引用

Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 3

作者： Laëtitia Matignon Laurent Jeanpierre Abdel-Illah Mouaddib Université de Caen Basse-Normandie France

ISBN: (纸本)9780981738130

In this paper, we propose an approach based on an interaction-oriented resolution of decentralized Markov decision processes (Dec-MDPs) primary motivated by a real-world application of decentralized decision makers to explore and map an unknown environment. This interaction-oriented resolution is based on distributed value functions (DVF) techniques that decouple the multi-agent problem into a set of individual agent problems and consider possible interactions among agents as a separate layer. This leads to a significant reduction of the computational complexity by solving Dec-MDPs as a collection of MDPs. Using this model in multi-robot exploration scenarios, we show that each robot computes locally a strategy that minimizes the interactions between the robots and maximizes the space coverage of the team. Our technique has been implemented and evaluated in simulation and in real-world scenarios during a robotic challenge for the exploration and mapping of an unknown environment by mobile robots. Experimental results from real-world scenarios and from the challenge are given where our system was vice-champion.

关键词： robot coordination distributed problem solving cooperative multi-robot systems multi-robot exploration robot planning

来源：评论

学校读者我要写书评

暂无评论

A better maximization procedure for online distributed constraint optimization 12

A better maximization procedure for online distributed const...

引用

Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 3

作者： Yoonheui Kim Victor Lesser University of Massachusetts at Amherst MA

ISBN: (纸本)9780981738130

Many message passing algorithms on graphical models include maximization operations on sums of local node function and message values from neighbors. In recent work by McAuly et al, faster maximization computation was achieved in a static environment by offline presorting of the values of local functions. However, this efficiency is only guaranteed in special cases when constraint nodes receive messages involving fewer variables than the local function. In this paper, we generalize the approach to be applicable to more general settings where offline presorting of constraint functions is not realistic and messages may involve as many variables as the constraint function. We further improve the approach in two ways, first by creating different value sets with sum values from the previous cycle and the changes in message values from the current cycle, and second by conditionally applying the technique based on a correlation measure. These new approaches with no preprocesing step obtain the expected computational complexity with an exponent of 1.5 of the possible values per node except the initial cycle which requires 2. We demonstrate the effectiveness of this approach in a distributed optimization problem involving the coordination and scheduling of radars.

关键词： max-sum distributed problem solving DCOP

来源：评论

学校读者我要写书评

暂无评论

One-Way Games 14

One-Way Games

引用

International Conference on Autonomous Agents and Multiagent Systems

作者： Andres Abeliuk Gerardo Berbeglia Pascal Van Hentenryck NICTA and University of Melbourne NICTA and Melbourne Business School NICTA and Australian National University

ISBN: (纸本)9781634391313

This paper is motivated by optimization applications involving multiple stakeholders. Examples of such applications are found in large-scale restoration of interdependent infrastructures after significant disruptions (e.g.,[1, 2]), humanitarian logistics over multiple states or regions (e.g., [3]), supply chain coordination (e.g., [4]) and integrated logistics involving, say, a port, inland terminals, and railway and truck operators. Consider, for instance, the restoration of the power system and the telecommunication network after a major disaster. As explained in [3], there are one-way dependencies between the power system and the telecommunication network. This means, for instance, that some power lines must be restored before some part of the telecommunication network can become available. It is possible to use centralized mechanisms for restoring the system as a whole. However, in practice, it is often the case that these restorations are performed by different agencies with independent objectives and selfish behavior may have a strong impact on the social welfare. It is thus important to study whether it is possible to find high-quality outcome to these problems in decentralized settings when the stakeholders proceed independently and do not share complete information about their costs.

关键词： Algorithms Design Economics Mechanism Design Price of Anarchy distributed problem solving

来源：评论

学校读者我要写书评

暂无评论

Evidence Propagation and Consensus Formation in Noisy Environments 19

Evidence Propagation and Consensus Formation in Noisy Enviro...

引用

Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems

作者： Michael Crosscombe Jonathan Lawry University of Bristol Bristol United Kingdom

ISBN: (纸本)9781450363099

We study the effectiveness of consensus formation in multi-agent systems where belief updating is an iterative two-part process, consisting of both belief updating based on direct evidence and also belief combination between agents, within the context of a best-of-n problem. Agents' beliefs are represented within Dempster-Shafer theory by mass functions and we investigate the macro-level properties of four well-known belief combination operators: Dempster's rule, Yager's rule, Dubois & Prade's operator and the averaging operator. Simulation experiments are conducted for different evidence rates and noise levels. Broadly, Dubois & Prade's operator results in better convergence to the best state, and is more robust to noisy evidence.

关键词： distributed problem solving noisy decision-making consensus formation evidence propagation emergent behaviour

来源：评论

学校读者我要写书评

暂无评论

Max-sum with Quadtrees for Continuous DCOPs with Application to Lane-Free Autonomous Driving 22

Max-sum with Quadtrees for Continuous DCOPs with Application...

引用

Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems

作者： Dimitrios Troullinos Georgios Chalkiadakis Vasilis Samoladas Markos Papageorgiou Technical University of Crete Chania Greece

ISBN: (纸本)9781450392136

In this paper we put forward a novel extension of the classic Max-Sum algorithm to the framework of Continuous distributed Constrained Optimization problems (Continuous DCOPs), in which we model the exchanged messages by means of a popular geometric algorithm, Quadtrees. As such, the discretization process is dynamic and embedded in the internal Max-Sum operations (addition and marginal maximization). We apply our Max-Sum with Quadtrees approach to Lane-Free Autonomous Driving in a highway populated with vehicles. Our experimental evaluation verifies the efficiency of our approach in this challenging dynamic coordination domain, demonstrating its superior performance with respect to the standard Max-Sum algorithm.

关键词： autonomous driving quadtrees factor graphs distributed problem solving lane-free traffic Max-Sum algorithm

来源：评论

学校读者我要写书评

暂无评论

An Immune Genetic Algorithm of Optimal Control for the distributed Inventory System

An Immune Genetic Algorithm of Optimal Control for the Distr...

引用

2009 IEEE International Conference on Intelligent Computing and Intelligent Systems(ICIS2009)

作者： Limin Liu,Yila Su,Zhiwei Xu College of Information Engineering,Inner Mongolia University of Technology Hohhot,010051 China

When the distributed inventory system is considered,which consists of several warehouses based on the coordinating center,the coordinating center plays the role of the management of joint *** the customers' order lists are sent to the coordinating center,it designates specific warehouse to supply goods for the customers according to the delivery place,delivery time,the demanded quantity and inventory situation of each *** the overall inventory is lower than overall order,the center will make a joint order to the supplier for each *** order to satisfy the different random distribution of supply and demand side,in the case of limited capital,inventory capacity and supply capacity,and variable costs,for specific customers' satisfaction rate,we propose a practical algorithm to determine the inventory order strategy of each warehouse in order to minimize the total inventory costs by using an immune genetic algorithm.

关键词： distributed problem solving distributed Inventory System Immune Genetic Algorithm Inventory Decision-making

来源：评论

学校读者我要写书评

暂无评论

Bounded decentralised coordination over multiple objectives 11

Bounded decentralised coordination over multiple objectives

引用

The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 1

作者： Francesco M. Delle Fave Ruben Stranders Alex Rogers Nicholas R. Jennings University Of Southampton

ISBN: (纸本)9780982657157

We propose the bounded multi-objective max-sum algorithm (B-MOMS), the first decentralised coordination algorithm for multi-objective optimisation problems. B-MOMS extends the max-sum message-passing algorithm for decentralised coordination to compute bounded approximate solutions to multi-objective decentralised constraint optimisation problems (MO-DCOPs). Specifically, we prove the optimality of B-MOMS in acyclic constraint graphs, and derive problem dependent bounds on its approximation ratio when these graphs contain cycles. Furthermore, we empirically evaluate its performance on a multi-objective extension of the canonical graph colouring problem. In so doing, we demonstrate that, for the settings we consider, the approximation ratio never exceeds 2, and is typically less than 1.5 for less-constrained graphs. Moreover, the runtime required by B-MOMS on the problem instances we considered never exceeds 30 minutes, even for maximally constrained graphs with 100 agents. Thus, B-MOMS brings the problem of multi-objective optimisation well within the boundaries of the limited capabilities of embedded agents.

关键词： coordination distributed problem solving

来源：评论

学校读者我要写书评

暂无评论

Decentralized hash tables for mobile robot teams solving intra-logistics tasks 10

Decentralized hash tables for mobile robot teams solving int...

引用

Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1

作者： D. Sun A. Kleiner C. Schindelhauer University of Freiburg Freiburg Germany

ISBN: (纸本)9780982657119

Although a remarkably high degree of automation has been reached in production and intra-logistics nowadays, human labor is still used for transportation using handcarts and forklifts. High labor cost and risk of injury are the undesirable consequences. Alternative approaches in automated warehouses are fixed installed conveyors installed either overhead or floor-based. The drawback of such solutions is the lack of flexibility, which is necessary when the production lines of the company change. Then, such an installation has to be *** this paper, we propose a novel approach of decentralized teams of autonomous robots performing intra-logistics tasks using distributed algorithms. Centralized solutions suffer from limited scalability and have a single point of failure. The task is to transport material between stations keeping the communication network structure intact and most importantly, to facilitate a fair distribution of robots among loading stations. Our approach is motivated by strategies from peer-to-peer-networks and mobile ad-hoc networks. In particular we use an adapted version of distributed heterogeneous hash tables (DHHT) for distributing the tasks and localized communication. Experimental results presented in this paper show that our method reaches a fair distribution of robots over loading stations.

关键词： distributed problem solving robot coordination peer to peer coordination mobile agents multi-robot systems

来源：评论

学校读者我要写书评

暂无评论

distributed Search for Pure Nash Equilibria in Graphical Games 16

Distributed Search for Pure Nash Equilibria in Graphical Gam...

引用

International Conference on Autonomous Agents and Multiagent Systems

作者： Omer Litov Amnon Meisels Department of Computer Science Ben-Gurion University of the Negev

ISBN: (纸本)9781510855083

Graphical games introduce a compact representation, where agents' outcomes depend only on their neighbors. A distributed search algorithm for pure Nash equilibria of graphical games is presented. The algorithm uses the analogy of graphical games with asymmetric distributed constraints optimization problems (ADCOPs). The proposed algorithm includes three components - an admissible pruning heuristic; a back-checking mechanism; and a pseudo tree representation of the game. An experimental evaluation of the components of the proposed search algorithm is presented for randomly generated networks of multiple agents. The major speedup over a naive search algorithm is shown to arise from the use of a pseudo tree representation. A simple assessment method of the privacy loss due to back-checking is presented and is shown to result in a tradeoff between the performance of the complete algorithm and its privacy loss.

关键词： Algorithms distributed problem solving DCOP Nash equilibrium Privacy Nash equilibrium distributed problem solving Privacy algorithms Game theory SEARCHING ALGORITHM distributed search

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共17页 << < 8 9 10 11 12 13 14 15 16 17 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：