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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,352 篇 期刊文献
911 篇 会议
19 篇 学位论文
1 册 图书

馆藏范围

2,283 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,757 篇 工学
- 991 篇 计算机科学与技术...
- 602 篇 电气工程
- 359 篇 信息与通信工程
- 208 篇 软件工程
- 166 篇 控制科学与工程
- 106 篇 电子科学与技术（可...
- 102 篇 机械工程
- 83 篇 仪器科学与技术
- 50 篇 航空宇航科学与技...
- 49 篇 交通运输工程
- 48 篇 石油与天然气工程
- 31 篇 力学（可授工学、理...
- 26 篇 材料科学与工程（可...
- 24 篇 土木工程
- 21 篇 动力工程及工程热...
- 21 篇 环境科学与工程（可...
- 17 篇 测绘科学与技术
- 15 篇 网络空间安全
793 篇 理学
- 576 篇 数学
- 95 篇 物理学
- 58 篇 生物学
- 47 篇 系统科学
- 36 篇 统计学（可授理学、...
- 25 篇 化学
- 17 篇 地球物理学
306 篇 管理学
- 293 篇 管理科学与工程(可...
- 36 篇 工商管理
78 篇 医学
- 45 篇 临床医学
60 篇 经济学
- 46 篇 应用经济学
- 15 篇 理论经济学
20 篇 农学
8 篇 法学
5 篇 教育学
5 篇 军事学
4 篇 文学
1 篇 艺术学

主题

2,283 篇 greedy algorithm
100 篇 greedy algorithm...
68 篇 optimization
64 篇 genetic algorith...
63 篇 compressed sensi...
46 篇 algorithms
43 篇 influence maximi...
35 篇 dynamic programm...
34 篇 social networks
34 篇 scheduling
33 篇 approximation al...
32 篇 approximation al...
31 篇 greedy method
30 篇 matroid
26 篇 combinatorial op...
23 篇 compressive sens...
23 篇 linear programmi...
20 篇 submodular funct...
20 篇 wireless sensor ...
20 篇 integer programm...

机构

9 篇 univ s carolina ...
8 篇 univ autonoma ma...
8 篇 univ texas dalla...
7 篇 univ chinese aca...
6 篇 nanyang technol ...
6 篇 moscow mv lomono...
5 篇 brown univ div a...
5 篇 yerevan state un...
5 篇 univ s carolina ...
5 篇 mit cambridge ma...
5 篇 univ sci & techn...
4 篇 univ sci & techn...
4 篇 nanyang technol ...
4 篇 new jersey inst ...
4 篇 univ texas austi...
4 篇 ohio state univ ...
4 篇 univ ulm inst op...
4 篇 georgia state un...
4 篇 univ int busines...
4 篇 rutgers state un...

作者

9 篇 borowiecki piotr
9 篇 qian tao
8 篇 zielosko beata
8 篇 wang wei
8 篇 moshkov mikhail
7 篇 zhang zhao
7 篇 michel volker
7 篇 wang yu
7 篇 sawada joe
7 篇 faigle u
6 篇 temlyakov vn
6 篇 rautenbach diete...
6 篇 tang yuan yan
6 篇 chen yanlai
6 篇 chen peng
6 篇 wu weili
5 篇 saito yuji
5 篇 zhang xiaoyan
5 篇 zhang tong
5 篇 yamada keigo

语言

2,124 篇 英文
125 篇 其他
27 篇 中文
3 篇 法文
2 篇 德文
1 篇 葡萄牙文

检索条件"主题词=greedy algorithm"

共 2283 条记录，以下是2241-2250 订阅

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

详细简洁

排序：

Cross entropy based component carrier allocation in LTE-Advanced wireless communication system

Cross entropy based component carrier allocation in LTE-Adva...

引用

International Conference on Wireless Communications and Signal Processing (WCSP)

作者： Ye Wang Peipei Chen Qinyu Zhang Xiaodong Lin Communication Engineering Research Center Harbin Institute of Technology Shenzhen Graduate School Shenzhen Guangdong China University of Ontario Institute of Technology Canada

ISBN: (纸本)9781467358309

In order to achieve up to 1 Gbit/s peak data rate in the future IMT-Advanced mobile systems, carrier aggregation (CA) technique is introduced by the 3GPP to support higher data rate transmissions over wide frequency bandwidths (up to 100 MHz) in the LTE-Advanced (LTE-A) standards. This technical envisagement puts forward the new challenge in resource allocation. In this paper, we investigates the component carrier (CC) allocation in LTE-A system. We first separate the resource allocation into CC-, resource block (RB)- and power-allocation. Then, an optimization problem that maximizes system sum capacity with proportional fairness(PF) guarantee is formulated. To simplify the optimization problem, we present an approximate RB allocation approach and two alternative objective functions. A greedy algorithm for CC allocation (GACCA) with low computational complexity is presented to solve the simplified optimization problem. To further improve the quality of solution, we introduce cross entropy method into GACCA. Numerical simulations verify the efficiency of the proposed algorithm.

关键词： Cross Entropy based Cross Entropy based Wireless communication systems entropy Resource utilization greedy algorithm transversality Data transfer rates 3GPP allocation

来源：评论

学校读者我要写书评

暂无评论

A Robust Mechanism for Resource Allocation with Interference Mitigation in Femtocellular Networks

A Robust Mechanism for Resource Allocation with Interference...

引用

IEEE International Conference on Communications

作者： Najah Abu Ali Faculty of IT United Arab Emirates University

ISBN: (纸本)9781457720529

Interference mitigation can be particularly challenging in hybrid 4G cellular networks employing a femtocellular tier, especially given the ad hoc nature in which femtocells are deployed. So far, mitigation mechanisms have been based on simplified models assuming regular (grid-based) deployment, using average interference characterization or satisfying the SINR requirements while ignoring the required data rates. In this paper, we show that such simplifications can be relaxed. Specifically, we derive an interference mitigation mechanism assuming an ad hoc deployment. The mechanism optimizes resource allocations on per-subcarrier basis while satisfying user data rate requirements. It is also based on a rigorous cross-tier interference characterization (macro-femto, femto-femto), and utilizes robust stochastic programming techniques. Simulation results indicate great potential in our proposal as it significantly outperforms a heuristic greedy algorithm.

关键词： Resource utilization disturbance suppression ad hoc greedy algorithm Femtocells Data transfer rates management of resources

来源：评论

学校读者我要写书评

暂无评论

A GENERAL FRAMEWORK FOR DICTIONARY BASED AUDIO FINGERPRINTING

A GENERAL FRAMEWORK FOR DICTIONARY BASED AUDIO FINGERPRINTIN...

引用

IEEE International Conference on Acoustics, Speech and Signal Processing

作者： Manuel Moussallam Laurent Daudet Institut Langevin Univ. Paris 7 Diderot - ESPCI ParisTech - CNRS UMR 7587 1 rue Jussieu 75005 Paris

ISBN: (纸本)9781479928941

Fingerprint-based Audio recognition system must address concurrent objectives. Indeed, fingerprints must be both robust to distortions and discriminative while their dimension must remain to allow fast comparison. This paper proposes to restate these objectives as a penalized sparse representation problem. On top of this dictionary-based approach, we propose a structured sparsity model in the form of a probabilistic distribution for the sparse support. A practical suboptimal greedy algorithm is then presented and evaluated on robustness and recognition tasks. We show that some existing methods can be seen as particular cases of this algorithm and that the general framework allows to reach other points of a Pareto-like continuum.

关键词： Audio Dictionaries as Topic greedy algorithm Continuum Robustness dimensions recognition system WWOX gene sparse representation

来源：评论

学校读者我要写书评

暂无评论

algorithms for Leader Selection in Large Dynamical Networks: Noise-corrupted Leaders

Algorithms for Leader Selection in Large Dynamical Networks:...

引用

IEEE Conference on Decision and Control

作者： Fu Lin Makan Fardad Mihailo R. Jovanovic Department of Electrical and Computer Engineering University of Minnesota Minneapolis MN 55455 Department of Electrical Engineering and Computer Science Syracuse University NY 13244

ISBN: (纸本)9781612848006

We examine the leader selection problem in multi-agent dynamical networks where leaders, in addition to relative information from their neighbors, also have access to their own states. We are interested in selecting an a priori specified number of agents as leaders in order to minimize the total variance of the stochastically forced network. Combinatorial nature of this optimal control problem makes computation of the global minimum difficult. We propose a convex relaxation to obtain a lower bound on the global optimal value, and use simple but efficient greedy algorithms to obtain an upper bound. Furthermore, we employ the alternating direction method of multipliers to search for a local minimum. Two examples are provided to illustrate the effectiveness of the developed methods.

关键词： Alternating direction method of multipliers consensus convex optimization/relaxation greedy algorithm leader selection performance bounds variance amplification

来源：评论

学校读者我要写书评

暂无评论

SUBSPACE VERTEX PURSUIT FOR SEPARABLE NON-NEGATIVE MATRIX FACTORIZATION IN HYPERSPECTRAL UNMIXING

SUBSPACE VERTEX PURSUIT FOR SEPARABLE NON-NEGATIVE MATRIX FA...

引用

IEEE International Conference on Acoustics, Speech and Signal Processing

作者： Qing Qu Xiaoxia Sun Nasser M. Nasrabadi Trac D. Tran EE Department Columbia University W. 120th Street New York NY 10027 Department of ECE the Johns Hopkins University 3400 N. Charles Street Baltimore MD 21218 U.S. Army Research Laboratory 2800 Powder Mill Road Adelphi MD 20783

ISBN: (纸本)9781479928941

Recently, the separability assumption turns the nonnegative matrix factorization (NMF) into a tractable problem. The assumption coincides with the pixel purity assumption and provides new insights for the hyperspectral unmixing problem. In this paper, we present a quasi-greedy algorithm for solving the problem by employing a back-tracking strategy. Unlike the current greedy methods, the proposed method can refresh the endmember index set in every iteration. Therefore, our method has two important characteristics: (i) low computational complexity comparable to state-of-the-art greedy methods but (ii) empirically enhanced robustness against noise. Finally, computer simulations on synthetic hyperspectral data demonstrate the effectiveness of the proposed method.

关键词： matrix decomposition greedy method factorization Computer Simulation greedy algorithm index set

来源：评论

学校读者我要写书评

暂无评论

Entropy Rate Superpixel Segmentation

Entropy Rate Superpixel Segmentation

引用

IEEE Conference on Computer Vision and Pattern Recognition

作者： Ming-Yu Liu Oncel Tuzel Srikumar Ramalingam Rama Chellappa University of Maryland Mitsubishi Electric Research Labs

ISBN: (纸本)9781457703942

We propose a new objective function for superpixel segmentation. This objective function consists of two components: entropy rate of a random walk on a graph and a balancing term. The entropy rate favors formation of compact and homogeneous clusters, while the balancing function encourages clusters with similar sizes. We present a novel graph construction for images and show that this construction induces a matroid - a combinatorial structure that generalizes the concept of linear independence in vector spaces. The segmentation is then given by the graph topology that maximizes the objective function under the matroid constraint. By exploiting submodular and monotonic properties of the objective function, we develop an efficient greedy algorithm. Furthermore, we prove an approximation bound of 1/2 for the optimality of the solution. Extensive experiments on the Berkeley segmentation benchmark show that the proposed algorithm outperforms the state of the art in all the standard evaluation metrics.

关键词： Objective function state of the art segmentation Segmentation entropy Linear independence Matroid greedy algorithm Line graph Random walk optimality

来源：评论

学校读者我要写书评

暂无评论

Enrichment set cover problem

Enrichment set cover problem

引用

12th International Symposium on Operations Research and its Applications in Engineering, Technology and Management (ISORA 2015)

作者： Yinliang Liu Xiang-Sun Zhang Ling-Yun Wu Academy of Mathematics and Systems Science Beijing Beijing CN

ISBN: (纸本)9781510821224

As a common task in the fields of bioinformatics, enrichment analysis aims to investigate the functional association between a gene list of interest which often derived from biological experiments, and specific gene sets in a large database. The core problem of enrichment analysis can be characterized as a two-objective optimization problem. In this paper, we formulated the multiple gene sets enrichment problem into a variant of the set cover problem, named enrichment set cover problem, and designed four approximation algorithms to solve the NP-hard enrichment set cover problem. The performance of proposed approximation algorithms were analyzed theoretically and evaluated on the data sets from real biological databases.

关键词： approximation algorithm enrichment analysis greedy algorithm set cover

来源：评论

学校读者我要写书评

暂无评论

Hooke and Jeeves algorithm for Linear Least-Square Problems in Sparse Signal Reconstruction

Hooke and Jeeves Algorithm for Linear Least-Square Problems ...

引用

2011 International Conference on Image Analysis and Signal Processing(2011第三届图像分析与信号处理国际会议 IASP 2011)

作者： Jinqiu Deng Dirong Chen Beihang University XueYuan Road No.37 Beijing China

ISBN: (纸本)9781612848792

greedy algorithms are the major algorithmic approaches to sparse signal reconstruction from an incomplete set of linear measurements. All the greedy algorithms involve solving linear least-square problems. This is usually implemented via CGLS. Though CGLS uses a fixed number of iterations, experiments confirm that CGLS costs more than 50 percent of the total running time of greedy algorithms. In order to reduce the running time, we introduce a method called HJLS, which applies Hooke and Jeeves algorithm to solve the least-square problems. As the columns of the measurement matrix are nearly orthogonal, HJLS also converges in a fixed number of iterations. Comparative experiments between HJLS and CGLS show that the number of iterations used in HJLS is fewer and implementing HJLS instead of CGLS reduces the total running time of greedy algorithms by more than 20 percent.

关键词： cotnpressive sensing greedy algorithm linear least-square problem conjugate gradient method Hooke and Jeeves algorithm

来源：评论

学校读者我要写书评

暂无评论

Joint Spectrum Sensing and Power Allocation algorithm for Spectrum Efficiency Optimization in Ultra Wideband Cognitive Radio Networks

Joint Spectrum Sensing and Power Allocation Algorithm for Sp...

引用

IEEE Vehicular Technology Conference

作者： Liaoyuan Zeng Sean McGrath Intelligent Visual Information Processing and Communication Lab University of Electronic Science and Technology of China Wireless Access Research Centre University of Limerick

ISBN: (纸本)9781467318808

Ultra Wideband (UWB) system uses extremely low signal power to coexist with other primary users (PUs), which limits the use of the UWB's wide spectrum band. Cognitive Radio (CR) enables UWB systems to efficiently use the overlapped spectrum without causing interference to other wireless systems. In this paper, we focuses on the low-complexity joint optimization algorithm design with respect to transmit power allocation and spectrum sensing time (SST) for maximizing the spectrum efficiency of the Orthogonal Frequency Division Multiplexing based CR-UWB system. The SST optimization algorithm minimizes the spectrum sensing time in order to maximize the time length of applying the power allocation algorithm for data transmission. The proposed group power allocation algorithm adaptively assigns the transmit power to the subcarrier groups according to the effective signal-to-noise ratio (SNR) of each subcarrier group based on greedy algorithm. The proposed joint optimization algorithm can maximize the CR-UWB systems spectrum efficiency at a extremely low primary user SNR regime with low complexity.

关键词： Ultra wideband technologies spectral efficiency Allocation algorithm power splitting Transmitter power Orthogonal frequency division multiplexing signal to noise ratios Optimization algorithms Spectra Cognitive radio Radio networks signal power CARRIER SYSTEM greedy algorithm data transmission

来源：评论

学校读者我要写书评

暂无评论

Shorten the Trajectory of Mobile Sensors in Sweep Coverage Problem

Shorten the Trajectory of Mobile Sensors in Sweep Coverage P...

引用

IEEE Global Communications Conference

作者： Yuchen Feng Xiaofeng Gao Fan Wu Guihai Chen Shanghai Key Laboratory of Scalable Computing and Systems Department of Computer Science and Engineering Shanghai Jiao Tong University

ISBN: (纸本)9781479959532

Sweep coverage is the problem of scheduling mobile sensors to cover a set of PoIs (Points of Interest) periodically. To improve the monitoring efficiency, multiple mobile sensors can cooperate with each other together to finish the task. With limited unrenewable battery power, how to schedule multiple mobile sensors to visit all PoIs with minimum energy consumption is a challenging problem. In this paper, we introduce an optimization problem to minimize the makespan of mobile sweep routes (M~3SR) and prove its NP-hardness on 2D plane. We then design a greedy algorithm named GD-Sweep and an approximation named BS-Sweep to solve M~3SR. We prove theoretically that BS-Sweep is a constant-factor approximation with approximation ratio of 6, while exhibit numerically that GD-Sweep performs better according to various simulation results. Compared with previous literature, our design can reduce the length of sweep routes more efficiently.

关键词： POIs SWEEPS Mobile greedy algorithm minimum energy consumption Sensors approximation Simulation results Coverage

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共229页 << < 220 221 222 223 224 225 226 227 228 229 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：