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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是151-160 订阅

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

详细简洁

排序：

Dominating sets of agents in visibility graphs: distributed algorithms for art gallery problems 10

Dominating sets of agents in visibility graphs: distributed ...

引用

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

作者： Evan A. Sultanik Ali Shokoufandeh William C. Regli Drexel University Philadelphia PA

ISBN: (纸本)9780982657119

The Art Gallery problem asks to find a minimum subset of vertices in a polygon that are sufficient to observe the interior. This problem arises in a variety of multiagent systems, including robotics, sensor networks, wireless networking, and surveillance. Despite the fact that the centralized version of the problem has been extensively studied for the past thirty years, there is relatively little in the literature describing distributed solutions to the problem that have desirable guarantees in both runtime and optimality. We propose and analyze a new distributed algorithm for approximating a solution to this problem and a number of its variants that runs in a linear number of communication rounds with respect to the number of nodes (independent of the topology of the network), and, under assumptions on the embedding of the edge weights, will run in a logarithmic number of communication rounds producing solutions within a constant factor of optimal.

关键词： primal/dual distributed problem solving multi-robot coordination art gallery problem dominating set problem sensor networks

来源：评论

学校读者我要写书评

暂无评论

A Modular Framework for Decentralised Multi-Agent Planning 17

A Modular Framework for Decentralised Multi-Agent Planning

引用

International Conference on Autonomous Agents and Multiagent Systems

作者： Rafael C. Cardoso Rafael H. Bordini Faculdade de Informatica PUCRS

ISBN: (纸本)9781510855076

Multi-agent systems often require runtime planning, which remains an open problem due to the existing gap between planning and execution in practice. Extensive research has been carried out in centralised planning for single-agent systems, but so far decentralised multi-agent planning has not been fully explored. In this paper, we extend existing multi-agent platforms to enable decentralised planning at runtime. In particular, we put forward a planning and execution framework called Decentralised Online Multi-Agent Planning (DOMAP). Experiments with a planning domain we developed on flooding disaster scenarios show that DOMAP outperforms 4 other state-of-the-art multi-agent planners, particularly in the most difficult problems.

关键词： Multi-agent planning Multi-agent systems distributed problem solving Online planning Multi-agent systems distributed problem solving Planning Runtime Legal Executions

来源：评论

学校读者我要写书评

暂无评论

Collaborative multiagent Gaussian inference in a dynamic environment using belief propagation 10

Collaborative multiagent Gaussian inference in a dynamic env...

引用

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

作者： Stefano Ermon Carla Gomes Bart Selman Cornell University Ithaca New York

ISBN: (纸本)9780982657119

The problem of multiagent Gaussian inference in a dynamic environment, also known as distributed Kalman filtering, is formulated into the framework of message passing algorithms. Upon generalizing the derivation of the standard Kalman filter to the distributed case, we propose novel solutions that outperform current state of the art techniques.

关键词： distributed problem solving reasoning

来源：评论

学校读者我要写书评

暂无评论

Challenges for Multi-Agent Coordination Theory Based on Empirical Observations 14

Challenges for Multi-Agent Coordination Theory Based on Empi...

引用

International Conference on Autonomous Agents and Multiagent Systems

作者： Victor Lesser Daniel Corkill School of Computer Science University of Massachusetts Amherst

ISBN: (纸本)9781634391313

Significant research progress and understanding about the nature of coordination has been made over the years. Development of the DCOP and DEC-MDP frameworks in the past decade has been especially important. Although these advances are very important for multi-agent coordination theory, they overlook a set of coordination behaviors and phenomena that have been observed empirically by many researchers since the early years of the field. The goal of this paper is to challenge researchers in multi-agent coordination to develop a comprehensive formal framework that explains these empirical observations.

关键词： Coordination Agent Cooperation distributed problem solving

来源：评论

学校读者我要写书评

暂无评论

Asynchronous partitioning framework 10

Asynchronous partitioning framework

引用

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

作者： Vitaliy Freidovich Amnon Meisels The Open University of Israel Raanana Israel Ben-Gurion University of the Negev Beer-Sheva Israel

ISBN: (纸本)9780982657119

A new general framework for agent cooperation and coordination in solving distributed constraint satisfaction problems (DCSPs) is presented. The Asynchronous Partitioning Framework (APF) first partitions agents into groups of agents, based on some heuristic, prior to any search being conducted. During the partitioning phase one of the agents in each group is assigned the role of a group leader. Next, two distinct types of search processes among the agents are performed concurrently. The first type of search is conducted within each group, in parallel and asynchronously to all searches in other groups. The second type of search, the global search, is conducted between the groups, and treats each group as if it is a single agent represented by its group leader. The structure of the groups remains static throughout the search processes. Two distinct algorithms implementing APF are presented, and the advantages of APF are evaluated experimentally.

关键词： distributed constraints satisfaction distributed search distributed partitioning distributed problem solving

来源：评论

学校读者我要写书评

暂无评论

Fast Winner Determination for Agent Coordination with SBB Auctions 09

Fast Winner Determination for Agent Coordination with SBB Au...

引用

International Conference on Autonomous Agents and Multiagent Systems

作者： Kenny Daniel Sven Koenig Computer Science Department University of Southern California

ISBN: (纸本)9781615673346

