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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

78,668 篇 会议
5,134 篇 期刊文献

馆藏范围

83,802 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

18,467 篇 工学
- 7,563 篇 电气工程
- 7,168 篇 计算机科学与技术...
- 3,250 篇 信息与通信工程
- 2,733 篇 控制科学与工程
- 2,564 篇 软件工程
- 1,644 篇 电子科学与技术（可...
- 1,517 篇 仪器科学与技术
- 1,418 篇 机械工程
- 352 篇 航空宇航科学与技...
- 258 篇 生物医学工程（可授...
- 210 篇 交通运输工程
- 202 篇 网络空间安全
- 155 篇 测绘科学与技术
- 131 篇 生物工程
- 95 篇 材料科学与工程（可...
- 90 篇 动力工程及工程热...
- 88 篇 核科学与技术
- 69 篇 光学工程
2,012 篇 理学
- 957 篇 系统科学
- 580 篇 物理学
- 222 篇 数学
- 153 篇 生物学
- 94 篇 地球物理学
1,751 篇 管理学
- 1,687 篇 管理科学与工程(可...
505 篇 文学
- 505 篇 新闻传播学
262 篇 医学
- 190 篇 临床医学
140 篇 农学
- 100 篇 作物学
71 篇 艺术学
- 71 篇 设计学（可授艺术学...
60 篇 教育学
- 59 篇 教育学
51 篇 军事学
- 51 篇 军队指挥学
36 篇 经济学
7 篇 法学

主题

83,802 篇 algorithm design...
5,929 篇 clustering algor...
5,323 篇 heuristic algori...
5,293 篇 computer science
5,166 篇 optimization
4,768 篇 signal processin...
4,589 篇 hardware
4,082 篇 genetic algorith...
4,049 篇 performance anal...
4,047 篇 convergence
4,041 篇 computational mo...
3,684 篇 data mining
3,614 篇 mathematical mod...
3,465 篇 testing
3,271 篇 routing
3,019 篇 robustness
3,013 篇 equations
2,991 篇 educational inst...
2,977 篇 partitioning alg...
2,951 篇 delay

机构

88 篇 ibm thomas j. wa...
76 篇 department of el...
63 篇 school of comput...
53 篇 department of el...
49 篇 state key labora...
46 篇 tsinghua univers...
46 篇 school of electr...
45 篇 institute for in...
44 篇 school of electr...
44 篇 school of comput...
42 篇 school of comput...
40 篇 school of inform...
38 篇 department of el...
38 篇 department of co...
36 篇 institute of inf...
33 篇 department of el...
33 篇 department of el...
33 篇 department of co...
33 篇 department of el...
32 篇 department of co...

作者

88 篇 lei wang
62 篇 yu wang
59 篇 jun zhang
51 篇 jun wang
43 篇 jian wang
40 篇 bin wang
39 篇 hui wang
37 篇 jing zhang
36 篇 li li
30 篇 wei wang
28 篇 qiang zhou
28 篇 slawomir koziel
27 篇 rui wang
26 篇 xi chen
25 篇 min huang
25 篇 wayne luk
23 篇 jie yang
22 篇 hisao ishibuchi
21 篇 feng liu
21 篇 ming chen

语言

82,513 篇 英文
945 篇 其他
337 篇 中文
5 篇 俄文
1 篇 西班牙文
1 篇 斯洛伐克文

检索条件"主题词=Algorithm design and analysis"

共 83802 条记录，以下是621-630 订阅

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

详细简洁

排序：

Crowdsourced correlation clustering with relative distance comparisons 17

Crowdsourced correlation clustering with relative distance c...

引用

17th IEEE International Conference on Data Mining (ICDMW)

作者： Ukkonen, Antti Univ Helsinki Dept Comp Sci Helsinki Finland

ISBN: (纸本)9781538638354

Crowdsourced, or human computation based clustering algorithms usually rely on relative distance comparisons, as these are easier to elicit from human workers than absolute distance information. We build upon existing work on correlation clustering, a well-known non-parametric approach to clustering, and present a novel clustering algorithm for human computation. We first define a novel variant of correlation clustering that is based on relative distance comparisons, and briefly outline an approximation algorithm for this problem. As a second contribution, we propose a more practical algorithm, which we empirically compare against existing methods from literature. Experiments with synthetic data suggest that our approach can outperform more complex methods. Also, our method efficiently finds good and intuitive clusterings from real relative distance comparison data.

关键词： Clustering algorithms Approximation algorithms Correlation algorithm design and analysis Optimized production technology Search problems

来源：评论

学校读者我要写书评

暂无评论

How to Stop Consensus algorithms, locally? 56

How to Stop Consensus Algorithms, <i>locally</i>?

引用

56th Annual IEEE Conference on Decision and Control (CDC)

作者： Xie, Pei You, Keyou Wu, Cheng

ISBN: (纸本)9781509028733

This paper studies problems on locally stopping distributed consensus algorithms over networks where each node updates its state by interacting with its neighbors and decides by itself whether certain level of agreement has been achieved among nodes. Since an individual node is unable to access the states of those beyond its neighbors, this problem becomes challenging. In this work, we first define the stopping problem for generic distributed algorithms. Then, a distributed algorithm is explicitly provided for each node to stop consensus updating by exploring the relationship between the so-called local and global consensus. Finally, we show both in theory and simulation that its effectiveness depends both on the network size and the structure.

关键词： Distributed algorithms Protocols algorithm design and analysis Monitoring Eigenvalues and eigenfunctions Network topology Convergence

来源：评论

学校读者我要写书评

暂无评论

Improving I/O Complexity of Triangle Enumeration 17

Improving I/O Complexity of Triangle Enumeration

引用

17th IEEE International Conference on Data Mining (ICDMW)

作者： Cui, Yi Xiao, Di Cline, Daren B. H. Loguinov, Dmitri Texas A&M Univ College Stn TX 77843 USA

ISBN: (纸本)9781538638354

In the age of big data, many graph algorithms are now required to operate in external memory and deliver performance that does not significantly degrade with the scale of the problem. One particular area that frequently deals with graphs larger than RAM is triangle listing, where the algorithms must carefully piece together edges from multiple partitions to detect cycles. In recent literature, two competing proposals (i.e., Pagh and PCF) have emerged;however, neither one is universally better than the other. Since little is known about the I/O cost of PCF or how these methods compare to each other, we undertake an investigation into the properties of these algorithms, model their I/O cost, understand their shortcomings, and shed light on the conditions under which each method defeats the other. This insight leads us to develop a novel framework we call Trigon that surpasses the I/O performance of both previous techniques in all graphs and under all RAM conditions.

关键词： Random access memory Color Partitioning algorithms Image edge detection Complexity theory algorithm design and analysis Memory management

来源：评论

学校读者我要写书评

暂无评论

A Random Key based Estimation of Distribution algorithm for the Permutation Flowshop Scheduling Problem

A Random Key based Estimation of Distribution Algorithm for ...

引用

IEEE Congress on Evolutionary Computation (CEC)

作者： Ayodele, Mayowa McCall, John Regnier-Coudert, Olivier Bowie, Liam Robert Gordon Univ Aberdeen Scotland

ISBN: (纸本)9781509046010

Random Key (RK) is an alternative representation for permutation problems that enables application of techniques generally used for continuous optimisation. Although the benefit of RKs to permutation optimisation has been shown, its use within Estimation of Distribution algorithms (EDAs) has been a challenge. Recent research proposing a RK-based EDA (RK-EDA) has shown that RKs can produce competitive results with state of the art algorithms. Following promising results on the Permutation Flowshop Scheduling Problem, this paper presents an analysis of RK-EDA for optimising the total flow time. Experiments show that RK-EDA outperforms other permutation-based EDAs on instances of large dimensions. The difference in performance between RK-EDA and the state of the art algorithms also decreases when the problem difficulty increases.

关键词： Sociology Probabilistic logic Histograms Estimation Optimization algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Earth Observation-Supported Service Platform for the Development and Provision of Thematic Information on the Built Environment - the TEP-Urban Project

Earth Observation-Supported Service Platform for the Develop...

引用

Joint Urban Remote Sensing Event (JURSE)

作者： Esch, Thomas Uereyen, Soner Asamer, Hubert Hirner, Andreas Marconcini, Mattia Metz, Annekatrin Zeidler, Julian Brito, Fabrice Mathot, Emmanuel Boettcher, Martin Permana, Hans Soukop, Tomas Balhar, Jakub Stanek, Filip Kuchar, Stepan German Aerosp Ctr DLR Wessling Germany Terradue Srl Frascati Italy Brockmann Consult Geesthacht Germany GISAT Sro Prague Czech Republic Tech Univ Ostrava IT4Innovat Ostrava Czech Republic

ISBN: (纸本)9781509058082

The Sentinel fleet will provide a so-far unique coverage with Earth observation (EO) data and therewith new opportunities for the implementation of methodologies to generate innovative geo-information products and services. It is here where the TEP Urban project is supposed to initiate a step change by providing an open and participatory platform based on modern Information and Communication Technologies (ICTs) that enable any interested user to easily exploit EO data pools, in particular those of the Sentinel missions, and derive thematic information on the status and development of the built environment from these data. Key component of TEP Urban project is the implementation of a web-based platform employing distributed high-level computing infrastructures and providing key functionalities for i) high-performance access to satellite imagery and derived thematic data, ii) modular and generic state-of-the-art pre-processing, analysis, and visualization techniques, iii) customized development and dissemination of algorithms, products and services, and iv) networking and communication. This contribution introduces the main facts about the TEP Urban project, including a description of the general objectives, the platform systems design and functionalities, and the preliminary portfolio products and services available at the TEP Urban platform.

