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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

912 篇 会议
69 篇 期刊文献
41 册 图书

馆藏范围

1,021 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

494 篇 工学
- 368 篇 计算机科学与技术...
- 160 篇 软件工程
- 132 篇 电气工程
- 69 篇 信息与通信工程
- 69 篇 控制科学与工程
- 27 篇 电子科学与技术（可...
- 19 篇 机械工程
- 13 篇 动力工程及工程热...
- 12 篇 仪器科学与技术
- 10 篇 生物工程
- 9 篇 光学工程
- 9 篇 材料科学与工程（可...
- 9 篇 生物医学工程（可授...
- 8 篇 交通运输工程
- 7 篇 力学（可授工学、理...
- 7 篇 冶金工程
- 7 篇 化学工程与技术
- 5 篇 建筑学
228 篇 理学
- 190 篇 数学
- 27 篇 系统科学
- 24 篇 物理学
- 19 篇 统计学（可授理学、...
- 12 篇 生物学
- 7 篇 化学
78 篇 管理学
- 66 篇 管理科学与工程(可...
- 19 篇 工商管理
- 11 篇 图书情报与档案管...
15 篇 医学
- 12 篇 临床医学
11 篇 法学
- 11 篇 社会学
8 篇 经济学
- 8 篇 应用经济学
3 篇 农学
1 篇 教育学

主题

194 篇 optimization
152 篇 genetic algorith...
72 篇 algorithm design...
56 篇 particle swarm o...
53 篇 optimization met...
44 篇 design optimizat...
34 篇 computational mo...
33 篇 convergence
27 篇 heuristic algori...
26 篇 ant colony optim...
25 篇 computer science
25 篇 signal processin...
25 篇 evolutionary com...
24 篇 approximation al...
24 篇 neural networks
23 篇 conferences
22 篇 application soft...
21 篇 clustering algor...
21 篇 mathematical mod...
20 篇 image segmentati...

机构

10 篇 hubei univ techn...
8 篇 hubei university...
7 篇 computer systems...
6 篇 school of comput...
4 篇 wuhan fiberhome ...
4 篇 graduate school ...
4 篇 jožef stefan int...
3 篇 fujian prov univ...
3 篇 democritus unive...
3 篇 lviv polytechnic...
3 篇 mälardalen unive...
3 篇 state key labora...
2 篇 lawrence berkele...
2 篇 rutgers state un...
2 篇 všb-tu ostrava 1...
2 篇 wroclaw universi...
2 篇 feecs vå b - tec...
2 篇 ind technol res ...
2 篇 feecs department...
2 篇 computer science...

作者

12 篇 ye zhiwei
11 篇 zhiwei ye
6 篇 klaus jansen
4 篇 zelinka ivan
4 篇 ajith abraham
4 篇 václav snášel
4 篇 korošec peter
3 篇 hui wang
3 篇 wang hui
3 篇 keiichi tamura
3 篇 zhan sikai
3 篇 josé d. p. rolim
3 篇 hajime kitakami
3 篇 chunzhi wang
3 篇 huamin wang
3 篇 takashi hasuike
3 篇 šilc jurij
3 篇 jin can
3 篇 senkerik roman
3 篇 sun shuang

语言

1,000 篇 英文
10 篇 其他
9 篇 中文
2 篇 俄文

检索条件"任意字段=International Workshop on Multilevel Optimization - Algorithms and Applications"

共 1022 条记录，以下是341-350 订阅

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

详细简洁

排序：

22nd AIPR workshop: Interdisciplinary Computer Vision: applications and Changing Needs

22nd AIPR Workshop: Interdisciplinary Computer Vision: Appli...

引用

22nd Applied Imagery Pattern Recognition workshop: Interdisciplinary Computer Vision: applications and Changing Needs 1993

The proceedings contain 22 papers. The topics discussed include: morphological edge detection for oceanographic images;genetic algorithms for terrain categorization of landsat images;region-of-interest detection for fingerprint classification;spatial-spectral processing for hyperspectral imagery using neural networks;pixel-level object segmentation from multispectral sensor imagery;hierarchical polynomial network approach to automated target recognition;and intensified cameras: a method of image-quality optimization for visual observation.

关键词：

来源：评论

学校读者我要写书评

暂无评论

5th international workshop on Soft Computing Models in Industrial applications , SOCO 2010

5th International Workshop on Soft Computing Models in Indus...

引用

5th international workshop on Soft Computing Models in Industrial applications , SOCO 2010

ISBN: (纸本)9783642131608

The proceedings contain 32 papers. The special focus in this conference is on Soft Computing Models in Industrial applications. The topics include: Hybrid Dynamic Planning Mechanism for Virtual Organizations;a Multiobjective Variable Neighborhood Search for Solving the Motif Discovery Problem;Combinatorial Auctions for Coordination and Control of Manufacturing MAS: Updating Prices Methods;Solving the Routing and Wavelength Assignment Problem inWDM Networks by Using a Multiobjective Variable Neighborhood Search Algorithm;a Software Tool for Harmonic Distortion Simulation Caused by Non-linear Household Loads;Scalable Intelligence and Adaptation in Scheduling DSS;optimization of Parallel Manipulators Using Evolutionary algorithms;iGenda: An Event Scheduler for Common Users and Centralised Systems;a Parallel Cooperative Evolutionary Strategy for Solving the Reporting Cells Problem;multi-criteria Manipulator Trajectory optimization Based on Evolutionary algorithms;a Decision Support System for Logistics Operations;combining Heuristics Backtracking and Genetic Algorithm to Solve the Container Loading Problem withWeight Distribution;greenhouse Heat Load Prediction Using a Support Vector Regression Model;evaluating the Low Quality Measurements in Lighting Control Systems;GRASP Algorithm for optimization of Grids for Multiple Classifier System;soft Computing Models for an Environmental Application;a Scatter Search Based Approach to Solve the Reporting Cells Problem;fuzzy optimization of Start-Up Operations for Combined Cycle Power Plants;multi-Network-Feedback-Error-Learning with Automatic Insertion;catalog Segmentation by Implementing Fuzzy Clustering and Mathematical Programming Model;an Optimized 3D Surface Reconstruction Method Using Spatial Kalman Filtering of Projected Line Patterns;the Gene Expression Programming Applied to Demand Forecast;decision Making and Quality-of-Information;brain Magnetic Resonance Spectroscopy Classifiers.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A sharper local lemma with improved applications

A sharper local lemma with improved applications

引用

15th international workshop on Approximation algorithms for Combinatorial optimization Problems, APPROX 2012 and the 16th international workshop on Randomization and Computation, RANDOM 2012

作者： Kolipaka, Kashyap Szegedy, Mario Xu, Yixin Department of Computer Science Rutgers the State University of New Jersey United States

ISBN: (纸本)9783642325113

We give a new family of Lovász Local Lemmas (LLL), with applications. Shearer has given the most general condition under which the LLL holds, but the original condition of Lovász is simpler and more practical. Do we have to make a choice between practical and optimal? In this article we present a continuum of LLLs between the original and Shearer's conditions. One of these, which we call Clique LLL (CLLL), particularly stands out, and is natural in those settings, where the event space is defined with discrete independent random variables (á la Moser and Tardos ). Using this version we get improved bounds in applications for Acyclic Edge Coloring and Non-repetitive Vertex Coloring. © 2012 Springer-Verlag.

关键词： Computers

来源：评论

学校读者我要写书评

暂无评论

Aperture-coupled Bowtie Patch Antenna Design for Autonomous Driving applications

Aperture-coupled Bowtie Patch Antenna Design for Autonomous ...

引用

international workshop on Antenna Technology (iWAT)

作者： Iliadis, Lazaros A. Boursianis, Achilles D. Rekkas, Vasileios P. Zaharis, Zaharias D. Koulouridis, Stavros Goudos, Sotirios K. Aristotle Univ Thessaloniki ELEDIA AUTH Sch Phys Thessaloniki Greece Aristotle Univ Thessaloniki Dept Elect & Comp Engn Thessaloniki Greece Univ Patras Dept Elect & Comp Engn Patras Greece

ISBN: (纸本)9798350334081

Autonomous driving will reshape transportation networks, offering at the same time many benefits such as safety, reliable vehicle-to-vehicle communication, and extended telecommunications. For a self-driving vehicle to navigate freely and perceive its environment, it is necessary to be equipped with many sensors. Automotive radars and antenna arrays that operate at 76-81 GHz have been proposed as key elements in future autonomous vehicles. In this work, an aperture-coupled bowtie antenna is designed utilizing hunger games search optimization. The proposed element achieves quite satisfactory values of return loss and gain, as well as broadband operation at 76 GHz - 81 GHz.

关键词： Aperture-coupling bowtie antenna 79 GHz autonomous driving hunger games search swarm intelligence algorithms

来源：评论

学校读者我要写书评

暂无评论

Proceedings of IA3 2013 - 3rd workshop on Irregular applications: Architectures and algorithms, Held in Conjunction with SC 2013: The international Conference for High Performance Computing, Networking, Storage and Analysis

Proceedings of IA3 2013 - 3rd Workshop on Irregular Applicat...

引用

3rd workshop on Irregular applications: Architectures and algorithms, IA3 2013 - Held in Conjunction with the international Conference for High Performance Computing, Networking, Storage and Analysis, SC 2013

ISBN: (纸本)9781450325035

The proceedings contain 12 papers. The topics discussed include: a novel finite element method assembler for co-processors and accelerators;the energy case for graph processing on hybrid CPU and GPU systems;a synthetic task model for HPC-grade optical network performance evaluation;maximizing the performance of irregular applications on multithreaded, NUMA;analysis of computing and energy performance of multicore, NUMA, and manycore platforms for an irregular application;in-memory data compression for sparse matrices;on the GPU performance of cell-centered finite volume method over unstructured tetrahedral meshes;nonzero pattern analysis and memory access optimization in GPU-based sparse LU factorization for circuit simulation;register level sort algorithm on multi-core SIMD processors;parallel sparse FFT;an AMR computation and communication dependency and analysis methodology;and parallel implementations of ensemble data assimilation for atmospheric prediction.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Comparison between single and multi objective genetic algorithm approach for optimal stock portfolio selection

Comparison between single and multi objective genetic algori...

引用

Student workshop on Bioinspired optimization Methods and their applications, BIOMA 2014

作者： Cvörnjek, Nejc Brezočnik, Miran Jagrič, Timotej Papa, Gregor Faculty of Mechanical Engineering University of Maribor Slovenia Institute for Finance and Banking Faculty of Economics and Business University of Maribor Slovenia Laboratory of Intelligent Systems Faculty of Mechanical Engineering University of Maribor Slovenia Computer Systems Department Jožef Stefan Institute Ljubljana Slovenia Jožef Stefan International Postgraduate School Ljubljana Slovenia

ISBN: (纸本)9789612640682

Portfolio selection is one of the most common problem in the field of finance. Many investors would like to allocate their funds in such way that ratio between return and risk will be as high as possible. Up to today, the problem has been solved with various approaches based on genetic algorithm technique and GA has proved to be suitable. In this paper we applied two different approaches based on genetic algorithm technique in order to solve the problem. First is single objective approach and second is multi objective one (NSGA-II). Results are showing that there is no significant difference between approaches.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Minimal Cost Reconfiguration of Data Placement in Storage Area Network

Minimal Cost Reconfiguration of Data Placement in Storage Ar...

引用

7th international workshop on Approximation and Online algorithms

作者： Shachnai, Hadas Tamir, Gal Tamir, Tami Technion Israel Inst Technol Dept Comp Sci IL-32000 Haifa Israel Interdisciplinary Ctr Sch Comp Sci Herzliyya Israel

ISBN: (纸本)9783642124495

Video-on-Demand (VoD) services require frequent updates in file configuration on the storage subsystem, so as to keep up with the frequent changes in movie popularity. This defines a natural reconfiguration problem in which the goal is to minimize the cost of moving from one file configuration to another. The cost is incurred by file replications performed throughout the transition. The problem shows up also in production planning, preemptive scheduling with set-up costs, and dynamic placement of Web applications. We show that the reconfiguration problem is NP-hard already on very restricted instances. We then develop algorithms which achieve the optimal cost by using servers whose load capacities are increased by O(1), in particular, by factor 1 + delta for any small 0 < delta < I when the number of servers is fixed, and by factor of 2 + epsilon for arbitrary number of servers, for some epsilon is an element of [0, 1). To the best of our knowledge, this fundamental optimization problem is studied here for the first time.

关键词： optimization

来源：评论

学校读者我要写书评

暂无评论

Warp-centric K-Nearest Neighbor Graphs construction on GPU 21

Warp-centric K-Nearest Neighbor Graphs construction on GPU

引用

50th international Conference on Parallel Processing (ICPP)

作者： Meyer, Bruno Pozo, Aurora Zola, Wagner M. Nunan Univ Fed Parana Curitiba Parana Brazil

ISBN: (纸本)9781450384414

Recent advances and applications of machine learning algorithms are becoming more common in different fields. It is expected that some applications require the processing of large datasets with those algorithms, which leads to high computational costs. Massively parallel GPU methods can be applied to surpass this limitation and reduce the execution time of these algorithms. The construction of approximate K-Nearest Neighbor Graphs (K-NNG) is frequently required for similarity search or other applications such as the t-SNE dimensionality reduction technique. The K-NNG represents the K closest points (neighbors) for each point in a set. In this paper, we propose and analyze an all-points K-Nearest Neighbor Graph construction algorithm on GPU called Warp-centric K-NNG (w-KNNG), which is based on the Random Projection Forest method. Usually, the construction or search for k-NN sets for high dimensional points presents challenges for its implementation on many-core processing units, due to the space limitation in maintaining these sets in high speed shared memory. We present three warp-centric approaches for our algorithm that efficiently search and maintain the k-NN high dimensional point sets in global memory. In our experiments, the new methods allows the algorithm to achieve up to 639% faster execution when compared to the state-of-the-art FAISS library, considering an equivalent accuracy of approximate K-NNG. One of the new strategies (w-KNNG atomic) is more successful when applied to a smaller number of dimensions, while the tiled w-KNNG approach was successful in general scenarios for higher dimensional points.

关键词： GPU K-Nearest Neighbors Graph random projection forest cuda performance optimization

来源：评论

学校读者我要写书评

暂无评论

Nonlinear optimization and applications 1

引用

1000年

作者： G. Pillo F. Giannessi

ISBN: (数字)9781489902894

ISBN: (纸本)9780306453168;9781489902917

This volume contains the edited texts of the lectures presented at the workshop on Nonlinear optimization: Theory and applications, held in Erice at the "G. Stampacchia" School of Mathematics of the "E. Majorana" international Centre for Scientific Culture June 13-21, 1995. The meeting was conceived to review and discuss recent advances and promising research trends concerning theory, algorithms, and innovative applications in the field This is a field of mathematics which is providing viable of Nonlinear optimization. tools in engineering, in economics and in other applied sciences, and which is giving a great contribution also in the solution of the more practiced linear optimization prob lems. The meeting was attended by approximately 70 people from 18 countries. Besides the lectures, several formal and informal discussions took place. The result was a broad exposure providing a wide and deep understanding of the present research achievements in the field. We wish to express our appreciation for the active contributions of all the partici pants in the meeting. Our gratitude is due to the Ettore Majorana Center in Erice, which offered its facilities and stimulating environment: its staff was certainly instrumental for the success of the meeting. Our gratitude is also due to Francisco Facchinei and Massino Roma for the time spent in the organization of the workshop, and to Giuliana Cai for the careful typesetting of this volume.

关键词： Software Engineering/Programming and Operating Systems optimization applications of Mathematics

来源：评论

学校读者我要写书评

暂无评论

5th international workshop, workshop on algorithms and Data Structures, WADS 1997

5th International Workshop, Workshop on Algorithms and Data ...

引用

5th international workshop on algorithms and Data Structures, WADS 1997

ISBN: (纸本)3540633073

The proceedings contain 42 papers. The special focus in this conference is on algorithms and Data Structures, Invited Lecture The topics include: Discrepancy Theory and Computational Geometry;Dynamic Motion Planning in Low Obstacle Density Environments;Visibility-Based Pursuit-Evasion in a Polygonal Environment;Maintaining the Extent of a Moving Point Set;Finding Cores of Limited Length;On Bipartite Crossings, Largest Biptanar Subgraphs, and the Linear Arrangement Problem;Approximation algorithms for a Genetic Diagnostics Problem;Cartographic Line Simplification and Polygon CSG Formulae in O(n Log'n) Time;Constrained TSP and Low-Power Computing;On-Line Load Balancing for Related Machines;A Linear-Time Algorithm for the 1-Mismatch Problem;On Some Geometric optimization Problems in Layered Manufacturing;New TSP Construction Heuristics and Their Relationships To The 2-Opt;Pattern Matching in Hypertext;Multiple Approximate String Matching;Applied Computational Geometry;Checking the Convexity of Polytopes and the Planarity of Subdivisions;Voronoi Diagrams for Polygon-Offset Distance Functions;Randomized algorithms for that Ancient Scheduling Problem;Optimal Parallel algorithms for Proximate Points, with applications;An Efficient Algorithm for Shortest Paths in Vertical and Horizontal Segments;On Geometric Path Query Problems;On-Line Scheduling with Hard Deadlines;Load Balanced Mapping of Data Structures in Parallel Memory Modules for Fast and Conflict-Free Templates Access;Parallel vs. Parametric Complexity;Position-Independent Near Optimal Searching and On-Line Recognition in Star Polygons;Dynamic Data Structures for Fat Objects and Their applications and Intractability of Assembly Sequencing: Unit Disks in the Plane.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共103页 << < 31 32 33 34 35 36 37 38 39 40 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：