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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

2,240 篇 期刊文献
1,749 篇 会议
19 篇 学位论文
1 册 图书

馆藏范围

4,009 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

3,677 篇 工学
- 2,095 篇 计算机科学与技术...
- 1,456 篇 软件工程
- 741 篇 电气工程
- 613 篇 控制科学与工程
- 332 篇 机械工程
- 325 篇 信息与通信工程
- 154 篇 动力工程及工程热...
- 149 篇 石油与天然气工程
- 129 篇 电子科学与技术（可...
- 129 篇 土木工程
- 91 篇 材料科学与工程（可...
- 89 篇 仪器科学与技术
- 75 篇 环境科学与工程（可...
- 72 篇 交通运输工程
- 69 篇 力学（可授工学、理...
- 64 篇 建筑学
- 61 篇 化学工程与技术
- 57 篇 水利工程
- 55 篇 航空宇航科学与技...
- 47 篇 生物医学工程（可授...
1,884 篇 理学
- 1,453 篇 数学
- 230 篇 系统科学
- 197 篇 物理学
- 197 篇 统计学（可授理学、...
- 68 篇 化学
- 60 篇 生物学
391 篇 管理学
- 340 篇 管理科学与工程(可...
- 72 篇 工商管理
- 48 篇 图书情报与档案管...
95 篇 医学
54 篇 经济学
- 51 篇 应用经济学
28 篇 农学
21 篇 法学
16 篇 教育学
9 篇 文学
3 篇 军事学
2 篇 艺术学

主题

4,009 篇 optimization alg...
270 篇 optimization
190 篇 algorithms
98 篇 machine learning
88 篇 design
66 篇 particle swarm o...
55 篇 genetic algorith...
54 篇 optimal control
51 篇 convergence
48 篇 objective functi...
47 篇 genetic algorith...
39 篇 simulation
39 篇 artificial intel...
38 篇 optimal design
38 篇 converge
34 篇 evolutionary alg...
34 篇 heuristic algori...
33 篇 predictive contr...
33 篇 deep learning
32 篇 optimisation

机构

12 篇 duy tan univ ins...
10 篇 national key lab...
8 篇 amman arab univ ...
7 篇 stanford univers...
7 篇 univ technol syd...
7 篇 semnan univ dept...
6 篇 georgia inst tec...
6 篇 department of co...
6 篇 google research ...
6 篇 school of artifi...
5 篇 politecn milan d...
5 篇 tu wien austria
5 篇 ain shams univ f...
5 篇 google deepmind ...
5 篇 school of data s...
5 篇 school of comput...
5 篇 university of mi...
5 篇 ton duc thang un...
4 篇 college of compu...
4 篇 semnan univ fac ...

作者

12 篇 abualigah laith
12 篇 ehteram mohammad
9 篇 gandomi amir h.
9 篇 hasanipanah mahd...
9 篇 notarstefano giu...
9 篇 ishibuchi hisao
8 篇 zhan zhi-hui
8 篇 zhang jun
7 篇 neumann frank
7 篇 rashid tarik a.
7 篇 ahmed ali najah
7 篇 hasanien hany m.
7 篇 quirynen rien
7 篇 pan jeng-shyang
7 篇 zhang lijun
6 篇 sundaram shreyas
6 篇 neumann aneta
6 篇 wang lei
6 篇 zhang lei
6 篇 yang shengxiang

语言

3,505 篇 英文
441 篇 其他
51 篇 中文
5 篇 土耳其文
4 篇 斯洛文尼亚文
3 篇 法文
1 篇 德文
1 篇 西班牙文
1 篇 塞尔维亚文

检索条件"主题词=Optimization Algorithms"

共 4009 条记录，以下是3291-3300 订阅

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

详细简洁

排序：

An Evolutive Approach for Designing Thermal and Performance-Aware Heterogeneous 3D-NoCs

An Evolutive Approach for Designing Thermal and Performance-...

引用

Symposium on Integrated Circuits and Systems Design

作者： Johanna Sepulveda Guy Gogniat Ricardo Pires Wang Chau Marius Strum Microelectronics Laboratory LME University of Sao Paulo Information and Communication Science and Technology Laboratory Lab-STICC Universite Bretagne Sud

ISBN: (纸本)9781479911301

Three dimensional Multiprocessor System-on-Chip (3D-MPSoC) adoption. It is characterized by the integration of a large amount of hardware components on a single multilayer chip. However, heating is one of the major pitfalls of the 3D-MPSoCs. Three dimensional Network-on-Chip (3D-NoC) is used as the communication structure of 3D-MPSoCs. Its main role in system operation and performance makes the optimal 3D-NoC design a critical task. Final 3D-NoC configuration must fulfill all the application requirements and heating constraints of the system. Topology and mapping are some of the most critical parameters in 3D-NoC design, strongly influencing the 3D-MPSoC performance and cost. 3D-NoC topology and mapping has been solved for single application systems on homogeneous 3D-NoCs using single and multi-objective optimization algorithms. In this paper we use a multi-objective immune algorithm (MIA), to solve the multi-application 3D-NoC topology and mapping problems. Latency and power consumption are adopted as the target multi-objective functions constrained by the heating function. Our strategy has been applied on 8 3D-MPSoC benchmarks. Their final 3D-NoC configurations have up to 73% power and 42% latency enhancement when compared to previous reported results.

关键词： communication structure MAPPING(MATHEMATICAL) computer utility Operating systems topology optimization algorithms Power consumption Latency Heating

来源：评论

学校读者我要写书评

暂无评论

Curvature and Optimal algorithms for Learning and Minimizing Submodular Functions 13

Curvature and Optimal Algorithms for Learning and Minimizing...

引用

Annual Conference on Neural Information Processing Systems

作者： Rishabh Iyer Stefanie Jegelka Jeff Bilmes University of Washington Dept. of EE Seattle U.S.A. University of California Dept. of EECS Berkeley U.S.A.

ISBN: (纸本)9781632660244

We investigate three related and important problems connected to machine learning: approximating a submodular function everywhere, learning a submodular function (in a PAC-like setting), and constrained minimization of submodular functions. We show that the complexity of all three problems depends on the "curvature" of the submodular function, and provide lower and upper bounds that refine and improve previous results. Our proof techniques are fairly generic. We either use a black-box transformation of the function (for approximation and learning), or a transformation of algorithms to use an appropriate surrogate function (for minimization). Curiously, curvature has been known to influence approximations for submodular maximization, but its effect on minimization, approximation and learning has hitherto been open. We complete this picture, and also support our theoretical claims by empirical results.

关键词： Learning optimization algorithms Curvature Function approximation

来源：评论

学校读者我要写书评

暂无评论

Linear model predictive control based on approximate optimal control inputs and constraint tightening

Linear model predictive control based on approximate optimal...

引用

IEEE Annual Conference on Decision and Control

作者： Ion Necoara Valentin Nedelcu Tamas Keviczky Minh Dang Doan Bart de Schutter Automatic Control and Systems Engineering Department University Politehnica Bucharest Romania Delft Center for Systems and Control Delft University of Technology The Netherlands Can Tho University of Technology Vietnam

ISBN: (纸本)9781467357159

In this paper we propose a model predictive control scheme for discrete-time linear time-invariant systems based on inexact numerical optimization algorithms. We assume that the solution of the associated quadratic program produced by some numerical algorithm is possibly neither optimal nor feasible, but the algorithm is able to provide estimates on primal suboptimality and primal feasibility violation. By tightening the complicating constraints we can ensure the primal feasibility of the approximate solutions generated by the algorithm. Finally, we derive a control strategy that has the following properties: the constraints on the states and inputs are satisfied, asymptotic stability of the closed-loop system is guaranteed, and the number of iterations needed for a desired level of suboptimality can be determined.

关键词： nonlinear model predictive control Tightening Predictive control control strategy control input optimization algorithms asymptotic stability region Closed loop systems Approximate iterative methods linear models Optimal control Constraint

来源：评论

学校读者我要写书评

暂无评论

A generalized distributed accelerated gradient method for distributed model predictive control with iteration complexity bounds

A generalized distributed accelerated gradient method for di...

引用

American Control Conference

作者： Pontus Giselsson Department of Automatic Control LTH Lund University Box 118 SE-221 00 Lund Sweden

ISBN: (纸本)9781479901777

Most distributed optimization methods used for distributed model predictive control (DMPC) are gradient based. Gradient based optimization algorithms are known to have iterations of low complexity. However, the number of iterations needed to achieve satisfactory accuracy might be significant. This is not a desirable characteristic for distributed optimization in distributed model predictive control. Rather, the number of iterations should be kept low to reduce communication requirements, while the complexity within an iteration can be significant. By incorporating Hessian information in a distributed accelerated gradient method in a well-defined manner, we are able to significantly reduce the number of iterations needed to achieve satisfactory accuracy in the solutions, compared to distributed methods that are strictly gradient-based. Further, we provide convergence rate results and iteration complexity bounds for the developed algorithm.

关键词： iterative methods gradient methods Distribute Bound Gradient optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

Better Balance by Being Biased: A 0.8776-Approximation for Max Bisection 13

Better Balance by Being Biased: A 0.8776-Approximation for M...

引用

Annual ACM-Society for Industrial and Applied Mathmatics Symposium on Discrete algorithms

作者： Per Austrin Siavosh Benabbas Konstantinos Georgiou Aalto University Department of Computer Science University of Toronto Department of Combinatorics & Optimization University of Waterloo

ISBN: (纸本)9781611972511

Recently Raghavendra and Tan (SODA 2012) gave a 0.85 approximation algorithm for the Max Bisection problem. We improve their algorithm to a 0.8776-approximation. As Max Bisection is hard to approximate within α_(GW) + ε ≈ 0.8786 under the Unique Games Conjecture (UGC), our algorithm is nearly optimal. We conjecture that Max Bisection is approximable within α_(GW)-ε, i.e., the bisection constraint (essentially) does not make Max Cut harder. We also obtain an optimal algorithm (assuming the UGC) for the analogous variant of MAX 2-Sat. Our approximation ratio for this problem exactly matches the optimal approximation ratio for MAX 2-Sat, i.e., α_(LLZ)+ε≈ 0.9401, showing that the bisection constraint does not make MAX 2-Sat harder. This improves on a 0:93-approximation for this problem due to Raghavendra and Tan.

关键词： Max Bisection Max BISECTION problem bisection constraint User generated content optimal approximation optimization algorithms tan Conjecture Biased algorithms Approximate

来源：评论

学校读者我要写书评

暂无评论

Trading Computation for Communication: Distributed Stochastic Dual Coordinate Ascent 13

Trading Computation for Communication: Distributed Stochasti...

引用

Annual Conference on Neural Information Processing Systems

作者： Tianbao Yang NEC Labs America Cupertino CA 95014

ISBN: (纸本)9781632660244

We present and study a distributed optimization algorithm by employing a stochastic dual coordinate ascent method. Stochastic dual coordinate ascent methods enjoy strong theoretical guarantees and often have better performances than stochastic gradient descent methods in optimizing regularized loss minimization problems. It still lacks of efforts in studying them in a distributed framework. We make a progress along the line by presenting a distributed stochastic dual coordinate ascent algorithm in a star network, with an analysis of the tradeoff between computation and communication. We verify our analysis by experiments on real data sets. Moreover, we compare the proposed algorithm with distributed stochastic gradient descent methods and distributed alternating direction methods of multipliers for optimizing SVMs in the same distributed framework, and observe competitive performances.

关键词： Communication Research optimization algorithms ascent Stochastic Distribute Coordinates Dual Multiplying circuits tradeoffs Star networks observational data

来源：评论

学校读者我要写书评

暂无评论

An optimization Algorithm for Scalable Multiple Description Scalar Quantizers

An Optimization Algorithm for Scalable Multiple Description ...

引用

International Symposium on Information Theory and its Applications (ISITA)

作者： Satti, Shahid Mahmood Deligiannis, Nikos Munteanu, Adrian Schelkens, Peter Cornelis, Jan Vrije Univ Brussel Dept Elect & Informat ETRO B-1050 Brussels Belgium

ISBN: (纸本)9784885522673

A scalable multiple description scalar quantizer (SMDSQ) is a quantization based framework used for scalable multiple description coding (SMDC). In this paper, we introduce a novel generalization of the Lloyd-Max algorithm to realize locally optimal SMDSQs. Both level-constrained and entropy-constrained cases are considered. For both cases, locally optimal solutions are realized by iterative execution of the centroid and the modified nearest-neighbor conditions. Experimental results confirm that, for a zero-mean unit-variance Gaussian source, the optimization algorithm enables a significant reduction in distortion for the level-constrained case. Moreover, relatively lesser but still significant distortion-rate (D-R) gains are viable for the entropy-constrained case. It is shown that, for a packetized transmission of Gaussian as well as wavelet-decomposed images, the obtained optimization gains translate into an average improvement in the decoder's signal-to-noise-ratio (SNR) for a wide range of packet loss rates.

关键词： optimization algorithms quantizer Scalability Gauss signal to noise ratios Scalar Centroid Packet loss Quantization

来源：评论

学校读者我要写书评

暂无评论

A new Algorithm for Antenna optimization in Aerospace applications: the Sounding Rocket Test Case

A new Algorithm for Antenna optimization in Aerospace applic...

引用

Electromagnetic Metrology Symposium

作者： R. Albi F. Grimaccia M. Mussetta A. Niccolai R. E. Zich Dipartimento di Energia Energy Department Politecnico di Milano Milano Italy

ISBN: (纸本)9781467357067

This paper aims to optimize the design of a novel antenna for aerospace applications to be integrated on an experimental rocket that has been designed in an advanced research student program. In order to optimize EM performance of such a system a novel optimization algorithm called SNO, Social Network optimization, has been developed and tested to find the best configuration that assure the effectiveness of the overall rocket design. The explosion of Internet and Social Network diffusion in the last years is having a direct impact on different research fields as computer science, economy, sociology and biological science. SNO concept is an optimization algorithm inspired by the emulation of decision making process in social network environments. The experimental results of the rocket antenna design will be presented to prove the effectiveness of this new algorithm.

关键词： Aerospace applications optimization algorithms Social Media Social Networks Sounding rockets SKIL gene simulating decision making process Eruca sativa Explosions ANTENNA antennae CASING INSPECTION rocket design

来源：评论

学校读者我要写书评

暂无评论

Multiobjective optimization for Optimal Placement and Size of DG using Shuffled Frog Leaping Algorithm

Multiobjective Optimization for Optimal Placement and Size o...

引用

2nd International Conference on Advances in Energy Engineering (ICAEE)

作者： Yammani, Chandrasekhar Maheswarapu, Sydulu Matam, Sailajakumari Natl Inst Technol Dept Elect Engn Warangal 506004 Andhra Pradesh India

There has been a great interest in integration of distributed generation (DG) units at distribution level in the recent years. DGs can provide cost-effective, environmental friendly, higher power quality and more reliable energy solutions than conventional generation. For maximum power loss reduction, proper sizing and position of distributed generators are ardently necessary. This paper presents a simple method for optimizing cost and optimal placement of generators. A simple vector based load flow technique is implemented on 38 bus distribution systems. This paper presents a new methodology using a new population based meta heuristic approach namely Shuffled frog leaping algorithm for the placement of Distributed Generators (DG) in the radial distribution systems to reduce the real power losses and cost of the DG. The paper also focuses on optimization of weighting factor, which balances the cost and the loss factors and helps to build up desired objectives with maximum potential benefit. The proposed method has outperformed the other methods in terms of the quality of solution and computational efficiency. (C) 2011 Published by Elsevier Ltd. Selection and/or peer-review under responsibility of the organizing committee of 2nd International Conference on Advances in Energy Engineering (ICAEE).

关键词： Distributed Generation optimization algorithms Shuffled Frog Leaping Algorithm

来源：评论

学校读者我要写书评

暂无评论

Synthesis of Sparse Planar Array using Modified Bayesian optimization Algorithm

Synthesis of Sparse Planar Array using Modified Bayesian Opt...

引用

Electromagnetic Metrology Symposium

作者： B. V. Ha R. E. Zich M. Mussetta P. Pirinoli Dipartimento di Energia Politecnico di Milano Dipartimento di Elettronica Politecnico di Torino

ISBN: (纸本)9781467357067

Controlling the position of elements in sparse planar array would be the hardest work in the synthesis procedure since the array has to satisfy multiple design constraints e.g. number of elements, elements spacing and arrays aperture. In this paper, a simple method is implemented to effectively control 2-D sparse array. The approach implements two sets of data to separately manage the x- and y-coordinate of each element in the array. The array is then synthesized as an optimization problem using the recently improved version of Bayesian optimization Algorithm. As a proof of concept, the results of a 108 element sparse planar array are here presented and discussed.

关键词： Planar antennas Elements y-coordinate optimization algorithms arrays synthesis design constraints Dataset Bayesian inference

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共401页 << < 326 327 328 329 330 331 332 333 334 335 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：