关键词： Urban areas Earth Data visualization Satellites algorithm design and analysis Europe Tools

来源：评论

学校读者我要写书评

暂无评论

Fast Sample Adaptive Offset Parameter Estimation algorithm Based on Early Termination for HEVC Encoder

Fast Sample Adaptive Offset Parameter Estimation Algorithm B...

引用

IEEE International Conference on Consumer Electronics (ICCE)

作者： Kim, Sungjei Jeong, Jinwoo Moon, Jeong-Mee Kim, Yong-Hwan Korea Elect Technol Inst Seongnam Si South Korea

ISBN: (纸本)9781509055449

This paper presents a fast sample adaptive offset (SAO) parameter estimation algorithm for high efficiency video coding (HEVC) encoder. The proposed algorithm decides the best SAO parameters earlier by exploiting a spatial correlation between current and neighbor SAO types. From the experimental results, the proposed algorithm achieves 56.02% time-saving with only 0.26% bitrate increase on average, compared to HE VC reference software HM 16.9 under common test condition.

关键词： Parameter estimation algorithm design and analysis High efficiency video coding Bit rate Correlation Signal processing algorithms Encoding

来源：评论

学校读者我要写书评

暂无评论

On Energy-Efficient Congestion Control for Multipath TCP 37

On Energy-Efficient Congestion Control for Multipath TCP

