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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

101 篇 会议
1 册 图书

馆藏范围

102 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

49 篇 工学
- 40 篇 计算机科学与技术...
- 22 篇 软件工程
- 6 篇 控制科学与工程
- 4 篇 电气工程
- 4 篇 生物医学工程（可授...
- 4 篇 生物工程
- 3 篇 机械工程
- 3 篇 光学工程
- 2 篇 电子科学与技术（可...
- 2 篇 信息与通信工程
- 2 篇 化学工程与技术
- 1 篇 材料科学与工程（可...
- 1 篇 农业工程
32 篇 理学
- 27 篇 数学
- 7 篇 统计学（可授理学、...
- 5 篇 物理学
- 4 篇 生物学
- 4 篇 系统科学
- 3 篇 化学
- 1 篇 地球物理学
- 1 篇 地质学
7 篇 管理学
- 4 篇 图书情报与档案管...
- 3 篇 管理科学与工程(可...
- 1 篇 工商管理
1 篇 农学
- 1 篇 作物学
1 篇 医学
- 1 篇 基础医学(可授医学...
- 1 篇 临床医学
- 1 篇 药学(可授医学、理...

主题

6 篇 cameras
4 篇 image edge detec...
4 篇 vectors
4 篇 algorithm design...
4 篇 image color anal...
3 篇 data mining
3 篇 web pages
3 篇 semantics
3 篇 feature extracti...
3 篇 training
3 篇 heuristic algori...
2 篇 computer science
2 篇 conferences
2 篇 reliability
2 篇 noise reduction
2 篇 search-based sof...
2 篇 delays
2 篇 throughput
2 篇 dictionaries
2 篇 face recognition

机构

4 篇 school of inform...
3 篇 college of compu...
2 篇 college of compu...
2 篇 school of electr...
1 篇 state key labora...
1 篇 national institu...
1 篇 school of comput...
1 篇 computer school ...
1 篇 national satelli...
1 篇 college of compu...
1 篇 dept. computer s...
1 篇 inspur group co....
1 篇 institute of com...
1 篇 new mexico state...
1 篇 faculty of mecha...
1 篇 college of infor...
1 篇 department of me...
1 篇 faculty of engin...
1 篇 department of el...
1 篇 max-planck-insti...

作者

3 篇 chu shu-chuan
3 篇 zoran ivanovski
2 篇 enrico masala
2 篇 wu tsu-yang
2 篇 guojun wang
1 篇 ahlem saddoud
1 篇 debie essam
1 篇 kim seokhwan
1 篇 zhanyang gao
1 篇 lu ke
1 篇 wei hu
1 篇 fister jr. iztok
1 篇 qiang yang
1 篇 reitzig raphael
1 篇 van der lugt aad
1 篇 lailong luo
1 篇 amorim rainer
1 篇 antonio servetti
1 篇 guido maria cort...
1 篇 kačič zdravko

语言

99 篇 英文
3 篇 中文

检索条件"任意字段=15th Workshop on Algorithm Engineering and Experiments, ALENEX 2013"

共 102 条记录，以下是31-40 订阅

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

详细简洁

排序：

Proceedings of the workshop on algorithm engineering and experiments

Proceedings of the Workshop on Algorithm Engineering and Exp...

引用

15th workshop on algorithm engineering and experiments, alenex 2013

ISBN: (纸本)9781611972535

the proceedings contain 15 papers. the topics discussed include: efficient algorithms for dualizing large-scale hypergraphs;a min-edge cost flow framework for capacitated covering problems;short and simple cycle separators in planar graphs;polynomial-time construction of contraction hierarchies for multi-criteria objectives;3D kinetic alpha complexes and their implementation;computational topology and normal surfaces: theoretical and experimental complexity bounds;inducing suffix and LCP arrays in external memory;lempel-ZIV factorization: simple, fast, practical;fast packed string matching for short patterns;on parallelizing matrix multiplication by the column-row method;robust gossip-based aggregation: a practical point of view;and the cost of address translation.

关键词：

来源：评论

学校读者我要写书评

暂无评论

engineering Java 7's dual pivot Quicksort using MaLiJAn: Adventures with just-in-time compilation 15

Engineering Java 7's dual pivot Quicksort using MaLiJAn: Adv...

引用

15th workshop on algorithm engineering and experiments, alenex 2013

作者： Wild, Sebastian Nebel, Markus Reitzig, Raphael Laube, Ulrich Computer Science Department University of Kaiserslautern Germany

ISBN: (纸本)9781611972535

Recent results on Java 7's dual pivot Quicksort have revealed its highly asymmetric nature. these insights suggest that asymmetric pivot choices are preferable to symmetric ones for this Quicksort variant. From a theoretical point of view, this should allow us to improve on the current implementation in Oracle's Java 7 runtime library. In this paper, we use our new tool MaLiJAn to confirm this asymptotically for combinatorial cost measures such as the total number of executed instructions. However, the observed running times show converse behavior. With the support of data provided by MaLiJAn we are able to identify the profiling capabilities of Oracle's just-in-time compiler to be responsible for this unexpected outcome. Copyright © SIAM.

关键词： Just in time production

来源：评论

学校读者我要写书评

暂无评论

A min-edge cost flow framework for capacitated covering problems 15

A min-edge cost flow framework for capacitated covering prob...

引用

15th workshop on algorithm engineering and experiments, alenex 2013

作者： Chang, Jessica Khuller, Samir Dept. of Computer Science and Engineering University of Washington SeattleWA98195 United States Dept. of Computer Science University of Maryland College ParkMD20742 United States

ISBN: (纸本)9781611972535

In this work, we introduce the Cov-MECF framework, a special case of minimum-edge cost flow in which the input graph is bipartite. We observe that several important covering (and multi-covering) problems are captured in this unifying model and introduce a new heuristic LPO for any problem in this framework. the essence of LPO harnesses as an oracle the fractional solution in deciding how to greedily modify the partial solution. We empirically establish that this heuristic returns solutions that are higher in quality than those of Wolsey's algorithm. We also apply the analogs of Leskovec et. al.'s [25] optimization to LPO and introduce a further freezing optimization to both algorithms. We observe that the former optimization generally benefits LPO more than Wolsey's algorithm, and that the additional freezing step often corrects suboptimalities while further reducing the number of subroutine calls. We tested these implementations on randomly generated testbeds, several instances from the Second DIMACS Implementation Challenge and a couple networks modeling realworld dynamics. Copyright © SIAM.

关键词： Optimization

来源：评论

学校读者我要写书评

暂无评论

Differential evolution strategies with random forest regression in the bat algorithm

Differential evolution strategies with random forest regress...

引用

15th Annual Conference on Genetic and Evolutionary Computation, GECCO 2013

作者： Fister Jr., Iztok Fister, Dušan Faculty of Electrical Engineering and Computer Science University of Maribor Smetanova 17 2000 Maribor Slovenia Faculty of Mechanical Engineering University of Maribor Smetanova 17 2000 Maribor Slovenia

ISBN: (纸本)9781450319645

In this paper, we present a novel solution for the hybridiza- tion of the bat algorithm with differential evolution strate- gies and a random forests machine learning method. Exten- sive experiments and tests on standard benchmark functions have shown that these hybridized algorithms improved the original bat algorithm significantly.

关键词： Decision trees

来源：评论

学校读者我要写书评

暂无评论

A multi-agent genetic algorithm for resource constrained project scheduling problems

A multi-agent genetic algorithm for resource constrained pro...

引用

15th Annual Conference on Genetic and Evolutionary Computation, GECCO 2013

作者： Yuan, Xiaoxiao Xiao, Chuanfu Lv, Xiyu Liu, Jing School of Electronic Engineering Xidian University China

ISBN: (纸本)9781450319645

A multi-agent genetic algorithm is proposed to solve single-mode resource constrained project scheduling problems (MAGA-RCPSPs). In MAGA-RCPSPs, an agent represents a candidate solution to the RCPSP, and all agents live in a latticelike environment, with each agent fixed on a lattice point. In the experiments, benchmark problems Patterson and J30 are used. the results show that MAGA-RCPSPs has a good performance.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

Improved Runtime Analysis of the Simple Genetic algorithm 13

Improved Runtime Analysis of the Simple Genetic Algorithm

引用

15th Genetic and Evolutionary Computation Conference (GECCO)

作者： Oliveto, Pietro S. Witt, Carsten Univ Birmingham Sch Comp Sci Birmingham B15 2TT W Midlands England Tech Univ Denmark Lyngby Denmark

ISBN: (纸本)9781450319638

A runtime analysis of the Simple Genetic algorithm (SGA) for the On e M a x problem has recently been presented proving that the algorithm requires exponential time with overwhelming probability. this paper presents an improved analysis which overcomes some limitations of our previous one. Firstly, the new result holds for population sizes up to mu <= n(1/4-epsilon) which is an improvement up to a power of 2 larger. Secondly, we present a technique to bound the diversity of the population that does not require a bound on its bandwidth. Apart from allowing a stronger result, we believe this is a major improvement towards the reusability of the techniques in future systematic analyses of GAs. Finally, we consider the more natural S G A using selection with replacement rather than without replacement although the results hold for both algorithmic versions. experiments are presented to explore the limits of the new and previous mathematical techniques.

关键词： Simple Genetic algorithm Crossover Runtime Analysis

来源：评论

学校读者我要写书评

暂无评论

A dense stereo matching algorithm with occlusion and less or similar texture handling

A dense stereo matching algorithm with occlusion and less or...

引用

15th International Conference on Human-Computer Interaction, HCI International 2013

作者： Ju, Hehua Liang, Chao College of Electronic Information and Control Engineering Beijing University of Technology Beijing 100124 China

ISBN: (纸本)9783642393419

Due to image noise, illumination and occlusion, to get an accurate and dense disparity with stereo matching is still a challenge. In this paper, a new dense stereo matching algorithm is proposed. the proposed algorithm first use cross-based regions to compute an initial disparity map which can deal with regions with less or similar texture. Secondly, the improved hierarchical belief propagation scheme is employed to optimize the initial disparity map. then the left-right consistency check and mean-shift algorithm are used to handle occlusions. Finally, a local high-confidence strategy is used to refine the disparity map. experiments with the Middlebury dataset validate the proposed algorithm. © 2013 Springer-Verlag.

关键词： Stereo image processing

来源：评论

学校读者我要写书评

暂无评论

A novel approach to large-scale services composition

A novel approach to large-scale services composition

引用

15th Asia-Pacific Web Conference on Web Technologies and Applications, APWeb 2013

作者： Wang, Hongbing Wang, Xiaojun School of Computer Science and Engineering Southeast University Nanjing China

ISBN: (纸本)9783642374005

We investigate a multi-agent reinforcement learning model for the optimization of Web service composition in this paper. Based on the model, a multi-agent Q-learning algorithm was proposed, where agents in a team would benefit from one another. In contrast to single-agent reinforcement-learning, our algorithm can speed up the convergence to optimal policy. In addition, it allows composite service to dynamically adjust itself to fit a varying environment, where the properties of the component services continue changing. A set of experiments is given to prove the efficiency of the analysis. the advantages and the limitations of the proposed approach are also discussed. © 2013 Springer-Verlag.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

A hybrid genetic algorithm with local search approach for E/T scheduling problems on identical parallel machines

A hybrid genetic algorithm with local search approach for E/...

引用

15th Annual Conference on Genetic and Evolutionary Computation, GECCO 2013

作者： Amorim, Rainer Dias, Bruno De Freitas, Rosiane Uchoa, Eduardo PPGI/IComp UFAM Manaus-AM Brazil Institute of Computing UFAM Manaus-AM Brazil Production Engineering UFF Niteroi-RJ Brazil

ISBN: (纸本)9781450319645

this work considers scheduling problems on single and parallel machines with arbitrary processing times and independent jobs, to minimize the sum of earliness-tardiness penalties. A Genetic algorithm with a smart local search approach is presented, a 2-opt neighborhood-based with GPI moves and tie-breaking criteria, in a single sequence representation for single and multi-machine instances. Computational experiments are performed on Tanaka's instances for single machine, achieving all optimal solutions obtained by an IP exact method, for 40, 50, and 100 jobs. Moreover, our method is also suitable for dealing with multi-machine instances, achieving good solutions in a reasonable execution time, for 40, 50, and 100 jobs, with 2, 4, and 10 machines.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Depth camera based real-time fingertip detection using multi-view projection

Depth camera based real-time fingertip detection using multi...

引用

15th International Conference on Human-Computer Interaction, HCI International 2013

作者： Yang, Weixin Zhong, Zhengyang Zhang, Xin Jin, Lianwen Xiong, Chenlin Wang, Pengwei School of Electronic and Information Engineering South China University of Technology Guangzhou China

ISBN: (纸本)9783642393419

We propose a real-time fingertip detection algorithm based on depth information. It can robustly detect single fingertip regardless of the position and direction of the hand. With the depth information of front view, depth map of top view and side view is generated. Due to the difference between finger thickness and fist thickness, we use thickness histogram to segment the finger from the fist. Among finger points, the farthest point from palm center is the detected fingertip. We collected over 3,000 frames writing-in-the-air sequences to test our algorithm. From our experiments, the proposed algorithm can detect the fingertip with robustness and accuracy. © 2013 Springer-Verlag.

关键词： Palmprint recognition

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共11页 << < 1 2 3 4 5 6 7 8 9 10 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：