The runtime of winner determination for each round of a sequential bundle-bid auction (= SBB auction) has recently been shown to be linear in the number of submitted bids, which makes SBB auctions appealing for solving cooperative task-assignment problems. In this paper, we introduce the Shrewd (= SHrewd Resource Efficient Winner Determination) algorithm, whose runtime is linear in the number of submitted bids but typically much smaller than the runtime of the existing winner-determination algorithm for SBB auctions, making them feasible for larger bundle sizes.

关键词： Algorithms Performance Design Experimentation Auctions Combinatorial auction Coordination Decentralized control distributed problem solving Sequential bundle-bid single-sale auction Task allocation Winner determination

来源：评论

学校读者我要写书评

暂无评论

Agent-encapsulated Bayesian networks and the rumor problem 10

Agent-encapsulated Bayesian networks and the rumor problem

引用

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

作者： Scott Langevin Marco Valtorta Mark Bloemeke University of South Carolina LogicBlox Inc. Atlanta GA

ISBN: (纸本)9780982657119

We present a multiagent organization for data interpretation and fusion in which each agent uses an encapsulated Bayesian network for knowledge representation, and agents communicate by exchanging beliefs (marginal posterior probabilities) on shared variables. We call this organization an Agent-Encapsulated Bayesian Network (AEBN) system. Communication of probabilities among agents leads to rumors, i.e. potential double counting of information. We propose a new and correct method to compensate for rumors in AEBN systems by passing extended messages that contain joint probabilities.

关键词： communication protocols knowledge representation reasoning (single and multi-agent) distributed problem solving

来源：评论

学校读者我要写书评

暂无评论

Socially Motivated Partial Cooperation in Multi-agent Local Search 18

Socially Motivated Partial Cooperation in Multi-agent Local ...

引用

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

作者： Tal Ze'evi Roie Zivan Omer Lev Ben-Gurion University of the Negev Beer Sheva Israel

Partial Cooperation is a paradigm and a corresponding model for representing multi-agent systems in which agents are willing to cooperate in order to achieve a global goal, as long as some minimal threshold on their personal utility is satisfied. distributed local search algorithms were proposed in order to solve asymmetric distributed constraint optimization problems (ADCOPs) in which agents are partially cooperative. We contribute by: 1) extending the partial cooperative model to allow it to represent dynamic cooperation intentions, affected by changes in agents' wealth, in accordance with social studies literature. 2) proposing a novel local search algorithm in which agents receive indications of others' preferences on their actions and thus, can perform actions that are socially beneficial. Our empirical study reveals the advantage of the proposed algorithm in multiple benchmarks. Specifically, on realistic meeting scheduling problems it overcomes limitations of standard local search algorithms.

关键词： distributed problem solving partial cooperation

来源：评论

学校读者我要写书评

暂无评论

Adaptive Multi-agent System for Situated Task Allocation 19

Adaptive Multi-agent System for Situated Task Allocation

引用

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

作者： Quentin Baert Anne-Cécile Caron Maxime Morge Jean-Christophe Routier Kostas Stathis Université de Lille Lille France Royal Holloway University of London Egham United Kingdom

ISBN: (纸本)9781450363099

Multi-agent scheduling has received significant attention in tackling the problem of load balancing and task allocation in distributed systems. Apart from dividing the work through decentralization, we consider dynamicity because allocation of tasks must be concurrent with their execution, and adaptation because tasks must be reallocated when a disruptive event is performed. We will assume that agents are fully distributed and cooperative in order to optimize the global runtime, i.e a system-centric metric rather than user-centric metrics. We will also assume that a task can be performed by any single agent without preemption and precedence order. Moreover, tasks have no deadlines, are indivisible and not *** follow a market-based approach to tackle the multi-agent situated task allocation problem. In order to improve load balancing, agents adopt a locality-based strategy in concurrent one-to-many negotiations for task delegations. The task reallocation is dynamic since the negotiation process is iterated and concurrent with the tasks processing. Moreover, the system is adaptive to disruptive events, e.g. task consumptions. As a practical application, we consider the distributed deployment of the MapReduce design pattern for processing large datasets. Our preliminary empirical results show that, for such an application, the locality-based strategy improves the runtime.

关键词： bargaining and negotiation distributed problem solving

来源：评论

学校读者我要写书评

暂无评论

Multi-agent abductive reasoning with confidentiality 11

Multi-agent abductive reasoning with confidentiality

引用

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

作者： Jiefei Ma Alessandra Russo Krysia Broda Emil Lupu Imperial College London London United Kingdom

ISBN: (纸本)9780982657171

In the context of multi-agent hypothetical reasoning, agents typically have partial knowledge about their environments, and the union of such knowledge is still incomplete to represent the whole world. Thus, given a global query they need to collaborate with each other to make correct inferences and hypothesis, whilst maintaining global constraints. There are many real world applications in which the confidentiality of agent knowledge is of primary concern, and hence the agents may not share or communicate all their information during the collaboration. This extra constraint gives a new challenge to multi-agent reasoning. This paper shows how this dichotomy between "open communication" in collaborative reasoning and protection of confidentiality can be accommodated, by extending a general-purpose distributed abductive logic programming system for multi-agent hypothetical reasoning with confidentiality. Specifically, the system computes consistent conditional answers for a query over a set of distributed normal logic programs with possibly unbound domains and arithmetic constraints, preserving the private information within the logic programs.

关键词： distributed problem solving reasoning (multi-agent) knowledge representation

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：