引用

37th IEEE International Conference on Distributed Computing Systems (ICDCS)

作者： Zhao, Jia Liu, Jiangchuan Wang, Haiyang Simon Fraser Univ Sch Comp Sci Burnaby BC Canada Univ Minnesota Dept Comp Sci Duluth MN 55812 USA

ISBN: (纸本)9781538617915

Multipath TCP ( MPTCP) enables transmission via multiple routes for an end-to-end connection to improve resource usage of regular TCP. Due to the increasing concern in green computing, there has been significant interest in designing energyefficient multipath transport. For existing MPTCP congestion control algorithms, the research community still lacks a comprehensive understanding of which components in such an algorithm play the fundamental role in energy efficiency, how various algorithms compare against each other from energy-consuming perspective, or whether there exist potentially better solutions for energy saving. In this paper, we take a first step to answer these questions. Based on the MPTCP Linux kernel experiments, we first summarize that the energy consumption is related to three aspects: average throughput, path delay and different network scenarios. In order to bridge congestion control to the three aspects, we analyze the existing algorithms and capture the essential parameters of multipath congestion control model related to MPTCP's energy-efficiency. Then we design a window increase factor to shift traffic to low-delay energy-efficient paths. We further extend this design by using an energy-aware compensative parameter to fit the general hierarchical Internet topology. We evaluate the performance of existing multipath congestion control algorithms and our proposed algorithm in different network scenarios. The results successfully validate the improved energy efficiency of our design.

关键词： algorithm design and analysis Throughput Energy consumption Power demand Wireless fidelity Kernel Linux

来源：评论

学校读者我要写书评

暂无评论

Controlling Networks of Imitative Agents 56

Controlling Networks of Imitative Agents

引用

56th Annual IEEE Conference on Decision and Control (CDC)

作者： Riehl, James Ramazi, Pouria Cao, Ming Univ Groningen Fac Sci & Engn ENTEG Groningen Netherlands

ISBN: (纸本)9781509028733

We consider how asynchronous networks of agents who imitate their highest-earning neighbors can be efficiently driven towards a desired strategy by offering payoff incentives, either uniformly or targeted to individuals. In particular, if for each available strategy, agents playing that strategy receive maximum payoff when their neighbors play that same strategy, we show that providing incentives to agents in a network that is at equilibrium will result in convergence to a unique equilibrium. When a uniform incentive can be offered to all agents, one can compute the optimal incentive using a binary search algorithm. When incentives can be targeted to individuals, we propose an algorithm to select which agents should be chosen based on iteratively maximizing a ratio of the number of agents who adopt the desired strategy to the payoff incentive required to get those agents to do so. Simulations demonstrate that this algorithm computes near-optimal targeted payoff incentives for a range of networks and payoff distributions in coordination games.

关键词： Games Switches Convergence Sociology Statistics algorithm design and analysis Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

Search Space Reduction for the Non-Exact Projective NPNP Boolean Matching Problem 50

Search Space Reduction for the Non-Exact Projective NPNP Boo...

引用

IEEE International Symposium on Circuits and Systems (ISCAS)

作者： Wang, Feng Zhang, Jiaxi Wu, Lange Zhang, Wentai Luo, Guojie Peking Univ Sch EECS Ctr Energy Efficient Comp & Applicat Beijing Peoples R China NUDT Collaborat Innovat Ctr High Performance Comp Changsha Hunan Peoples R China

ISBN: (纸本)9781467368537

The non-exact projective NPNP (NP3) Boolean matching problem is practically significant in the applications of technology mapping, logic verification, and hardware security. However, its difficulty compels an unsatisfactory running time, and conventional algorithms for the basic NPNP Boolean matching problem perform terribly on the non-exact and projective type. In this paper, we propose a novel algorithm to solve this newly rising NP3 Boolean matching problem, and multiple types of optimization were applied to further improve the performance. Experimental results indicate that our algorithm has outstanding outcomes.

关键词： Impedance matching Set theory algorithm design and analysis Search problems Logic gates Pattern matching Tools

来源：评论

学校读者我要写书评

暂无评论

A two-stage RRT path planner for automated parking 13

A two-stage RRT path planner for automated parking

引用

13th IEEE Conference on Automation Science and Engineering (IEEE CASE)

作者： Wang, Yebin Jha, Devesh K. Akemi, Yukiyasu Mitsubishi Elect Res Labs Cambridge MA 02139 USA Mitsubishi Electr Corp Adv Technol R&D Ctr 8-1-1 Tsukaguchi Honmachi Amagasaki Hyogo 6618661 Japan

ISBN: (纸本)9781509067817

Path planning for automated parking remains challenged by the demand to balance general parking scenarios and computational efficiency. This paper proposes a two-stage rapid-exploring random tree (RRT) algorithm to improve the computational efficiency. At first the proposed algorithm performs space exploration and establishes prior knowledge, represented as waypoints, using cheap computation. Secondly a waypoint-guided RRT algorithm, with a sampling scheme biased by the waypoints, constructs a kinematic tree connecting the initial and goal configurations. Numerical study demonstrates that the two-stage algorithm achieves at least 2X faster than the baseline one-stage algorithm.

关键词： Path planning Kinematics Space exploration algorithm design and analysis Wheels Heuristic algorithms Automobiles

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 59 60 61 62 63 64 65 66 67 68 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：